./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_100-1loop_file-26.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 3a05c4cd155494b334138871edc7853c0d0fcd1ccd2ec892619f7fa2811e9969 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:44:09,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:44:09,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:44:09,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:44:09,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:44:09,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:44:09,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:44:09,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:44:09,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:44:09,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:44:09,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:44:09,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:44:09,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:44:09,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:44:09,559 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:44:09,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:44:09,560 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:44:09,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:44:09,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:44:09,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:44:09,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:44:09,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:44:09,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:44:09,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:44:09,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:44:09,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:44:09,562 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/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 -> 3a05c4cd155494b334138871edc7853c0d0fcd1ccd2ec892619f7fa2811e9969 [2025-03-03 22:44:09,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:44:09,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:44:09,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:44:09,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:44:09,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:44:09,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-26.i [2025-03-03 22:44:11,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccfa3ea6/ff498fc65918484a82f2bb59375b6ba1/FLAG1b2de246e [2025-03-03 22:44:11,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:44:11,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-26.i [2025-03-03 22:44:11,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccfa3ea6/ff498fc65918484a82f2bb59375b6ba1/FLAG1b2de246e [2025-03-03 22:44:11,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccfa3ea6/ff498fc65918484a82f2bb59375b6ba1 [2025-03-03 22:44:11,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:44:11,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:44:11,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:44:11,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:44:11,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:44:11,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35093058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11, skipping insertion in model container [2025-03-03 22:44:11,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:44:11,391 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_100-1loop_file-26.i[916,929] [2025-03-03 22:44:11,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:44:11,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:44:11,497 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_100-1loop_file-26.i[916,929] [2025-03-03 22:44:11,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:44:11,555 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:44:11,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11 WrapperNode [2025-03-03 22:44:11,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:44:11,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:44:11,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:44:11,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:44:11,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,626 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2025-03-03 22:44:11,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:44:11,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:44:11,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:44:11,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:44:11,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,670 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-03-03 22:44:11,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:44:11,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:44:11,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:44:11,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:44:11,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (1/1) ... [2025-03-03 22:44:11,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:44:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:44:11,727 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) [2025-03-03 22:44:11,730 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 [2025-03-03 22:44:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:44:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:44:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:44:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:44:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:44:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:44:11,817 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:44:11,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:44:12,157 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1; [2025-03-03 22:44:12,200 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-03 22:44:12,200 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:44:12,218 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:44:12,219 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:44:12,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:12 BoogieIcfgContainer [2025-03-03 22:44:12,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:44:12,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:44:12,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:44:12,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:44:12,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:44:11" (1/3) ... [2025-03-03 22:44:12,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30849f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:12, skipping insertion in model container [2025-03-03 22:44:12,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:11" (2/3) ... [2025-03-03 22:44:12,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30849f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:12, skipping insertion in model container [2025-03-03 22:44:12,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:12" (3/3) ... [2025-03-03 22:44:12,228 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-26.i [2025-03-03 22:44:12,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:44:12,242 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-26.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:44:12,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:44:12,303 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;@2258a186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:44:12,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:44:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:44:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 22:44:12,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:12,321 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:12,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -621787247, now seen corresponding path program 1 times [2025-03-03 22:44:12,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:12,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126360035] [2025-03-03 22:44:12,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:12,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:44:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:44:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:12,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 22:44:12,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:12,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126360035] [2025-03-03 22:44:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126360035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:44:12,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331841340] [2025-03-03 22:44:12,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:12,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:44:12,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:44:12,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:44:12,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:44:12,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:44:12,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:44:12,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:12,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:12,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:44:12,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:44:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 22:44:12,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:44:12,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331841340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:12,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:44:12,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:44:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501724691] [2025-03-03 22:44:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:12,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:44:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:12,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:44:12,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:44:12,895 INFO L87 Difference]: Start difference. First operand has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:44:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:12,927 INFO L93 Difference]: Finished difference Result 199 states and 341 transitions. [2025-03-03 22:44:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:44:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 197 [2025-03-03 22:44:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:12,935 INFO L225 Difference]: With dead ends: 199 [2025-03-03 22:44:12,936 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 22:44:12,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-03-03 22:44:12,942 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:12,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:44:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 22:44:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-03 22:44:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:44:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2025-03-03 22:44:12,988 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 197 [2025-03-03 22:44:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:12,989 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2025-03-03 22:44:12,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:44:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2025-03-03 22:44:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 22:44:12,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:12,994 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:13,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:44:13,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:44:13,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:13,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1715708559, now seen corresponding path program 1 times [2025-03-03 22:44:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448042287] [2025-03-03 22:44:13,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:13,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:44:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:44:13,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:13,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:44:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448042287] [2025-03-03 22:44:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448042287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:44:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779511075] [2025-03-03 22:44:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:13,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:44:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:13,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:44:13,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:44:13,677 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:13,736 INFO L93 Difference]: Finished difference Result 288 states and 450 transitions. [2025-03-03 22:44:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:44:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2025-03-03 22:44:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:13,741 INFO L225 Difference]: With dead ends: 288 [2025-03-03 22:44:13,741 INFO L226 Difference]: Without dead ends: 193 [2025-03-03 22:44:13,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-03 22:44:13,743 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 146 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:13,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:44:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-03 22:44:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 99. [2025-03-03 22:44:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:44:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2025-03-03 22:44:13,762 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 197 [2025-03-03 22:44:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:13,764 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2025-03-03 22:44:13,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2025-03-03 22:44:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 22:44:13,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:13,769 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:13,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:44:13,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:13,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1205174382, now seen corresponding path program 1 times [2025-03-03 22:44:13,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395721833] [2025-03-03 22:44:13,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:13,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 22:44:13,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 22:44:13,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:13,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:44:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395721833] [2025-03-03 22:44:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395721833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:44:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692554540] [2025-03-03 22:44:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:14,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:44:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:14,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:44:14,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:44:14,477 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:14,647 INFO L93 Difference]: Finished difference Result 301 states and 459 transitions. [2025-03-03 22:44:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:44:14,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2025-03-03 22:44:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:14,649 INFO L225 Difference]: With dead ends: 301 [2025-03-03 22:44:14,649 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 22:44:14,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:44:14,650 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 178 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:14,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 401 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:44:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 22:44:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 173. [2025-03-03 22:44:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:44:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 267 transitions. [2025-03-03 22:44:14,666 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 267 transitions. Word has length 197 [2025-03-03 22:44:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:14,666 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 267 transitions. [2025-03-03 22:44:14,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 267 transitions. [2025-03-03 22:44:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:44:14,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:14,668 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:14,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:44:14,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:14,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1309325759, now seen corresponding path program 1 times [2025-03-03 22:44:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182957401] [2025-03-03 22:44:14,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:14,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:44:14,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:44:14,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:14,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:44:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182957401] [2025-03-03 22:44:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182957401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:15,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:44:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409982523] [2025-03-03 22:44:15,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:44:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:15,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:44:15,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:44:15,011 INFO L87 Difference]: Start difference. First operand 173 states and 267 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:15,269 INFO L93 Difference]: Finished difference Result 561 states and 864 transitions. [2025-03-03 22:44:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:44:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 22:44:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:15,274 INFO L225 Difference]: With dead ends: 561 [2025-03-03 22:44:15,274 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 22:44:15,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-03-03 22:44:15,276 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 157 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:15,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 574 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:44:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 22:44:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 321. [2025-03-03 22:44:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 244 states have (on average 1.4467213114754098) internal successors, (353), 246 states have internal predecessors, (353), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:44:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 497 transitions. [2025-03-03 22:44:15,328 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 497 transitions. Word has length 198 [2025-03-03 22:44:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:15,330 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 497 transitions. [2025-03-03 22:44:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions. [2025-03-03 22:44:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:44:15,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:15,333 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:44:15,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -767883584, now seen corresponding path program 1 times [2025-03-03 22:44:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144663011] [2025-03-03 22:44:15,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:15,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:44:15,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:44:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:44:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144663011] [2025-03-03 22:44:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144663011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:15,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:44:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72358190] [2025-03-03 22:44:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:44:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:15,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:44:15,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:44:15,592 INFO L87 Difference]: Start difference. First operand 321 states and 497 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:15,813 INFO L93 Difference]: Finished difference Result 809 states and 1255 transitions. [2025-03-03 22:44:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:44:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 22:44:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:15,816 INFO L225 Difference]: With dead ends: 809 [2025-03-03 22:44:15,816 INFO L226 Difference]: Without dead ends: 491 [2025-03-03 22:44:15,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:44:15,819 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 93 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:15,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 335 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:44:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-03 22:44:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2025-03-03 22:44:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 374 states have (on average 1.4411764705882353) internal successors, (539), 377 states have internal predecessors, (539), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 22:44:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 755 transitions. [2025-03-03 22:44:15,871 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 755 transitions. Word has length 198 [2025-03-03 22:44:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:15,871 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 755 transitions. [2025-03-03 22:44:15,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:44:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 755 transitions. [2025-03-03 22:44:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:44:15,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:15,873 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:15,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:44:15,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1176707809, now seen corresponding path program 1 times [2025-03-03 22:44:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:15,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264352349] [2025-03-03 22:44:15,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:15,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:15,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:44:15,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:44:15,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:15,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:44:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264352349] [2025-03-03 22:44:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264352349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:16,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:44:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672483412] [2025-03-03 22:44:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:44:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:16,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:44:16,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:44:16,454 INFO L87 Difference]: Start difference. First operand 489 states and 755 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:44:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:17,448 INFO L93 Difference]: Finished difference Result 1627 states and 2505 transitions. [2025-03-03 22:44:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:44:17,448 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2025-03-03 22:44:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:17,458 INFO L225 Difference]: With dead ends: 1627 [2025-03-03 22:44:17,459 INFO L226 Difference]: Without dead ends: 1141 [2025-03-03 22:44:17,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:44:17,461 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 462 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:17,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 946 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:44:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-03 22:44:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1121. [2025-03-03 22:44:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 854 states have (on average 1.4320843091334894) internal successors, (1223), 861 states have internal predecessors, (1223), 252 states have call successors, (252), 14 states have call predecessors, (252), 14 states have return successors, (252), 245 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 22:44:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1727 transitions. [2025-03-03 22:44:17,590 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1727 transitions. Word has length 198 [2025-03-03 22:44:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:17,592 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1727 transitions. [2025-03-03 22:44:17,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:44:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1727 transitions. [2025-03-03 22:44:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:44:17,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:17,607 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:17,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:44:17,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash 566102526, now seen corresponding path program 1 times [2025-03-03 22:44:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893689478] [2025-03-03 22:44:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:17,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:44:17,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:44:17,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:17,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:44:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:44:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:44:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893689478] [2025-03-03 22:44:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893689478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:44:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:44:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 22:44:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332899769] [2025-03-03 22:44:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:44:23,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:44:23,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:44:23,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:44:23,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:44:23,309 INFO L87 Difference]: Start difference. First operand 1121 states and 1727 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 22:44:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:44:24,597 INFO L93 Difference]: Finished difference Result 2927 states and 4467 transitions. [2025-03-03 22:44:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:44:24,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 198 [2025-03-03 22:44:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:44:24,607 INFO L225 Difference]: With dead ends: 2927 [2025-03-03 22:44:24,607 INFO L226 Difference]: Without dead ends: 1809 [2025-03-03 22:44:24,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:44:24,611 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 772 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:44:24,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 986 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:44:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-03-03 22:44:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1281. [2025-03-03 22:44:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1014 states have (on average 1.4487179487179487) internal successors, (1469), 1021 states have internal predecessors, (1469), 252 states have call successors, (252), 14 states have call predecessors, (252), 14 states have return successors, (252), 245 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-03 22:44:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1973 transitions. [2025-03-03 22:44:24,695 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1973 transitions. Word has length 198 [2025-03-03 22:44:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:44:24,695 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1973 transitions. [2025-03-03 22:44:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 22:44:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1973 transitions. [2025-03-03 22:44:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 22:44:24,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:44:24,698 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 22:44:24,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:44:24,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:44:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:44:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash 272699519, now seen corresponding path program 1 times [2025-03-03 22:44:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:44:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650621724] [2025-03-03 22:44:24,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:44:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:44:24,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 22:44:24,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 22:44:24,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:44:24,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat