./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e33cc370136ebab299b4000c55c7977ad293f755b9b4546b900973984c423ef5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:58:04,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:58:04,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:58:04,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:58:04,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:58:04,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:58:04,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:58:04,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:58:04,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:58:04,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:58:04,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:58:04,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:58:04,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:58:04,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:58:04,472 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:58:04,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:58:04,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:04,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:04,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:04,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:58:04,474 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e33cc370136ebab299b4000c55c7977ad293f755b9b4546b900973984c423ef5 [2025-04-29 10:58:04,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:58:04,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:58:04,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:58:04,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:58:04,713 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:58:04,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c [2025-04-29 10:58:05,959 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58674a044/eb034f54b61342a59a5cf981a385cb66/FLAGd1214f6b6 [2025-04-29 10:58:06,149 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:58:06,150 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c [2025-04-29 10:58:06,151 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:06,155 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58674a044/eb034f54b61342a59a5cf981a385cb66/FLAGd1214f6b6 [2025-04-29 10:58:08,061 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58674a044/eb034f54b61342a59a5cf981a385cb66 [2025-04-29 10:58:08,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:58:08,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:58:08,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:08,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:58:08,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:58:08,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5836c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08, skipping insertion in model container [2025-04-29 10:58:08,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:58:08,200 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c[323,336] [2025-04-29 10:58:08,214 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:08,218 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:58:08,232 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex1-poly.c[323,336] [2025-04-29 10:58:08,236 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:08,245 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:58:08,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08 WrapperNode [2025-04-29 10:58:08,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:08,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:08,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:58:08,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:58:08,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,264 INFO L138 Inliner]: procedures = 6, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-04-29 10:58:08,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:08,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:58:08,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:58:08,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:58:08,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,276 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:58:08,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:58:08,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:58:08,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:58:08,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:58:08,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (1/1) ... [2025-04-29 10:58:08,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:08,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:08,306 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-04-29 10:58:08,308 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-04-29 10:58:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:58:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:58:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-29 10:58:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-29 10:58:08,356 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:58:08,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:58:08,427 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-04-29 10:58:08,427 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:58:08,433 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:58:08,433 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:58:08,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:08 BoogieIcfgContainer [2025-04-29 10:58:08,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:58:08,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:58:08,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:58:08,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:58:08,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:58:08" (1/3) ... [2025-04-29 10:58:08,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5177f5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:08, skipping insertion in model container [2025-04-29 10:58:08,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:08" (2/3) ... [2025-04-29 10:58:08,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5177f5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:08, skipping insertion in model container [2025-04-29 10:58:08,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:08" (3/3) ... [2025-04-29 10:58:08,439 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.c [2025-04-29 10:58:08,448 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:58:08,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex1-poly.c that has 2 procedures, 22 locations, 39 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:58:08,491 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:58:08,500 INFO L340 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;@57b00329, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:58:08,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:58:08,503 INFO L278 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:08,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 10:58:08,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:08,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:08,508 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:08,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 155501436, now seen corresponding path program 1 times [2025-04-29 10:58:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:08,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914078084] [2025-04-29 10:58:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 10:58:08,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 10:58:08,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:08,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914078084] [2025-04-29 10:58:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914078084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:08,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098415868] [2025-04-29 10:58:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:08,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:08,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:08,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:08,643 INFO L87 Difference]: Start difference. First operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:08,674 INFO L93 Difference]: Finished difference Result 43 states and 70 transitions. [2025-04-29 10:58:08,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:08,676 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 10:58:08,676 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:08,680 INFO L225 Difference]: With dead ends: 43 [2025-04-29 10:58:08,681 INFO L226 Difference]: Without dead ends: 20 [2025-04-29 10:58:08,684 INFO L436 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-04-29 10:58:08,686 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 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-04-29 10:58:08,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-04-29 10:58:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-04-29 10:58:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-04-29 10:58:08,718 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 8 [2025-04-29 10:58:08,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:08,718 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-04-29 10:58:08,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:08,719 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2025-04-29 10:58:08,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 10:58:08,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:08,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:08,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:58:08,720 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:08,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash 149721982, now seen corresponding path program 1 times [2025-04-29 10:58:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:08,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460941013] [2025-04-29 10:58:08,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:08,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 10:58:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 10:58:08,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:08,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:08,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460941013] [2025-04-29 10:58:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460941013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:08,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:08,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748925756] [2025-04-29 10:58:08,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:08,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:08,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:08,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:08,812 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:08,897 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2025-04-29 10:58:08,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:08,898 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 10:58:08,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:08,898 INFO L225 Difference]: With dead ends: 26 [2025-04-29 10:58:08,898 INFO L226 Difference]: Without dead ends: 24 [2025-04-29 10:58:08,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:58:08,899 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:08,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:58:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-29 10:58:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-29 10:58:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-04-29 10:58:08,910 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8 [2025-04-29 10:58:08,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:08,910 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-04-29 10:58:08,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:08,910 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-04-29 10:58:08,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 10:58:08,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:08,911 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:08,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:58:08,911 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:08,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1832483646, now seen corresponding path program 1 times [2025-04-29 10:58:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:08,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906895017] [2025-04-29 10:58:08,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:08,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 10:58:08,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 10:58:08,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:08,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:08,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906895017] [2025-04-29 10:58:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906895017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:08,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:08,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435407849] [2025-04-29 10:58:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:08,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:08,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:08,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:08,995 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:58:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:09,065 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-04-29 10:58:09,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:09,065 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-04-29 10:58:09,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:09,066 INFO L225 Difference]: With dead ends: 30 [2025-04-29 10:58:09,066 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:58:09,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:58:09,067 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:09,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:58:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 10:58:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 10:58:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-04-29 10:58:09,074 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2025-04-29 10:58:09,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:09,074 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-04-29 10:58:09,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:58:09,074 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-04-29 10:58:09,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 10:58:09,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:09,075 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:09,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:58:09,075 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:09,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1336181566, now seen corresponding path program 1 times [2025-04-29 10:58:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:09,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503471233] [2025-04-29 10:58:09,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:09,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:58:09,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:58:09,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:09,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:58:09,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:09,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503471233] [2025-04-29 10:58:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503471233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:09,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907595090] [2025-04-29 10:58:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:09,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:09,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:09,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:09,223 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:58:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:09,333 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2025-04-29 10:58:09,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:58:09,333 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-04-29 10:58:09,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:09,334 INFO L225 Difference]: With dead ends: 46 [2025-04-29 10:58:09,334 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 10:58:09,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:58:09,334 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:09,335 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:58:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 10:58:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-04-29 10:58:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-04-29 10:58:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-04-29 10:58:09,351 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2025-04-29 10:58:09,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:09,351 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-04-29 10:58:09,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:58:09,352 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2025-04-29 10:58:09,353 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:58:09,353 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:09,353 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:09,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:58:09,353 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:09,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -553938178, now seen corresponding path program 1 times [2025-04-29 10:58:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:09,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110994667] [2025-04-29 10:58:09,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:09,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:58:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:58:09,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:09,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:58:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:09,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110994667] [2025-04-29 10:58:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110994667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345328173] [2025-04-29 10:58:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:09,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:09,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:09,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:09,455 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:58:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:09,512 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-04-29 10:58:09,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:09,513 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-04-29 10:58:09,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:09,515 INFO L225 Difference]: With dead ends: 89 [2025-04-29 10:58:09,515 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 10:58:09,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:58:09,516 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:09,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 10:58:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 10:58:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-04-29 10:58:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2025-04-29 10:58:09,525 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 23 [2025-04-29 10:58:09,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:09,525 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2025-04-29 10:58:09,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:58:09,526 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2025-04-29 10:58:09,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 10:58:09,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:09,526 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:09,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:58:09,527 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:09,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1842573482, now seen corresponding path program 1 times [2025-04-29 10:58:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:09,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175121693] [2025-04-29 10:58:09,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:09,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 10:58:09,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 10:58:09,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:09,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-04-29 10:58:09,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:09,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175121693] [2025-04-29 10:58:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175121693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:58:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498972798] [2025-04-29 10:58:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:09,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:58:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:58:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:58:09,622 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-04-29 10:58:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:09,673 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-04-29 10:58:09,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:58:09,674 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2025-04-29 10:58:09,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:09,675 INFO L225 Difference]: With dead ends: 62 [2025-04-29 10:58:09,676 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 10:58:09,676 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:09,677 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:09,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 10:58:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-29 10:58:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-04-29 10:58:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-04-29 10:58:09,695 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 44 [2025-04-29 10:58:09,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:09,695 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-04-29 10:58:09,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-04-29 10:58:09,695 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2025-04-29 10:58:09,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-04-29 10:58:09,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:09,697 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:09,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:58:09,697 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:09,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash -489439653, now seen corresponding path program 1 times [2025-04-29 10:58:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:09,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636033932] [2025-04-29 10:58:09,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:09,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-29 10:58:09,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-29 10:58:09,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:09,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-04-29 10:58:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:09,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636033932] [2025-04-29 10:58:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636033932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:09,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340141565] [2025-04-29 10:58:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:09,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:09,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:09,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:09,859 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-29 10:58:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:09,914 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2025-04-29 10:58:09,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:09,914 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-04-29 10:58:09,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:09,915 INFO L225 Difference]: With dead ends: 60 [2025-04-29 10:58:09,915 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 10:58:09,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:58:09,919 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:09,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 64 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 10:58:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 10:58:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-29 10:58:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 10:58:09,920 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2025-04-29 10:58:09,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:09,920 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 10:58:09,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-04-29 10:58:09,920 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 10:58:09,920 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 10:58:09,922 INFO L790 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:58:09,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:58:09,925 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:09,926 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 10:58:10,154 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:58:10,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:58:10 BoogieIcfgContainer [2025-04-29 10:58:10,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:58:10,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:58:10,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:58:10,171 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:58:10,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:08" (3/4) ... [2025-04-29 10:58:10,173 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:58:10,176 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-04-29 10:58:10,178 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-04-29 10:58:10,179 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 10:58:10,179 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:58:10,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:58:10,234 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:58:10,234 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:58:10,235 INFO L158 Benchmark]: Toolchain (without parser) took 2171.67ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 55.7MB in the end (delta: 55.9MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2025-04-29 10:58:10,236 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:10,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.36ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:58:10,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.03ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:10,236 INFO L158 Benchmark]: Boogie Preprocessor took 17.83ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:10,237 INFO L158 Benchmark]: RCFGBuilder took 149.48ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 85.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:10,237 INFO L158 Benchmark]: TraceAbstraction took 1735.74ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 61.0MB in the end (delta: 23.6MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:10,237 INFO L158 Benchmark]: Witness Printer took 63.65ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 55.7MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:10,238 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.36ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.03ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.83ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 149.48ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 85.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1735.74ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 61.0MB in the end (delta: 23.6MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 63.65ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 55.7MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 39 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 533 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 163 mSDtfsCounter, 242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 540/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((j <= 4) && (j <= ((long long) 2 * i))) && (((long long) 2 * i) <= ((long long) 6 + j))) && (2 <= j)) || (((i <= 3) && (0 <= i)) && (j == 0))) RESULT: Ultimate proved your program to be correct! [2025-04-29 10:58:10,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE