./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label17.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 7125651fe28e5ed3820e1570dabb559d66d570950097f9760267ff4877c30610 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:07:20,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:07:20,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:07:20,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:07:20,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:07:20,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:07:20,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:07:20,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:07:20,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:07:20,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:07:20,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:07:20,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:07:20,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:07:20,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:07:20,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:07:20,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:07:20,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:20,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:07:20,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:07:20,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:07:20,573 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 -> 7125651fe28e5ed3820e1570dabb559d66d570950097f9760267ff4877c30610 [2025-03-16 14:07:20,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:07:20,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:07:20,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:07:20,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:07:20,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:07:20,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label17.c [2025-03-16 14:07:21,961 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5566936eb/0568ef563be24f6fa20b1d5cf948a963/FLAG8e3f732ba [2025-03-16 14:07:22,250 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:07:22,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label17.c [2025-03-16 14:07:22,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5566936eb/0568ef563be24f6fa20b1d5cf948a963/FLAG8e3f732ba [2025-03-16 14:07:22,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5566936eb/0568ef563be24f6fa20b1d5cf948a963 [2025-03-16 14:07:22,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:07:22,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:07:22,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:22,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:07:22,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:07:22,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33be0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22, skipping insertion in model container [2025-03-16 14:07:22,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:07:22,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label17.c[19973,19986] [2025-03-16 14:07:22,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:22,568 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:07:22,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label17.c[19973,19986] [2025-03-16 14:07:22,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:22,669 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:07:22,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22 WrapperNode [2025-03-16 14:07:22,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:22,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:22,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:07:22,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:07:22,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,721 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-16 14:07:22,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:22,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:07:22,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:07:22,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:07:22,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,747 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:07:22,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:07:22,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:07:22,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:07:22,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:07:22,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (1/1) ... [2025-03-16 14:07:22,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:22,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:07:22,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:07:22,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:07:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:07:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:07:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:07:22,879 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:07:22,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:07:23,525 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 14:07:23,525 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:07:23,537 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:07:23,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:07:23,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:23 BoogieIcfgContainer [2025-03-16 14:07:23,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:07:23,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:07:23,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:07:23,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:07:23,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:07:22" (1/3) ... [2025-03-16 14:07:23,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183ee25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:23, skipping insertion in model container [2025-03-16 14:07:23,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:22" (2/3) ... [2025-03-16 14:07:23,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183ee25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:23, skipping insertion in model container [2025-03-16 14:07:23,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:23" (3/3) ... [2025-03-16 14:07:23,547 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label17.c [2025-03-16 14:07:23,557 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:07:23,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label17.c that has 1 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:07:23,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:07:23,607 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dc91150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:07:23,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:07:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 14:07:23,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:23,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:23,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash -765882851, now seen corresponding path program 1 times [2025-03-16 14:07:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:23,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429798066] [2025-03-16 14:07:23,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:23,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 14:07:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 14:07:23,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:23,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429798066] [2025-03-16 14:07:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429798066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:23,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:23,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403145450] [2025-03-16 14:07:23,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:23,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:07:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:23,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:07:23,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:07:23,957 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:23,980 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2025-03-16 14:07:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:07:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-16 14:07:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:23,990 INFO L225 Difference]: With dead ends: 273 [2025-03-16 14:07:23,990 INFO L226 Difference]: Without dead ends: 134 [2025-03-16 14:07:23,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:07:23,996 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:23,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:07:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-16 14:07:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-16 14:07:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2025-03-16 14:07:24,024 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 115 [2025-03-16 14:07:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:24,025 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2025-03-16 14:07:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2025-03-16 14:07:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 14:07:24,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:24,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:24,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:07:24,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2019961053, now seen corresponding path program 1 times [2025-03-16 14:07:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:24,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395227406] [2025-03-16 14:07:24,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:24,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 14:07:24,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 14:07:24,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:24,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395227406] [2025-03-16 14:07:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395227406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203968119] [2025-03-16 14:07:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:24,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:24,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:24,285 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:24,688 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2025-03-16 14:07:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:24,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-16 14:07:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:24,690 INFO L225 Difference]: With dead ends: 398 [2025-03-16 14:07:24,691 INFO L226 Difference]: Without dead ends: 265 [2025-03-16 14:07:24,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:24,691 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:24,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 24 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-16 14:07:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-16 14:07:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4583333333333333) internal successors, (385), 264 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 385 transitions. [2025-03-16 14:07:24,702 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 385 transitions. Word has length 115 [2025-03-16 14:07:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:24,702 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 385 transitions. [2025-03-16 14:07:24,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 385 transitions. [2025-03-16 14:07:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 14:07:24,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:24,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:24,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:07:24,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1996725303, now seen corresponding path program 1 times [2025-03-16 14:07:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934768735] [2025-03-16 14:07:24,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:24,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 14:07:24,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 14:07:24,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:24,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934768735] [2025-03-16 14:07:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934768735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:24,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728452000] [2025-03-16 14:07:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:24,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:24,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:24,824 INFO L87 Difference]: Start difference. First operand 265 states and 385 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:25,187 INFO L93 Difference]: Finished difference Result 791 states and 1152 transitions. [2025-03-16 14:07:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-16 14:07:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:25,190 INFO L225 Difference]: With dead ends: 791 [2025-03-16 14:07:25,190 INFO L226 Difference]: Without dead ends: 527 [2025-03-16 14:07:25,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:25,191 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:25,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 37 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-16 14:07:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-03-16 14:07:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3783269961977187) internal successors, (725), 526 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 725 transitions. [2025-03-16 14:07:25,211 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 725 transitions. Word has length 121 [2025-03-16 14:07:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:25,211 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 725 transitions. [2025-03-16 14:07:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 725 transitions. [2025-03-16 14:07:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 14:07:25,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:25,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:25,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:07:25,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:25,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2092800129, now seen corresponding path program 1 times [2025-03-16 14:07:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487203501] [2025-03-16 14:07:25,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:25,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 14:07:25,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 14:07:25,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:25,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487203501] [2025-03-16 14:07:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487203501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42422209] [2025-03-16 14:07:25,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:25,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:25,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:25,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:25,353 INFO L87 Difference]: Start difference. First operand 527 states and 725 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:25,656 INFO L93 Difference]: Finished difference Result 1577 states and 2172 transitions. [2025-03-16 14:07:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:25,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-16 14:07:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:25,659 INFO L225 Difference]: With dead ends: 1577 [2025-03-16 14:07:25,661 INFO L226 Difference]: Without dead ends: 1051 [2025-03-16 14:07:25,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:25,664 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:25,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 36 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-16 14:07:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-16 14:07:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.3095238095238095) internal successors, (1375), 1050 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1375 transitions. [2025-03-16 14:07:25,693 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1375 transitions. Word has length 136 [2025-03-16 14:07:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:25,693 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1375 transitions. [2025-03-16 14:07:25,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1375 transitions. [2025-03-16 14:07:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 14:07:25,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:25,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:25,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:07:25,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash 855125067, now seen corresponding path program 1 times [2025-03-16 14:07:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642945592] [2025-03-16 14:07:25,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:25,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:07:25,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:07:25,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:25,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:07:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642945592] [2025-03-16 14:07:25,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642945592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:25,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920550718] [2025-03-16 14:07:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:25,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:25,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:25,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:25,790 INFO L87 Difference]: Start difference. First operand 1051 states and 1375 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:26,145 INFO L93 Difference]: Finished difference Result 2494 states and 3287 transitions. [2025-03-16 14:07:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:26,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-16 14:07:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:26,150 INFO L225 Difference]: With dead ends: 2494 [2025-03-16 14:07:26,150 INFO L226 Difference]: Without dead ends: 1444 [2025-03-16 14:07:26,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:26,153 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:26,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-03-16 14:07:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1051. [2025-03-16 14:07:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.3047619047619048) internal successors, (1370), 1050 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1370 transitions. [2025-03-16 14:07:26,174 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1370 transitions. Word has length 149 [2025-03-16 14:07:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:26,174 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1370 transitions. [2025-03-16 14:07:26,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1370 transitions. [2025-03-16 14:07:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 14:07:26,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:26,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:07:26,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:26,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1796012693, now seen corresponding path program 1 times [2025-03-16 14:07:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605626604] [2025-03-16 14:07:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:26,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 14:07:26,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 14:07:26,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:26,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:07:26,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:26,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605626604] [2025-03-16 14:07:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605626604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:26,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335234388] [2025-03-16 14:07:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:26,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:26,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:26,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:26,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:26,325 INFO L87 Difference]: Start difference. First operand 1051 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:26,623 INFO L93 Difference]: Finished difference Result 2101 states and 2739 transitions. [2025-03-16 14:07:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-03-16 14:07:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:26,627 INFO L225 Difference]: With dead ends: 2101 [2025-03-16 14:07:26,627 INFO L226 Difference]: Without dead ends: 1051 [2025-03-16 14:07:26,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:26,630 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:26,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 61 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-16 14:07:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-16 14:07:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.2933333333333332) internal successors, (1358), 1050 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1358 transitions. [2025-03-16 14:07:26,653 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1358 transitions. Word has length 153 [2025-03-16 14:07:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:26,654 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1358 transitions. [2025-03-16 14:07:26,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1358 transitions. [2025-03-16 14:07:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-16 14:07:26,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:26,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:26,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:07:26,657 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:26,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1915960108, now seen corresponding path program 1 times [2025-03-16 14:07:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336721747] [2025-03-16 14:07:26,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-16 14:07:26,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-16 14:07:26,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:26,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:07:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336721747] [2025-03-16 14:07:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336721747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:26,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:26,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042287889] [2025-03-16 14:07:26,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:26,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:26,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:26,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:26,811 INFO L87 Difference]: Start difference. First operand 1051 states and 1358 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:27,282 INFO L93 Difference]: Finished difference Result 3018 states and 3842 transitions. [2025-03-16 14:07:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-16 14:07:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:27,289 INFO L225 Difference]: With dead ends: 3018 [2025-03-16 14:07:27,289 INFO L226 Difference]: Without dead ends: 1968 [2025-03-16 14:07:27,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:27,291 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 394 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:27,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 39 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-03-16 14:07:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1182. [2025-03-16 14:07:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.2658763759525826) internal successors, (1495), 1181 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1495 transitions. [2025-03-16 14:07:27,312 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1495 transitions. Word has length 157 [2025-03-16 14:07:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:27,312 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1495 transitions. [2025-03-16 14:07:27,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1495 transitions. [2025-03-16 14:07:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 14:07:27,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:27,314 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:07:27,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash 521889144, now seen corresponding path program 1 times [2025-03-16 14:07:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710736615] [2025-03-16 14:07:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:27,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 14:07:27,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 14:07:27,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:27,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 14:07:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:27,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710736615] [2025-03-16 14:07:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710736615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:27,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:27,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720687729] [2025-03-16 14:07:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:27,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:27,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:27,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:27,421 INFO L87 Difference]: Start difference. First operand 1182 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:27,743 INFO L93 Difference]: Finished difference Result 2887 states and 3621 transitions. [2025-03-16 14:07:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-03-16 14:07:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:27,748 INFO L225 Difference]: With dead ends: 2887 [2025-03-16 14:07:27,748 INFO L226 Difference]: Without dead ends: 1706 [2025-03-16 14:07:27,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:27,750 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:27,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 16 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-16 14:07:27,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1444. [2025-03-16 14:07:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.2383922383922383) internal successors, (1787), 1443 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1787 transitions. [2025-03-16 14:07:27,771 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1787 transitions. Word has length 166 [2025-03-16 14:07:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:27,771 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1787 transitions. [2025-03-16 14:07:27,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1787 transitions. [2025-03-16 14:07:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 14:07:27,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:27,774 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:27,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:07:27,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:27,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1803973083, now seen corresponding path program 1 times [2025-03-16 14:07:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193394096] [2025-03-16 14:07:27,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:27,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 14:07:27,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 14:07:27,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:27,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 14:07:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193394096] [2025-03-16 14:07:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193394096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64926752] [2025-03-16 14:07:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:27,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:27,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:27,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:27,934 INFO L87 Difference]: Start difference. First operand 1444 states and 1787 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:28,231 INFO L93 Difference]: Finished difference Result 3149 states and 3883 transitions. [2025-03-16 14:07:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2025-03-16 14:07:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:28,236 INFO L225 Difference]: With dead ends: 3149 [2025-03-16 14:07:28,236 INFO L226 Difference]: Without dead ends: 1706 [2025-03-16 14:07:28,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:28,238 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:28,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 61 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-03-16 14:07:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2025-03-16 14:07:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.2193548387096773) internal successors, (2079), 1705 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2079 transitions. [2025-03-16 14:07:28,261 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2079 transitions. Word has length 182 [2025-03-16 14:07:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:28,262 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2079 transitions. [2025-03-16 14:07:28,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2079 transitions. [2025-03-16 14:07:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 14:07:28,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:28,265 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:28,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:07:28,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1598077480, now seen corresponding path program 1 times [2025-03-16 14:07:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:28,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953314096] [2025-03-16 14:07:28,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 14:07:28,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 14:07:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:28,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 14:07:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:28,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953314096] [2025-03-16 14:07:28,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953314096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:28,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:28,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:07:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964624440] [2025-03-16 14:07:28,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:28,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:28,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:28,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:28,447 INFO L87 Difference]: Start difference. First operand 1706 states and 2079 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:28,949 INFO L93 Difference]: Finished difference Result 4328 states and 5231 transitions. [2025-03-16 14:07:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:28,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-03-16 14:07:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:28,955 INFO L225 Difference]: With dead ends: 4328 [2025-03-16 14:07:28,955 INFO L226 Difference]: Without dead ends: 2492 [2025-03-16 14:07:28,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:28,958 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 240 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:28,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 39 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:07:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-16 14:07:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 1968. [2025-03-16 14:07:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.1931875953228266) internal successors, (2347), 1967 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2347 transitions. [2025-03-16 14:07:28,989 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2347 transitions. Word has length 198 [2025-03-16 14:07:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:28,989 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2347 transitions. [2025-03-16 14:07:28,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2347 transitions. [2025-03-16 14:07:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-16 14:07:28,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:28,993 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:28,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:07:28,993 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:28,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 977821277, now seen corresponding path program 1 times [2025-03-16 14:07:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060704295] [2025-03-16 14:07:28,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:29,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-16 14:07:29,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-16 14:07:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:29,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 14:07:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060704295] [2025-03-16 14:07:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060704295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013024260] [2025-03-16 14:07:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:29,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:29,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:29,162 INFO L87 Difference]: Start difference. First operand 1968 states and 2347 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:29,453 INFO L93 Difference]: Finished difference Result 4328 states and 5133 transitions. [2025-03-16 14:07:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:29,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-03-16 14:07:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:29,460 INFO L225 Difference]: With dead ends: 4328 [2025-03-16 14:07:29,460 INFO L226 Difference]: Without dead ends: 2361 [2025-03-16 14:07:29,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:29,463 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 92 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:29,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 40 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-16 14:07:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2099. [2025-03-16 14:07:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.19256434699714) internal successors, (2502), 2098 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2502 transitions. [2025-03-16 14:07:29,494 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2502 transitions. Word has length 221 [2025-03-16 14:07:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:29,494 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2502 transitions. [2025-03-16 14:07:29,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2502 transitions. [2025-03-16 14:07:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 14:07:29,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:29,498 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:29,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:07:29,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:29,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash 960915160, now seen corresponding path program 1 times [2025-03-16 14:07:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:29,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677730319] [2025-03-16 14:07:29,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:29,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 14:07:29,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 14:07:29,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:29,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-03-16 14:07:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:29,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677730319] [2025-03-16 14:07:29,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677730319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:29,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:29,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405124604] [2025-03-16 14:07:29,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:29,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:29,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:29,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:29,699 INFO L87 Difference]: Start difference. First operand 2099 states and 2502 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:30,139 INFO L93 Difference]: Finished difference Result 4459 states and 5293 transitions. [2025-03-16 14:07:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:30,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-03-16 14:07:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:30,145 INFO L225 Difference]: With dead ends: 4459 [2025-03-16 14:07:30,145 INFO L226 Difference]: Without dead ends: 2361 [2025-03-16 14:07:30,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:30,147 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 358 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:30,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 50 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-16 14:07:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2230. [2025-03-16 14:07:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 1.183490354419022) internal successors, (2638), 2229 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2638 transitions. [2025-03-16 14:07:30,175 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2638 transitions. Word has length 260 [2025-03-16 14:07:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:30,176 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 2638 transitions. [2025-03-16 14:07:30,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2638 transitions. [2025-03-16 14:07:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-16 14:07:30,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:30,180 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:30,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:07:30,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:30,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2053513812, now seen corresponding path program 1 times [2025-03-16 14:07:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113383429] [2025-03-16 14:07:30,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:30,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-16 14:07:30,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-16 14:07:30,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:30,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-16 14:07:30,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:30,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113383429] [2025-03-16 14:07:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113383429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:30,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757623628] [2025-03-16 14:07:30,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:30,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:30,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:30,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:07:30,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:07:30,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-16 14:07:30,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-16 14:07:30,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:30,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:30,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:30,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-16 14:07:30,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757623628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:07:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648787295] [2025-03-16 14:07:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:30,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:30,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:30,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:30,665 INFO L87 Difference]: Start difference. First operand 2230 states and 2638 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:30,961 INFO L93 Difference]: Finished difference Result 4459 states and 5275 transitions. [2025-03-16 14:07:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2025-03-16 14:07:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:30,967 INFO L225 Difference]: With dead ends: 4459 [2025-03-16 14:07:30,967 INFO L226 Difference]: Without dead ends: 2230 [2025-03-16 14:07:30,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:30,969 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:30,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2025-03-16 14:07:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1968. [2025-03-16 14:07:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.1545500762582612) internal successors, (2271), 1967 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2271 transitions. [2025-03-16 14:07:30,994 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2271 transitions. Word has length 286 [2025-03-16 14:07:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:30,994 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2271 transitions. [2025-03-16 14:07:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2271 transitions. [2025-03-16 14:07:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 14:07:30,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:30,998 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:31,006 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-03-16 14:07:31,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 14:07:31,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:31,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1322959122, now seen corresponding path program 1 times [2025-03-16 14:07:31,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:31,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087880177] [2025-03-16 14:07:31,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:31,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:31,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 14:07:31,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 14:07:31,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:31,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 296 proven. 174 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:07:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:31,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087880177] [2025-03-16 14:07:31,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087880177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:31,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717149310] [2025-03-16 14:07:31,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:31,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:31,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:31,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:07:31,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:07:31,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 14:07:31,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 14:07:31,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:31,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:31,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:31,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-16 14:07:31,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:31,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717149310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:31,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:31,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 14:07:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991335506] [2025-03-16 14:07:31,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:31,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:31,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:31,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:31,926 INFO L87 Difference]: Start difference. First operand 1968 states and 2271 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:32,232 INFO L93 Difference]: Finished difference Result 4064 states and 4693 transitions. [2025-03-16 14:07:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-03-16 14:07:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:32,233 INFO L225 Difference]: With dead ends: 4064 [2025-03-16 14:07:32,234 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:07:32,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:32,237 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:32,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 169 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:07:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:07:32,238 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-03-16 14:07:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:07:32,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2025-03-16 14:07:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:32,238 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:07:32,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:07:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:07:32,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:07:32,247 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-03-16 14:07:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:07:32,443 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:32,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:07:32,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:07:32,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:07:32 BoogieIcfgContainer [2025-03-16 14:07:32,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:07:32,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:07:32,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:07:32,737 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:07:32,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:23" (3/4) ... [2025-03-16 14:07:32,739 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:07:32,750 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:07:32,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:07:32,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:07:32,753 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:07:32,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:07:32,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:07:32,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:07:32,855 INFO L158 Benchmark]: Toolchain (without parser) took 10573.27ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 111.6MB in the beginning and 247.6MB in the end (delta: -136.0MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2025-03-16 14:07:32,856 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:32,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.77ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 84.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:07:32,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.39ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:07:32,858 INFO L158 Benchmark]: Boogie Preprocessor took 48.28ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 75.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:32,858 INFO L158 Benchmark]: IcfgBuilder took 762.38ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 68.0MB in the end (delta: 7.2MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-03-16 14:07:32,858 INFO L158 Benchmark]: TraceAbstraction took 9194.73ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.3MB in the beginning and 260.4MB in the end (delta: -193.1MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2025-03-16 14:07:32,858 INFO L158 Benchmark]: Witness Printer took 117.70ms. Allocated memory is still 327.2MB. Free memory was 260.4MB in the beginning and 247.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:07:32,859 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 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.77ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 84.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.39ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 79.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.28ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 75.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 762.38ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 68.0MB in the end (delta: 7.2MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9194.73ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 67.3MB in the beginning and 260.4MB in the end (delta: -193.1MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. * Witness Printer took 117.70ms. Allocated memory is still 327.2MB. Free memory was 260.4MB in the beginning and 247.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. 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: 534]: 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 1 procedures, 137 locations, 265 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1958 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1958 mSDsluCounter, 994 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 766 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4939 IncrementalHoareTripleChecker+Invalid, 5705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 766 mSolverCounterUnsat, 919 mSDtfsCounter, 4939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 633 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2230occurred in iteration=12, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2620 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3159 NumberOfCodeBlocks, 3159 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3143 ConstructedInterpolants, 0 QuantifiedInterpolants, 7258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1046 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 2440/2726 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: 593]: Location Invariant Derived location invariant: ((((((((((a21 == 1) && (a17 == 1)) && (a20 == 1)) || ((a21 <= 0) && (a20 == 1))) || ((((a7 != 1) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5))) || (((a7 != 1) && (a17 <= 0)) && (a21 == 1))) || ((((5 <= a16) && (a7 != 1)) && (a21 == 1)) && (a17 == 1))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:07:32,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE