./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invariants64/linear-inequality-inv-d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/loop-invariants64/linear-inequality-inv-d.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 87519343d07fb680fe2f0e8c357c18ba883357d08bc5bf0ec4a3dc8f1cac4329 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:40:10,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:40:10,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 13:40:10,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:40:10,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:40:10,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:40:10,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:40:10,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:40:10,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:40:10,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:40:10,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:40:10,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:40:10,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:40:10,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:40:10,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:40:10,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:40:10,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:40:10,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:40:10,618 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87519343d07fb680fe2f0e8c357c18ba883357d08bc5bf0ec4a3dc8f1cac4329 [2025-03-03 13:40:10,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:40:10,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:40:10,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:40:10,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:40:10,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:40:10,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invariants64/linear-inequality-inv-d.c [2025-03-03 13:40:11,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c370e3603/5c7c52f042ee4f42b2b8ceb753023f06/FLAGe8ae0feef [2025-03-03 13:40:12,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:40:12,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants64/linear-inequality-inv-d.c [2025-03-03 13:40:12,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c370e3603/5c7c52f042ee4f42b2b8ceb753023f06/FLAGe8ae0feef [2025-03-03 13:40:12,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c370e3603/5c7c52f042ee4f42b2b8ceb753023f06 [2025-03-03 13:40:12,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:40:12,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:40:12,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:40:12,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:40:12,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:40:12,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354528cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12, skipping insertion in model container [2025-03-03 13:40:12,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:40:12,266 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/loop-invariants64/linear-inequality-inv-d.c[858,871] [2025-03-03 13:40:12,268 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/loop-invariants64/linear-inequality-inv-d.c[950,963] [2025-03-03 13:40:12,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:40:12,276 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:40:12,284 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/loop-invariants64/linear-inequality-inv-d.c[858,871] [2025-03-03 13:40:12,285 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/loop-invariants64/linear-inequality-inv-d.c[950,963] [2025-03-03 13:40:12,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:40:12,293 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:40:12,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12 WrapperNode [2025-03-03 13:40:12,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:40:12,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:40:12,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:40:12,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:40:12,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,312 INFO L138 Inliner]: procedures = 11, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2025-03-03 13:40:12,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:40:12,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:40:12,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:40:12,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:40:12,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,327 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 13:40:12,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:40:12,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:40:12,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:40:12,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:40:12,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (1/1) ... [2025-03-03 13:40:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:40:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:12,362 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 13:40:12,365 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 13:40:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:40:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:40:12,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:40:12,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:40:12,423 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:40:12,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:40:12,515 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 13:40:12,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:40:12,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:40:12,525 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:40:12,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:40:12 BoogieIcfgContainer [2025-03-03 13:40:12,525 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:40:12,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:40:12,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:40:12,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:40:12,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:40:12" (1/3) ... [2025-03-03 13:40:12,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562ddef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:40:12, skipping insertion in model container [2025-03-03 13:40:12,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:12" (2/3) ... [2025-03-03 13:40:12,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562ddef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:40:12, skipping insertion in model container [2025-03-03 13:40:12,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:40:12" (3/3) ... [2025-03-03 13:40:12,533 INFO L128 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-d.c [2025-03-03 13:40:12,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:40:12,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linear-inequality-inv-d.c that has 1 procedures, 13 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-03 13:40:12,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:40:12,596 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;@3a7940a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:40:12,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 13:40:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 10 states have (on average 1.6) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 13:40:12,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:12,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 13:40:12,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:12,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1537349562, now seen corresponding path program 1 times [2025-03-03 13:40:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353750679] [2025-03-03 13:40:12,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:12,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 13:40:12,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 13:40:12,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:12,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353750679] [2025-03-03 13:40:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353750679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:40:12,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:40:12,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:40:12,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581671828] [2025-03-03 13:40:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:40:12,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:40:12,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:12,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:40:12,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:40:12,821 INFO L87 Difference]: Start difference. First operand has 13 states, 10 states have (on average 1.6) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:12,839 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-03-03 13:40:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:40:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-03 13:40:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:12,844 INFO L225 Difference]: With dead ends: 23 [2025-03-03 13:40:12,844 INFO L226 Difference]: Without dead ends: 11 [2025-03-03 13:40:12,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:40:12,847 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:12,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-03 13:40:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-03 13:40:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-03 13:40:12,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2025-03-03 13:40:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:12,867 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-03 13:40:12,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-03 13:40:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 13:40:12,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:12,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:12,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:40:12,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:12,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 413169300, now seen corresponding path program 1 times [2025-03-03 13:40:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200751426] [2025-03-03 13:40:12,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:12,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:40:12,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:40:12,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200751426] [2025-03-03 13:40:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200751426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005962123] [2025-03-03 13:40:13,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:13,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:13,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:13,013 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 13:40:13,014 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 13:40:13,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:40:13,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:40:13,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:13,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:40:13,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:13,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005962123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:13,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:13,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 13:40:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955668247] [2025-03-03 13:40:13,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:13,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:40:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:13,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:40:13,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:40:13,240 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:13,300 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2025-03-03 13:40:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:40:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-03 13:40:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:13,301 INFO L225 Difference]: With dead ends: 20 [2025-03-03 13:40:13,301 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 13:40:13,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:40:13,302 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:13,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 13:40:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-03 13:40:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-03 13:40:13,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2025-03-03 13:40:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:13,306 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-03 13:40:13,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-03-03 13:40:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:40:13,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:13,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:13,314 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 13:40:13,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:13,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash -76652777, now seen corresponding path program 1 times [2025-03-03 13:40:13,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:13,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859322831] [2025-03-03 13:40:13,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:13,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:40:13,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:40:13,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:13,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:13,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:13,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859322831] [2025-03-03 13:40:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859322831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:13,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649267414] [2025-03-03 13:40:13,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:13,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:13,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:13,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:13,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:40:13,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:40:13,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:40:13,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:13,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:13,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:40:13,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:13,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649267414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:13,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 13:40:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078757918] [2025-03-03 13:40:13,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:40:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:13,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:40:13,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:40:13,727 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:13,743 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-03-03 13:40:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:40:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:40:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:13,744 INFO L225 Difference]: With dead ends: 22 [2025-03-03 13:40:13,744 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 13:40:13,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:40:13,745 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:13,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 13:40:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 13:40:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-03 13:40:13,747 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 8 [2025-03-03 13:40:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:13,747 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-03 13:40:13,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-03 13:40:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 13:40:13,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:13,748 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:13,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:40:13,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 13:40:13,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:13,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash -676331974, now seen corresponding path program 2 times [2025-03-03 13:40:13,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:13,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112353544] [2025-03-03 13:40:13,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:13,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-03 13:40:13,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 13:40:13,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:13,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112353544] [2025-03-03 13:40:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112353544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993545892] [2025-03-03 13:40:14,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:14,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:14,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:14,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:14,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:40:14,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-03 13:40:14,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 13:40:14,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:14,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:14,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:40:14,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:14,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993545892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:14,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 13:40:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023901807] [2025-03-03 13:40:14,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:14,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:40:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:14,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:40:14,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:40:14,371 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:14,520 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-03-03 13:40:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:40:14,521 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 13:40:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:14,522 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:40:14,522 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 13:40:14,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:40:14,523 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:14,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 13:40:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-03 13:40:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-03-03 13:40:14,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2025-03-03 13:40:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:14,530 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-03-03 13:40:14,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-03-03 13:40:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:40:14,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:14,531 INFO L218 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:14,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:40:14,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:14,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:14,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2003695025, now seen corresponding path program 2 times [2025-03-03 13:40:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437946311] [2025-03-03 13:40:14,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:14,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:40:14,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:40:14,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:14,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437946311] [2025-03-03 13:40:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437946311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458660417] [2025-03-03 13:40:14,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:14,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:14,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:15,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:15,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:40:15,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:40:15,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:40:15,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:15,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:15,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:40:15,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:15,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458660417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:15,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2025-03-03 13:40:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587152643] [2025-03-03 13:40:15,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 13:40:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:15,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 13:40:15,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:40:15,377 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:15,424 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2025-03-03 13:40:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:40:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:40:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:15,425 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:40:15,425 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 13:40:15,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:40:15,426 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:15,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 32 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 13:40:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2025-03-03 13:40:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-03-03 13:40:15,430 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2025-03-03 13:40:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:15,430 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-03 13:40:15,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-03-03 13:40:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:40:15,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:15,430 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:15,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:15,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:15,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:15,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1984118778, now seen corresponding path program 3 times [2025-03-03 13:40:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:15,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284879584] [2025-03-03 13:40:15,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:15,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-03-03 13:40:15,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:40:15,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:40:15,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284879584] [2025-03-03 13:40:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284879584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267995073] [2025-03-03 13:40:15,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:15,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:15,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:15,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:40:15,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-03-03 13:40:15,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:40:15,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:40:15,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:15,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:40:15,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:16,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267995073] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:16,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:16,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-03 13:40:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001161239] [2025-03-03 13:40:16,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:16,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:40:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:16,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:40:16,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=350, Unknown=0, NotChecked=0, Total=600 [2025-03-03 13:40:16,618 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:17,052 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-03-03 13:40:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 13:40:17,052 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 13:40:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:17,053 INFO L225 Difference]: With dead ends: 51 [2025-03-03 13:40:17,053 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 13:40:17,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=750, Invalid=1230, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 13:40:17,054 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:17,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 13:40:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-03 13:40:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-03-03 13:40:17,060 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 16 [2025-03-03 13:40:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:17,060 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-03-03 13:40:17,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-03-03 13:40:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:40:17,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:17,061 INFO L218 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:17,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:17,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:17,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:17,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1490816463, now seen corresponding path program 3 times [2025-03-03 13:40:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:17,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590105233] [2025-03-03 13:40:17,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:17,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 11 equivalence classes. [2025-03-03 13:40:17,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:40:17,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 13:40:17,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590105233] [2025-03-03 13:40:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590105233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571278211] [2025-03-03 13:40:17,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:17,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:17,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:17,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:17,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:40:18,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 11 equivalence classes. [2025-03-03 13:40:18,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:40:18,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 13:40:18,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:18,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 13:40:18,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:18,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571278211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:18,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:18,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 45 [2025-03-03 13:40:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115202759] [2025-03-03 13:40:18,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:18,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 13:40:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:18,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 13:40:18,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 13:40:18,984 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:19,092 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2025-03-03 13:40:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 13:40:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:40:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:19,093 INFO L225 Difference]: With dead ends: 98 [2025-03-03 13:40:19,093 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 13:40:19,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 13:40:19,095 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:19,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 53 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 13:40:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2025-03-03 13:40:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2025-03-03 13:40:19,106 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 27 [2025-03-03 13:40:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:19,106 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2025-03-03 13:40:19,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2025-03-03 13:40:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:40:19,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:19,107 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:19,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:19,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:19,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1028445050, now seen corresponding path program 4 times [2025-03-03 13:40:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407828633] [2025-03-03 13:40:19,309 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:19,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:19,313 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 13:40:19,344 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:19,344 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:19,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407828633] [2025-03-03 13:40:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407828633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711869244] [2025-03-03 13:40:19,915 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:19,917 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:19,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:40:19,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 13:40:19,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:40:19,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:19,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:19,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:40:19,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:20,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711869244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:20,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-03 13:40:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165312712] [2025-03-03 13:40:20,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:20,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 13:40:20,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:20,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 13:40:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1066, Invalid=1286, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:40:20,925 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:21,776 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2025-03-03 13:40:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-03 13:40:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-03 13:40:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:21,777 INFO L225 Difference]: With dead ends: 87 [2025-03-03 13:40:21,777 INFO L226 Difference]: Without dead ends: 59 [2025-03-03 13:40:21,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3222, Invalid=5334, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 13:40:21,779 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 67 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:21,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-03 13:40:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-03-03 13:40:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2025-03-03 13:40:21,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 28 [2025-03-03 13:40:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:21,786 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2025-03-03 13:40:21,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2025-03-03 13:40:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 13:40:21,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:21,787 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:21,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 13:40:21,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:21,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:21,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1877715761, now seen corresponding path program 4 times [2025-03-03 13:40:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254747075] [2025-03-03 13:40:21,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:21,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-03 13:40:22,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:40:22,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:23,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254747075] [2025-03-03 13:40:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254747075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351612904] [2025-03-03 13:40:23,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:23,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:23,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:40:23,883 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-03 13:40:23,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:40:23,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:23,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:23,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-03 13:40:23,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:24,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:26,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351612904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:26,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:26,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2025-03-03 13:40:26,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374232412] [2025-03-03 13:40:26,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:26,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-03-03 13:40:26,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:26,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-03-03 13:40:26,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 13:40:26,645 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 92 states, 92 states have (on average 1.076086956521739) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:26,854 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2025-03-03 13:40:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-03-03 13:40:26,855 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.076086956521739) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-03 13:40:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:26,856 INFO L225 Difference]: With dead ends: 194 [2025-03-03 13:40:26,856 INFO L226 Difference]: Without dead ends: 144 [2025-03-03 13:40:26,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 13:40:26,858 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 448 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:26,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 80 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-03 13:40:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2025-03-03 13:40:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 145 transitions. [2025-03-03 13:40:26,867 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 145 transitions. Word has length 51 [2025-03-03 13:40:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:26,867 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 145 transitions. [2025-03-03 13:40:26,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 1.076086956521739) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 145 transitions. [2025-03-03 13:40:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 13:40:26,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:26,868 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:26,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 13:40:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 13:40:27,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:27,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1921238406, now seen corresponding path program 5 times [2025-03-03 13:40:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124839237] [2025-03-03 13:40:27,069 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:27,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 24 equivalence classes. [2025-03-03 13:40:27,340 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 13:40:27,341 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-03 13:40:27,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:29,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124839237] [2025-03-03 13:40:29,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124839237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:29,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778438873] [2025-03-03 13:40:29,211 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:29,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:29,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:29,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:40:29,239 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 24 equivalence classes. [2025-03-03 13:40:32,680 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 13:40:32,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-03 13:40:32,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:32,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-03 13:40:32,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:32,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778438873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:36,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-03 13:40:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828652129] [2025-03-03 13:40:36,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:36,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-03 13:40:36,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:36,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-03 13:40:36,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4426, Invalid=4886, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 13:40:36,699 INFO L87 Difference]: Start difference. First operand 101 states and 145 transitions. Second operand has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:40,041 INFO L93 Difference]: Finished difference Result 159 states and 209 transitions. [2025-03-03 13:40:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-03 13:40:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 13:40:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:40,042 INFO L225 Difference]: With dead ends: 159 [2025-03-03 13:40:40,042 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 13:40:40,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7521 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13350, Invalid=22182, Unknown=0, NotChecked=0, Total=35532 [2025-03-03 13:40:40,049 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 155 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:40,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 86 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 13:40:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-03 13:40:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 104 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2025-03-03 13:40:40,057 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 52 [2025-03-03 13:40:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:40,060 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2025-03-03 13:40:40,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2025-03-03 13:40:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 13:40:40,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:40,061 INFO L218 NwaCegarLoop]: trace histogram [92, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:40,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 13:40:40,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 13:40:40,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:40,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -362144463, now seen corresponding path program 5 times [2025-03-03 13:40:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:40,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314997420] [2025-03-03 13:40:40,262 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:40,269 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 47 equivalence classes. [2025-03-03 13:40:41,508 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 13:40:41,508 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-03 13:40:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:48,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314997420] [2025-03-03 13:40:48,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314997420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:48,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389893755] [2025-03-03 13:40:48,016 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:48,017 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:48,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:40:48,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 47 equivalence classes. [2025-03-03 13:40:56,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 13:40:56,953 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-03 13:40:56,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:56,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 187 conjuncts are in the unsatisfiable core [2025-03-03 13:40:56,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:40:57,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389893755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:06,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 188 [2025-03-03 13:41:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402982109] [2025-03-03 13:41:06,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 188 states [2025-03-03 13:41:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:06,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2025-03-03 13:41:06,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2025-03-03 13:41:06,906 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 188 states, 188 states have (on average 1.0372340425531914) internal successors, (195), 188 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:08,025 INFO L93 Difference]: Finished difference Result 386 states and 571 transitions. [2025-03-03 13:41:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2025-03-03 13:41:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 188 states, 188 states have (on average 1.0372340425531914) internal successors, (195), 188 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 13:41:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:08,027 INFO L225 Difference]: With dead ends: 386 [2025-03-03 13:41:08,027 INFO L226 Difference]: Without dead ends: 288 [2025-03-03 13:41:08,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2025-03-03 13:41:08,029 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 808 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:08,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 117 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:41:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-03 13:41:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 197. [2025-03-03 13:41:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 195 states have (on average 1.4820512820512821) internal successors, (289), 196 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2025-03-03 13:41:08,041 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 99 [2025-03-03 13:41:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:08,041 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2025-03-03 13:41:08,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 188 states, 188 states have (on average 1.0372340425531914) internal successors, (195), 188 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2025-03-03 13:41:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 13:41:08,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:08,042 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:08,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 13:41:08,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:08,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1657538682, now seen corresponding path program 6 times [2025-03-03 13:41:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763460010] [2025-03-03 13:41:08,244 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:41:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:08,251 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 100 statements into 48 equivalence classes. [2025-03-03 13:41:08,780 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 13:41:08,780 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-03 13:41:08,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763460010] [2025-03-03 13:41:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763460010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406265269] [2025-03-03 13:41:14,973 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:41:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:14,975 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:14,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:41:15,011 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 100 statements into 48 equivalence classes. [2025-03-03 13:41:18,630 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 13:41:18,630 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-03 13:41:18,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:18,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 191 conjuncts are in the unsatisfiable core [2025-03-03 13:41:18,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:18,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:41:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406265269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:28,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2025-03-03 13:41:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296941136] [2025-03-03 13:41:28,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:28,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-03 13:41:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:28,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-03 13:41:29,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18058, Invalid=18998, Unknown=0, NotChecked=0, Total=37056 [2025-03-03 13:41:29,001 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand has 193 states, 193 states have (on average 1.0362694300518134) internal successors, (200), 193 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:39,981 INFO L93 Difference]: Finished difference Result 303 states and 401 transitions. [2025-03-03 13:41:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2025-03-03 13:41:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 1.0362694300518134) internal successors, (200), 193 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 13:41:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:39,983 INFO L225 Difference]: With dead ends: 303 [2025-03-03 13:41:39,983 INFO L226 Difference]: Without dead ends: 203 [2025-03-03 13:41:39,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31161 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=54342, Invalid=90438, Unknown=0, NotChecked=0, Total=144780 [2025-03-03 13:41:39,994 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 342 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:39,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 137 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:41:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-03 13:41:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2025-03-03 13:41:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 199 states have (on average 1.020100502512563) internal successors, (203), 200 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2025-03-03 13:41:40,010 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 100 [2025-03-03 13:41:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:40,010 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2025-03-03 13:41:40,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 1.0362694300518134) internal successors, (200), 193 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:41:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2025-03-03 13:41:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 13:41:40,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:40,012 INFO L218 NwaCegarLoop]: trace histogram [188, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:41:40,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:40,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 13:41:40,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 522387761, now seen corresponding path program 6 times [2025-03-03 13:41:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827107484] [2025-03-03 13:41:40,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:41:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:40,224 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 195 statements into 95 equivalence classes. [2025-03-03 13:41:42,676 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 13:41:42,676 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-03 13:41:42,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat