./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-lit/bh2017-ex3.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-ex3.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 c7d1096b48b9fa88e7c1fc40d10133b79cdfe3c24f6abcdb2b256843ad5beba6 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:58:06,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:58:06,717 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:06,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:58:06,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:58:06,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:58:06,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:58:06,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:58:06,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:58:06,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:58:06,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:58:06,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:58:06,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:58:06,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:06,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:06,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:06,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:58:06,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:58:06,740 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 -> c7d1096b48b9fa88e7c1fc40d10133b79cdfe3c24f6abcdb2b256843ad5beba6 [2025-04-29 10:58:06,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:58:06,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:58:06,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:58:06,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:58:06,976 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:58:06,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bh2017-ex3.c [2025-04-29 10:58:08,312 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d320605bf/5ffda85092ac4375aea5a608e4e686d9/FLAG02f151402 [2025-04-29 10:58:08,521 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:58:08,521 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.c [2025-04-29 10:58:08,522 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:08,526 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d320605bf/5ffda85092ac4375aea5a608e4e686d9/FLAG02f151402 [2025-04-29 10:58:09,311 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d320605bf/5ffda85092ac4375aea5a608e4e686d9 [2025-04-29 10:58:09,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:58:09,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:58:09,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:09,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:58:09,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:58:09,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:09" (1/1) ... [2025-04-29 10:58:09,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499e4dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:09, skipping insertion in model container [2025-04-29 10:58:09,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:09" (1/1) ... [2025-04-29 10:58:09,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:58:09,450 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-ex3.c[311,324] [2025-04-29 10:58:09,465 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:09,469 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:58:09,487 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-ex3.c[311,324] [2025-04-29 10:58:09,493 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:09,504 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:58:09,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:09 WrapperNode [2025-04-29 10:58:09,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:09,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:09,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:58:09,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:58:09,512 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:09" (1/1) ... [2025-04-29 10:58:09,516 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:09" (1/1) ... [2025-04-29 10:58:09,530 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2025-04-29 10:58:09,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:09,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:58:09,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:58:09,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:58:09,535 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:09" (1/1) ... [2025-04-29 10:58:09,535 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:09" (1/1) ... [2025-04-29 10:58:09,536 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:09" (1/1) ... [2025-04-29 10:58:09,540 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:58:09,541 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:09" (1/1) ... [2025-04-29 10:58:09,541 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:09" (1/1) ... [2025-04-29 10:58:09,542 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:09" (1/1) ... [2025-04-29 10:58:09,545 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:09" (1/1) ... [2025-04-29 10:58:09,547 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:09" (1/1) ... [2025-04-29 10:58:09,547 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:09" (1/1) ... [2025-04-29 10:58:09,548 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:09" (1/1) ... [2025-04-29 10:58:09,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:58:09,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:58:09,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:58:09,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:58:09,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:09" (1/1) ... [2025-04-29 10:58:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:09,577 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:09,580 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:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:58:09,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:58:09,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-29 10:58:09,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-29 10:58:09,630 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:58:09,631 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:58:09,706 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-04-29 10:58:09,706 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:58:09,714 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:58:09,714 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:58:09,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:09 BoogieIcfgContainer [2025-04-29 10:58:09,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:58:09,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:58:09,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:58:09,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:58:09,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:58:09" (1/3) ... [2025-04-29 10:58:09,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e07082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:09, skipping insertion in model container [2025-04-29 10:58:09,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:09" (2/3) ... [2025-04-29 10:58:09,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e07082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:09, skipping insertion in model container [2025-04-29 10:58:09,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:09" (3/3) ... [2025-04-29 10:58:09,722 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.c [2025-04-29 10:58:09,731 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:58:09,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex3.c that has 2 procedures, 23 locations, 36 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-29 10:58:09,778 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:58:09,787 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;@7db65c62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:58:09,788 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:58:09,791 INFO L278 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:58:09,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 10:58:09,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:09,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 10:58:09,795 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:09,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash 891125370, now seen corresponding path program 1 times [2025-04-29 10:58:09,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:09,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197161030] [2025-04-29 10:58:09,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:09,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 10:58:09,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 10:58:09,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:09,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:09,981 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:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:09,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197161030] [2025-04-29 10:58:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197161030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:09,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:58:09,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796267752] [2025-04-29 10:58:09,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:09,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:58:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:10,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:58:10,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:58:10,004 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:10,076 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2025-04-29 10:58:10,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:58:10,078 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 6 [2025-04-29 10:58:10,078 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:10,082 INFO L225 Difference]: With dead ends: 45 [2025-04-29 10:58:10,083 INFO L226 Difference]: Without dead ends: 24 [2025-04-29 10:58:10,085 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:10,086 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:10,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-29 10:58:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-29 10:58:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:58:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-04-29 10:58:10,117 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 6 [2025-04-29 10:58:10,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:10,118 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-04-29 10:58:10,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:10,119 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-04-29 10:58:10,119 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 10:58:10,119 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:10,119 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:10,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:58:10,119 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:10,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1546864854, now seen corresponding path program 1 times [2025-04-29 10:58:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:10,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350705089] [2025-04-29 10:58:10,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:10,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 10:58:10,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 10:58:10,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:10,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:10,202 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:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:10,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350705089] [2025-04-29 10:58:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350705089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:10,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:58:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883183639] [2025-04-29 10:58:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:10,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:58:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:10,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:58:10,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:58:10,204 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:10,249 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-04-29 10:58:10,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:58:10,249 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2025-04-29 10:58:10,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:10,250 INFO L225 Difference]: With dead ends: 30 [2025-04-29 10:58:10,250 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:58:10,250 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:10,251 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:10,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:58:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 10:58:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:58:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-04-29 10:58:10,258 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2025-04-29 10:58:10,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:10,258 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-04-29 10:58:10,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:10,258 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-04-29 10:58:10,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 10:58:10,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:10,259 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:10,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:58:10,259 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:10,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1792705264, now seen corresponding path program 1 times [2025-04-29 10:58:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:10,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992157350] [2025-04-29 10:58:10,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:10,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:58:10,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:58:10,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:10,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:10,303 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:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:10,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992157350] [2025-04-29 10:58:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992157350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:10,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285379350] [2025-04-29 10:58:10,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:10,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:10,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:10,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:10,305 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:10,318 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2025-04-29 10:58:10,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:10,319 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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 20 [2025-04-29 10:58:10,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:10,319 INFO L225 Difference]: With dead ends: 64 [2025-04-29 10:58:10,319 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 10:58:10,320 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:10,320 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:10,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 10:58:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-29 10:58:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-29 10:58:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-04-29 10:58:10,327 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 20 [2025-04-29 10:58:10,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:10,327 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-04-29 10:58:10,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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:10,328 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-04-29 10:58:10,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 10:58:10,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:10,328 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:10,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:58:10,328 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:10,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 714202690, now seen corresponding path program 1 times [2025-04-29 10:58:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:10,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023274070] [2025-04-29 10:58:10,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:10,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:58:10,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:58:10,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:10,388 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:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:10,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023274070] [2025-04-29 10:58:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023274070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762661897] [2025-04-29 10:58:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:10,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:10,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:10,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:10,390 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:10,408 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. [2025-04-29 10:58:10,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:10,409 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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 20 [2025-04-29 10:58:10,409 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:10,410 INFO L225 Difference]: With dead ends: 92 [2025-04-29 10:58:10,411 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 10:58:10,411 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:10,412 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:10,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 10:58:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 10:58:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 10:58:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-04-29 10:58:10,427 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 20 [2025-04-29 10:58:10,428 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:10,428 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-04-29 10:58:10,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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:10,428 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-04-29 10:58:10,429 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:58:10,429 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:10,429 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:10,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:58:10,429 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:10,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2698474, now seen corresponding path program 1 times [2025-04-29 10:58:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:10,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977747753] [2025-04-29 10:58:10,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:10,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:58:10,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:58:10,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:10,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 10:58:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:10,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977747753] [2025-04-29 10:58:10,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977747753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:10,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104088908] [2025-04-29 10:58:10,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:10,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:10,530 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-04-29 10:58:10,532 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-04-29 10:58:10,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:58:10,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:58:10,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:10,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:10,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:58:10,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 10:58:10,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 10:58:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104088908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:10,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-29 10:58:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791960101] [2025-04-29 10:58:10,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:10,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:10,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:10,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:10,682 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-04-29 10:58:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:10,756 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2025-04-29 10:58:10,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:10,757 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2025-04-29 10:58:10,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:10,758 INFO L225 Difference]: With dead ends: 164 [2025-04-29 10:58:10,758 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 10:58:10,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:10,759 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 56 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:10,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 81 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:58:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 10:58:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-04-29 10:58:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.481012658227848) internal successors, (117), 79 states have internal predecessors, (117), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-04-29 10:58:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2025-04-29 10:58:10,769 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 34 [2025-04-29 10:58:10,769 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:10,770 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2025-04-29 10:58:10,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-04-29 10:58:10,770 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2025-04-29 10:58:10,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:58:10,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:10,770 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:10,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:10,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:10,971 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:10,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2000860172, now seen corresponding path program 1 times [2025-04-29 10:58:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:10,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378912101] [2025-04-29 10:58:10,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:10,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:58:10,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:58:10,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:10,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 10:58:11,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:11,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378912101] [2025-04-29 10:58:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378912101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:11,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195431239] [2025-04-29 10:58:11,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:11,042 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-04-29 10:58:11,043 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-04-29 10:58:11,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:58:11,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:58:11,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:11,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:11,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:58:11,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 10:58:11,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 10:58:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195431239] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:11,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-29 10:58:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268052436] [2025-04-29 10:58:11,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:11,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:11,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:11,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:11,155 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-04-29 10:58:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:11,210 INFO L93 Difference]: Finished difference Result 344 states and 562 transitions. [2025-04-29 10:58:11,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:11,210 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2025-04-29 10:58:11,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:11,212 INFO L225 Difference]: With dead ends: 344 [2025-04-29 10:58:11,212 INFO L226 Difference]: Without dead ends: 236 [2025-04-29 10:58:11,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:11,213 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:11,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 103 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-29 10:58:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-04-29 10:58:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-04-29 10:58:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 378 transitions. [2025-04-29 10:58:11,240 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 378 transitions. Word has length 34 [2025-04-29 10:58:11,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:11,241 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 378 transitions. [2025-04-29 10:58:11,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-04-29 10:58:11,241 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 378 transitions. [2025-04-29 10:58:11,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-29 10:58:11,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:11,243 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:11,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:11,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 10:58:11,445 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:11,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1004018552, now seen corresponding path program 2 times [2025-04-29 10:58:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:11,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945946563] [2025-04-29 10:58:11,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:11,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-04-29 10:58:11,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 10:58:11,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:11,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-04-29 10:58:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:11,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945946563] [2025-04-29 10:58:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945946563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:11,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:11,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:58:11,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394448210] [2025-04-29 10:58:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:11,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:11,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:11,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:11,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:11,600 INFO L87 Difference]: Start difference. First operand 236 states and 378 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:58:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:11,645 INFO L93 Difference]: Finished difference Result 242 states and 383 transitions. [2025-04-29 10:58:11,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:11,646 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2025-04-29 10:58:11,646 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:11,648 INFO L225 Difference]: With dead ends: 242 [2025-04-29 10:58:11,648 INFO L226 Difference]: Without dead ends: 240 [2025-04-29 10:58:11,648 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:11,649 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:11,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 87 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-04-29 10:58:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-04-29 10:58:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 175 states have (on average 1.4914285714285713) internal successors, (261), 175 states have internal predecessors, (261), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-04-29 10:58:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 381 transitions. [2025-04-29 10:58:11,675 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 381 transitions. Word has length 76 [2025-04-29 10:58:11,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:11,675 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 381 transitions. [2025-04-29 10:58:11,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:58:11,679 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 381 transitions. [2025-04-29 10:58:11,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-29 10:58:11,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:11,681 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:11,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:58:11,681 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:11,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2066858902, now seen corresponding path program 2 times [2025-04-29 10:58:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:11,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671756190] [2025-04-29 10:58:11,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:11,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-04-29 10:58:11,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 10:58:11,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:11,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-04-29 10:58:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:11,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671756190] [2025-04-29 10:58:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671756190] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:11,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634283851] [2025-04-29 10:58:11,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:11,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:11,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:11,839 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-04-29 10:58:11,840 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-04-29 10:58:11,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-04-29 10:58:11,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 10:58:11,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:11,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:58:11,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-04-29 10:58:11,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-04-29 10:58:12,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634283851] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:12,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:12,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-29 10:58:12,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489391297] [2025-04-29 10:58:12,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 10:58:12,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 10:58:12,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:58:12,134 INFO L87 Difference]: Start difference. First operand 240 states and 381 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-04-29 10:58:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:12,310 INFO L93 Difference]: Finished difference Result 728 states and 1203 transitions. [2025-04-29 10:58:12,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 10:58:12,311 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 76 [2025-04-29 10:58:12,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:12,311 INFO L225 Difference]: With dead ends: 728 [2025-04-29 10:58:12,312 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 10:58:12,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-04-29 10:58:12,317 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 155 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:12,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 191 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:58:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 10:58:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 10:58:12,317 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:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 10:58:12,318 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2025-04-29 10:58:12,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:12,318 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 10:58:12,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-04-29 10:58:12,318 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 10:58:12,319 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 10:58:12,320 INFO L790 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:58:12,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:58:12,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:12,524 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-04-29 10:58:12,525 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 10:58:13,131 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:58:13,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:58:13 BoogieIcfgContainer [2025-04-29 10:58:13,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:58:13,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:58:13,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:58:13,143 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:58:13,143 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:09" (3/4) ... [2025-04-29 10:58:13,145 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:58:13,149 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-04-29 10:58:13,151 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-04-29 10:58:13,151 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 10:58:13,151 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:58:13,204 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:58:13,204 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:58:13,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:58:13,205 INFO L158 Benchmark]: Toolchain (without parser) took 3890.74ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 65.3MB in the end (delta: 47.4MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,205 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:13,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.72ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.72ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:13,206 INFO L158 Benchmark]: Boogie Preprocessor took 19.17ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.6MB in the end (delta: 891.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:13,206 INFO L158 Benchmark]: RCFGBuilder took 164.77ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 85.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,206 INFO L158 Benchmark]: TraceAbstraction took 3425.83ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 71.0MB in the end (delta: 14.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,206 INFO L158 Benchmark]: Witness Printer took 61.56ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 65.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:13,207 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.22ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.72ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.72ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.17ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.6MB in the end (delta: 891.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 164.77ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 85.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3425.83ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 71.0MB in the end (delta: 14.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. * Witness Printer took 61.56ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 65.3MB in the end (delta: 5.7MB). 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, 23 locations, 36 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 717 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 517 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 200 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=7, InterpolantAutomatonStates: 51, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 269 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1126/1286 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: 13]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) RESULT: Ultimate proved your program to be correct! [2025-04-29 10:58:13,218 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