./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0711b438d0d2afa4fffa63386473ee639287532b6c251965b805578df4439a7a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:54:20,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:54:20,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:54:20,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:54:20,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:54:20,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:54:20,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:54:20,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:54:20,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:54:20,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:54:20,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:54:20,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:54:20,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:54:20,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:54:20,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:54:20,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:54:20,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:54:20,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:54:20,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:54:20,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:54:20,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:54:20,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:54:20,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:54:20,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:54:20,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:54:20,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:54:20,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:54:20,263 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:54:20,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:54:20,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:54:20,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:54:20,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:54:20,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:54:20,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:54:20,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:54:20,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:54:20,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:54:20,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:54:20,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:54:20,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:54:20,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:54:20,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:54:20,267 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 0711b438d0d2afa4fffa63386473ee639287532b6c251965b805578df4439a7a [2024-11-12 05:54:20,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:54:20,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:54:20,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:54:20,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:54:20,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:54:20,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-52.i [2024-11-12 05:54:22,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:54:22,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:54:22,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-52.i [2024-11-12 05:54:22,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f51de18/714f640c46564a3aace85f8ac35fe5fa/FLAGc2022f844 [2024-11-12 05:54:22,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f51de18/714f640c46564a3aace85f8ac35fe5fa [2024-11-12 05:54:22,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:54:22,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:54:22,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:54:22,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:54:22,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:54:22,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465cd681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22, skipping insertion in model container [2024-11-12 05:54:22,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:54:22,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-52.i[915,928] [2024-11-12 05:54:22,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:54:22,566 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:54:22,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-52.i[915,928] [2024-11-12 05:54:22,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:54:22,622 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:54:22,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22 WrapperNode [2024-11-12 05:54:22,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:54:22,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:54:22,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:54:22,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:54:22,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,690 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-12 05:54:22,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:54:22,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:54:22,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:54:22,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:54:22,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,766 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]. [2024-11-12 05:54:22,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:54:22,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:54:22,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:54:22,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:54:22,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (1/1) ... [2024-11-12 05:54:22,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:54:22,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:54:22,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:54:22,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:54:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:54:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:54:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:54:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:54:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:54:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:54:22,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:54:22,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:54:23,526 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 05:54:23,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:54:23,553 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:54:23,553 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:54:23,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:23 BoogieIcfgContainer [2024-11-12 05:54:23,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:54:23,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:54:23,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:54:23,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:54:23,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:54:22" (1/3) ... [2024-11-12 05:54:23,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a82eecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:23, skipping insertion in model container [2024-11-12 05:54:23,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:22" (2/3) ... [2024-11-12 05:54:23,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a82eecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:23, skipping insertion in model container [2024-11-12 05:54:23,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:23" (3/3) ... [2024-11-12 05:54:23,569 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-52.i [2024-11-12 05:54:23,589 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:54:23,589 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:54:23,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:54:23,655 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;@647ca8aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:54:23,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:54:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 05:54:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 05:54:23,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:23,669 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:54:23,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:23,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 384959832, now seen corresponding path program 1 times [2024-11-12 05:54:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276734599] [2024-11-12 05:54:23,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:54:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:54:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:54:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:54:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:54:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:54:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:54:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:54:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:54:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:54:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:54:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:54:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 05:54:24,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:54:24,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276734599] [2024-11-12 05:54:24,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276734599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:24,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:54:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008565095] [2024-11-12 05:54:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:24,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:54:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:54:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:54:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:54:24,186 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 05:54:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:24,206 INFO L93 Difference]: Finished difference Result 97 states and 158 transitions. [2024-11-12 05:54:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:54:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2024-11-12 05:54:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:24,215 INFO L225 Difference]: With dead ends: 97 [2024-11-12 05:54:24,217 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 05:54:24,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:54:24,224 INFO L435 NwaCegarLoop]: 69 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, 69 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 [2024-11-12 05:54:24,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:54:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 05:54:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 05:54:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 05:54:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-12 05:54:24,328 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 86 [2024-11-12 05:54:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:24,328 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-12 05:54:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 05:54:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-12 05:54:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 05:54:24,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:24,339 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:54:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:54:24,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:24,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash 260844888, now seen corresponding path program 1 times [2024-11-12 05:54:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860985059] [2024-11-12 05:54:24,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:54:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:54:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:54:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:54:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:54:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:54:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:54:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:54:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:54:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:54:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:54:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:54:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 05:54:33,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:54:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860985059] [2024-11-12 05:54:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860985059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 05:54:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965165142] [2024-11-12 05:54:33,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 05:54:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:54:33,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 05:54:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 05:54:33,326 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 05:54:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:33,941 INFO L93 Difference]: Finished difference Result 205 states and 292 transitions. [2024-11-12 05:54:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:54:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-12 05:54:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:33,944 INFO L225 Difference]: With dead ends: 205 [2024-11-12 05:54:33,944 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 05:54:33,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-12 05:54:33,946 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 277 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:33,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 328 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:54:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 05:54:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2024-11-12 05:54:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 86 states have internal predecessors, (111), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 05:54:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-12 05:54:33,974 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 86 [2024-11-12 05:54:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-12 05:54:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 05:54:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-12 05:54:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 05:54:33,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:33,977 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:54:33,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:54:33,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash 519010326, now seen corresponding path program 1 times [2024-11-12 05:54:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116137879] [2024-11-12 05:54:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:54:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:54:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:54:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:54:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:54:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:54:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:54:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:54:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:54:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:54:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:54:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:54:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 05:54:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:54:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116137879] [2024-11-12 05:54:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116137879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:34,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:34,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:54:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275056006] [2024-11-12 05:54:34,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:34,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:54:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:54:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:54:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:54:34,262 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 05:54:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:34,383 INFO L93 Difference]: Finished difference Result 300 states and 423 transitions. [2024-11-12 05:54:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:54:34,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-12 05:54:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:34,390 INFO L225 Difference]: With dead ends: 300 [2024-11-12 05:54:34,390 INFO L226 Difference]: Without dead ends: 184 [2024-11-12 05:54:34,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:54:34,392 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 78 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:34,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 146 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:54:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-12 05:54:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 115. [2024-11-12 05:54:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:54:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2024-11-12 05:54:34,422 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 86 [2024-11-12 05:54:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:34,423 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2024-11-12 05:54:34,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 05:54:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2024-11-12 05:54:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 05:54:34,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:34,424 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:54:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:54:34,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:34,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1833572630, now seen corresponding path program 1 times [2024-11-12 05:54:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545932084] [2024-11-12 05:54:34,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:54:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:54:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:54:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:54:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:54:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:54:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:54:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:54:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:54:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:54:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:54:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:54:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 05:54:34,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:54:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545932084] [2024-11-12 05:54:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545932084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:34,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:54:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808911755] [2024-11-12 05:54:34,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:34,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:54:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:54:34,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:54:34,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:54:34,604 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 05:54:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:34,684 INFO L93 Difference]: Finished difference Result 337 states and 467 transitions. [2024-11-12 05:54:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:54:34,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-12 05:54:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:34,686 INFO L225 Difference]: With dead ends: 337 [2024-11-12 05:54:34,686 INFO L226 Difference]: Without dead ends: 225 [2024-11-12 05:54:34,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:54:34,688 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 94 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:34,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 224 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:54:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-12 05:54:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 118. [2024-11-12 05:54:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:54:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2024-11-12 05:54:34,700 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 86 [2024-11-12 05:54:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:34,701 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2024-11-12 05:54:34,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 05:54:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2024-11-12 05:54:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 05:54:34,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:34,702 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:54:34,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:54:34,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:34,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1575407192, now seen corresponding path program 1 times [2024-11-12 05:54:34,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:34,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566756873] [2024-11-12 05:54:34,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:34,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat