./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6abe9611945b9347dad66f4454ebe10d21d58cf2fa4c1fd6e8973cdda78a961e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:32:54,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:32:54,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:32:54,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:32:54,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:32:54,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:32:54,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:32:54,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:32:54,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:32:54,434 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:32:54,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:32:54,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:32:54,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:32:54,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:32:54,436 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:32:54,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:32:54,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:32:54,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:32:54,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:32:54,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:32:54,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:32:54,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:32:54,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:54,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:54,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:32:54,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:32:54,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:32:54,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:32:54,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:32:54,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:32:54,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:32:54,439 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6abe9611945b9347dad66f4454ebe10d21d58cf2fa4c1fd6e8973cdda78a961e [2025-01-09 10:32:54,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:32:54,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:32:54,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:32:54,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:32:54,707 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:32:54,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-01-09 10:32:55,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3655876f8/ad4e534e445a4ca2980adb758a12a325/FLAG10cd3c9ef [2025-01-09 10:32:56,077 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:32:56,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-01-09 10:32:56,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3655876f8/ad4e534e445a4ca2980adb758a12a325/FLAG10cd3c9ef [2025-01-09 10:32:56,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3655876f8/ad4e534e445a4ca2980adb758a12a325 [2025-01-09 10:32:56,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:32:56,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:32:56,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:56,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:32:56,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:32:56,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f93a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56, skipping insertion in model container [2025-01-09 10:32:56,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:32:56,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932] [2025-01-09 10:32:56,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:56,668 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:32:56,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932] [2025-01-09 10:32:56,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:56,734 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:32:56,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56 WrapperNode [2025-01-09 10:32:56,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:56,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:56,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:32:56,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:32:56,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,802 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-01-09 10:32:56,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:56,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:32:56,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:32:56,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:32:56,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:32:56,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:32:56,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:32:56,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:32:56,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:32:56,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (1/1) ... [2025-01-09 10:32:56,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:56,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:56,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:32:56,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:32:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:32:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:32:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:32:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:32:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:32:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:32:56,988 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:32:56,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:32:57,408 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 10:32:57,409 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:32:57,415 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:32:57,416 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:32:57,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:57 BoogieIcfgContainer [2025-01-09 10:32:57,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:32:57,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:32:57,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:32:57,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:32:57,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:56" (1/3) ... [2025-01-09 10:32:57,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615424e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:57, skipping insertion in model container [2025-01-09 10:32:57,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:56" (2/3) ... [2025-01-09 10:32:57,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615424e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:57, skipping insertion in model container [2025-01-09 10:32:57,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:57" (3/3) ... [2025-01-09 10:32:57,422 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-01-09 10:32:57,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:32:57,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:32:57,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:32:57,486 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@dea6961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:32:57,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:32:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 10:32:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:32:57,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:57,499 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:57,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:57,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:57,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1211168482, now seen corresponding path program 1 times [2025-01-09 10:32:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495406097] [2025-01-09 10:32:57,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:57,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:32:57,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:32:57,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:57,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 10:32:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495406097] [2025-01-09 10:32:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495406097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410888876] [2025-01-09 10:32:57,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:57,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:57,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:57,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:57,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:32:57,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:32:57,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:32:57,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:57,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:57,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:32:58,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 10:32:58,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:32:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410888876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:32:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:32:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526604382] [2025-01-09 10:32:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:58,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:32:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:58,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:32:58,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:58,061 INFO L87 Difference]: Start difference. First operand has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:32:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:58,088 INFO L93 Difference]: Finished difference Result 186 states and 326 transitions. [2025-01-09 10:32:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:32:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2025-01-09 10:32:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:58,096 INFO L225 Difference]: With dead ends: 186 [2025-01-09 10:32:58,096 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 10:32:58,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:58,104 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:58,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:32:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 10:32:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 10:32:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 64 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 10:32:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2025-01-09 10:32:58,152 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 174 [2025-01-09 10:32:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:58,153 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2025-01-09 10:32:58,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:32:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2025-01-09 10:32:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:32:58,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:58,158 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:58,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:32:58,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:32:58,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:58,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1845768544, now seen corresponding path program 1 times [2025-01-09 10:32:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:58,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018205089] [2025-01-09 10:32:58,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:58,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:58,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:32:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:32:58,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:58,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:32:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018205089] [2025-01-09 10:32:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018205089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:58,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:58,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:32:58,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658388189] [2025-01-09 10:32:58,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:58,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:32:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:58,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:32:58,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:32:58,651 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:32:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:58,713 INFO L93 Difference]: Finished difference Result 184 states and 291 transitions. [2025-01-09 10:32:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:32:58,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-01-09 10:32:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:58,718 INFO L225 Difference]: With dead ends: 184 [2025-01-09 10:32:58,718 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 10:32:58,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:32:58,719 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:58,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:32:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 10:32:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 10:32:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 10:32:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2025-01-09 10:32:58,732 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 174 [2025-01-09 10:32:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:58,735 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2025-01-09 10:32:58,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:32:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2025-01-09 10:32:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:32:58,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:58,738 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:58,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:32:58,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:58,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash -674191390, now seen corresponding path program 1 times [2025-01-09 10:32:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:58,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354057016] [2025-01-09 10:32:58,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:58,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:32:58,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:32:58,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:58,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:32:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354057016] [2025-01-09 10:32:58,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354057016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:58,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:58,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:32:58,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344125330] [2025-01-09 10:32:58,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:58,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:32:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:58,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:32:58,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:32:58,975 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:32:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:59,218 INFO L93 Difference]: Finished difference Result 277 states and 436 transitions. [2025-01-09 10:32:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:32:59,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-01-09 10:32:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:59,223 INFO L225 Difference]: With dead ends: 277 [2025-01-09 10:32:59,225 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 10:32:59,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:32:59,227 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 114 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:59,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 500 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:32:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 10:32:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2025-01-09 10:32:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 10:32:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 220 transitions. [2025-01-09 10:32:59,275 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 220 transitions. Word has length 174 [2025-01-09 10:32:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:59,276 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 220 transitions. [2025-01-09 10:32:59,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:32:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions. [2025-01-09 10:32:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:32:59,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:59,278 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:59,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:32:59,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:59,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash -251489564, now seen corresponding path program 1 times [2025-01-09 10:32:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:59,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964878735] [2025-01-09 10:32:59,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:59,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:32:59,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:32:59,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:59,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964878735] [2025-01-09 10:33:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964878735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:33:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252136740] [2025-01-09 10:33:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:06,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:33:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:06,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:33:06,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:33:06,467 INFO L87 Difference]: Start difference. First operand 141 states and 220 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:09,818 INFO L93 Difference]: Finished difference Result 464 states and 727 transitions. [2025-01-09 10:33:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:33:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-01-09 10:33:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:09,821 INFO L225 Difference]: With dead ends: 464 [2025-01-09 10:33:09,821 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 10:33:09,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2025-01-09 10:33:09,823 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1113 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:09,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1096 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 10:33:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 10:33:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 183. [2025-01-09 10:33:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 10:33:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 285 transitions. [2025-01-09 10:33:09,848 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 285 transitions. Word has length 174 [2025-01-09 10:33:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:09,848 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 285 transitions. [2025-01-09 10:33:09,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 285 transitions. [2025-01-09 10:33:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:33:09,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:09,853 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:09,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:33:09,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:09,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash 449575014, now seen corresponding path program 1 times [2025-01-09 10:33:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:09,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203309915] [2025-01-09 10:33:09,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:09,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:33:09,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:33:09,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:09,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203309915] [2025-01-09 10:33:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203309915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:33:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781906508] [2025-01-09 10:33:10,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:10,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:33:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:10,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:33:10,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:33:10,063 INFO L87 Difference]: Start difference. First operand 183 states and 285 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:10,116 INFO L93 Difference]: Finished difference Result 357 states and 557 transitions. [2025-01-09 10:33:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:33:10,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-01-09 10:33:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:10,118 INFO L225 Difference]: With dead ends: 357 [2025-01-09 10:33:10,118 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 10:33:10,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:33:10,119 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 169 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:10,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 324 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:33:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 10:33:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 197. [2025-01-09 10:33:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 10:33:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 305 transitions. [2025-01-09 10:33:10,137 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 305 transitions. Word has length 174 [2025-01-09 10:33:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 305 transitions. [2025-01-09 10:33:10,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 305 transitions. [2025-01-09 10:33:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 10:33:10,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:10,139 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:33:10,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2049333026, now seen corresponding path program 1 times [2025-01-09 10:33:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501509957] [2025-01-09 10:33:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:10,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 10:33:10,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 10:33:10,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:10,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501509957] [2025-01-09 10:33:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501509957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:33:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29258234] [2025-01-09 10:33:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:10,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:33:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:10,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:33:10,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:33:10,213 INFO L87 Difference]: Start difference. First operand 197 states and 305 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:10,247 INFO L93 Difference]: Finished difference Result 388 states and 605 transitions. [2025-01-09 10:33:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:33:10,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-01-09 10:33:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:10,249 INFO L225 Difference]: With dead ends: 388 [2025-01-09 10:33:10,249 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 10:33:10,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:33:10,250 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 138 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:10,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 332 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:33:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 10:33:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-01-09 10:33:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 192 states have internal predecessors, (268), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 430 transitions. [2025-01-09 10:33:10,274 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 430 transitions. Word has length 174 [2025-01-09 10:33:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:10,274 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 430 transitions. [2025-01-09 10:33:10,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 430 transitions. [2025-01-09 10:33:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:33:10,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:10,276 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:10,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:33:10,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:10,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:10,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1180021831, now seen corresponding path program 1 times [2025-01-09 10:33:10,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050345919] [2025-01-09 10:33:10,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:10,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:33:10,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:33:10,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:10,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:14,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:14,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050345919] [2025-01-09 10:33:14,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050345919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:14,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:14,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:33:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15430448] [2025-01-09 10:33:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:14,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:33:14,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:14,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:33:14,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:33:14,961 INFO L87 Difference]: Start difference. First operand 277 states and 430 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:18,443 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2025-01-09 10:33:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:33:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 10:33:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:18,446 INFO L225 Difference]: With dead ends: 431 [2025-01-09 10:33:18,446 INFO L226 Difference]: Without dead ends: 429 [2025-01-09 10:33:18,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2025-01-09 10:33:18,447 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 733 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:18,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1187 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 10:33:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-09 10:33:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 278. [2025-01-09 10:33:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 193 states have (on average 1.3937823834196892) internal successors, (269), 193 states have internal predecessors, (269), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 431 transitions. [2025-01-09 10:33:18,472 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 431 transitions. Word has length 175 [2025-01-09 10:33:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:18,473 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 431 transitions. [2025-01-09 10:33:18,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 431 transitions. [2025-01-09 10:33:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:33:18,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:18,477 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:18,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:33:18,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:18,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1550973203, now seen corresponding path program 1 times [2025-01-09 10:33:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316473521] [2025-01-09 10:33:18,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:18,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:33:18,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:33:18,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:18,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316473521] [2025-01-09 10:33:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316473521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:33:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670622423] [2025-01-09 10:33:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:18,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:33:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:18,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:33:18,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:33:18,611 INFO L87 Difference]: Start difference. First operand 278 states and 431 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:18,649 INFO L93 Difference]: Finished difference Result 529 states and 827 transitions. [2025-01-09 10:33:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:33:18,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 10:33:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:18,656 INFO L225 Difference]: With dead ends: 529 [2025-01-09 10:33:18,656 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 10:33:18,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:33:18,657 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 47 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:18,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 312 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:33:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 10:33:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 278. [2025-01-09 10:33:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 193 states have (on average 1.378238341968912) internal successors, (266), 193 states have internal predecessors, (266), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 428 transitions. [2025-01-09 10:33:18,678 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 428 transitions. Word has length 175 [2025-01-09 10:33:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 428 transitions. [2025-01-09 10:33:18,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 428 transitions. [2025-01-09 10:33:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:33:18,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:18,680 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:18,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:33:18,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:18,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1732876843, now seen corresponding path program 1 times [2025-01-09 10:33:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499960974] [2025-01-09 10:33:18,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:18,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:33:18,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:33:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:23,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:23,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499960974] [2025-01-09 10:33:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499960974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:23,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:33:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588030587] [2025-01-09 10:33:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:23,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:33:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:23,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:33:23,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:33:23,537 INFO L87 Difference]: Start difference. First operand 278 states and 428 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:33:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:26,590 INFO L93 Difference]: Finished difference Result 431 states and 654 transitions. [2025-01-09 10:33:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:33:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-01-09 10:33:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:26,593 INFO L225 Difference]: With dead ends: 431 [2025-01-09 10:33:26,593 INFO L226 Difference]: Without dead ends: 429 [2025-01-09 10:33:26,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2025-01-09 10:33:26,593 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 713 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:26,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1418 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 10:33:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-09 10:33:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 281. [2025-01-09 10:33:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 196 states have (on average 1.3775510204081634) internal successors, (270), 196 states have internal predecessors, (270), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 432 transitions. [2025-01-09 10:33:26,613 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 432 transitions. Word has length 175 [2025-01-09 10:33:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:26,613 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 432 transitions. [2025-01-09 10:33:26,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:33:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 432 transitions. [2025-01-09 10:33:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:33:26,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:26,615 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:26,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:33:26,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:26,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:26,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1677247982, now seen corresponding path program 1 times [2025-01-09 10:33:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:26,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676767828] [2025-01-09 10:33:26,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:26,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:26,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:33:26,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:33:26,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:26,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676767828] [2025-01-09 10:33:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676767828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:26,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:26,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:33:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661256232] [2025-01-09 10:33:26,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:26,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:33:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:26,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:33:26,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:33:26,773 INFO L87 Difference]: Start difference. First operand 281 states and 432 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:26,822 INFO L93 Difference]: Finished difference Result 544 states and 835 transitions. [2025-01-09 10:33:26,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:33:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 10:33:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:26,825 INFO L225 Difference]: With dead ends: 544 [2025-01-09 10:33:26,825 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 10:33:26,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:33:26,826 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 115 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:26,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 373 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:33:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 10:33:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 291. [2025-01-09 10:33:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 206 states have (on average 1.3737864077669903) internal successors, (283), 206 states have internal predecessors, (283), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 445 transitions. [2025-01-09 10:33:26,843 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 445 transitions. Word has length 175 [2025-01-09 10:33:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:26,844 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 445 transitions. [2025-01-09 10:33:26,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 445 transitions. [2025-01-09 10:33:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:33:26,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:26,846 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:26,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:33:26,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1916654736, now seen corresponding path program 1 times [2025-01-09 10:33:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026741058] [2025-01-09 10:33:26,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:26,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:33:26,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:33:26,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:26,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:33,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:33,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026741058] [2025-01-09 10:33:33,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026741058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:33:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856185062] [2025-01-09 10:33:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:33,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:33:33,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:33,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:33:33,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:33:33,342 INFO L87 Difference]: Start difference. First operand 291 states and 445 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:38,841 INFO L93 Difference]: Finished difference Result 524 states and 790 transitions. [2025-01-09 10:33:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 10:33:38,842 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 10:33:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:38,844 INFO L225 Difference]: With dead ends: 524 [2025-01-09 10:33:38,844 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 10:33:38,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-01-09 10:33:38,845 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 619 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:38,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1186 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 10:33:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 10:33:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 335. [2025-01-09 10:33:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 250 states have (on average 1.4) internal successors, (350), 250 states have internal predecessors, (350), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 512 transitions. [2025-01-09 10:33:38,868 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 512 transitions. Word has length 175 [2025-01-09 10:33:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:38,868 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 512 transitions. [2025-01-09 10:33:38,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 512 transitions. [2025-01-09 10:33:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 10:33:38,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:38,871 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:38,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:33:38,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1357244206, now seen corresponding path program 1 times [2025-01-09 10:33:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:38,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592576329] [2025-01-09 10:33:38,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:38,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 10:33:38,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 10:33:38,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:38,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:45,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592576329] [2025-01-09 10:33:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592576329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:33:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073945880] [2025-01-09 10:33:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:33:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:45,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:33:45,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:33:45,484 INFO L87 Difference]: Start difference. First operand 335 states and 512 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:50,044 INFO L93 Difference]: Finished difference Result 516 states and 782 transitions. [2025-01-09 10:33:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:33:50,045 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 10:33:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:50,047 INFO L225 Difference]: With dead ends: 516 [2025-01-09 10:33:50,047 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 10:33:50,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2025-01-09 10:33:50,048 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 610 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:50,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1092 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 10:33:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 10:33:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 335. [2025-01-09 10:33:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 250 states have (on average 1.4) internal successors, (350), 250 states have internal predecessors, (350), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 512 transitions. [2025-01-09 10:33:50,063 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 512 transitions. Word has length 175 [2025-01-09 10:33:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:50,063 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 512 transitions. [2025-01-09 10:33:50,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:33:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 512 transitions. [2025-01-09 10:33:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 10:33:50,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:50,066 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:50,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:33:50,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:50,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1729128992, now seen corresponding path program 1 times [2025-01-09 10:33:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:50,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562967987] [2025-01-09 10:33:50,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:50,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 10:33:50,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 10:33:50,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:50,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:33:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562967987] [2025-01-09 10:33:54,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562967987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:54,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 10:33:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205876544] [2025-01-09 10:33:54,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:54,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 10:33:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:54,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 10:33:54,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:33:54,774 INFO L87 Difference]: Start difference. First operand 335 states and 512 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:33:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:58,828 INFO L93 Difference]: Finished difference Result 499 states and 759 transitions. [2025-01-09 10:33:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:33:58,829 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2025-01-09 10:33:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:58,831 INFO L225 Difference]: With dead ends: 499 [2025-01-09 10:33:58,831 INFO L226 Difference]: Without dead ends: 497 [2025-01-09 10:33:58,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 10:33:58,832 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 671 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:58,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1691 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 10:33:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-09 10:33:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 333. [2025-01-09 10:33:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 248 states have (on average 1.3991935483870968) internal successors, (347), 248 states have internal predecessors, (347), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:33:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 509 transitions. [2025-01-09 10:33:58,850 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 509 transitions. Word has length 176 [2025-01-09 10:33:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:58,850 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 509 transitions. [2025-01-09 10:33:58,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 10:33:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 509 transitions. [2025-01-09 10:33:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 10:33:58,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:58,854 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:58,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:33:58,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1800573629, now seen corresponding path program 1 times [2025-01-09 10:33:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127904842] [2025-01-09 10:33:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:58,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 10:33:58,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 10:33:58,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:58,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:34:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:34:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:34:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127904842] [2025-01-09 10:34:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127904842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:34:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:34:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:34:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019929830] [2025-01-09 10:34:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:34:04,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:34:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:34:04,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:34:04,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:34:04,094 INFO L87 Difference]: Start difference. First operand 333 states and 509 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:34:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:34:10,398 INFO L93 Difference]: Finished difference Result 551 states and 835 transitions. [2025-01-09 10:34:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 10:34:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 10:34:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:34:10,401 INFO L225 Difference]: With dead ends: 551 [2025-01-09 10:34:10,401 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 10:34:10,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 10:34:10,403 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 602 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:34:10,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1537 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 10:34:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 10:34:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 343. [2025-01-09 10:34:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 258 states have (on average 1.3992248062015504) internal successors, (361), 258 states have internal predecessors, (361), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 10:34:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 523 transitions. [2025-01-09 10:34:10,418 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 523 transitions. Word has length 176 [2025-01-09 10:34:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:34:10,418 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 523 transitions. [2025-01-09 10:34:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 10:34:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 523 transitions. [2025-01-09 10:34:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 10:34:10,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:34:10,420 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:34:10,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:34:10,420 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:34:10,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:34:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2095263203, now seen corresponding path program 1 times [2025-01-09 10:34:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:34:10,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34464390] [2025-01-09 10:34:10,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:34:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:34:10,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 10:34:10,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 10:34:10,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:34:10,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:34:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 10:34:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:34:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34464390] [2025-01-09 10:34:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34464390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:34:16,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:34:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:34:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102906303] [2025-01-09 10:34:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:34:16,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:34:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:34:16,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:34:16,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:34:16,496 INFO L87 Difference]: Start difference. First operand 343 states and 523 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27)