./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label04.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/Problem02_label04.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 dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:08:10,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:08:10,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:08:10,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:08:10,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:08:10,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:08:10,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:08:10,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:08:10,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:08:10,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:08:10,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:08:10,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:08:10,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:08:10,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:08:10,577 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:08:10,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:08:10,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:08:10,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:08:10,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:08:10,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:08:10,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:08:10,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:08:10,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:08:10,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:10,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:08:10,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:08:10,580 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 -> dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 [2025-03-16 14:08:10,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:08:10,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:08:10,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:08:10,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:08:10,825 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:08:10,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2025-03-16 14:08:11,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1bdc572/b0d3eab6f9404870a1726d2bbdf93de3/FLAG1255c3509 [2025-03-16 14:08:12,302 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:08:12,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2025-03-16 14:08:12,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1bdc572/b0d3eab6f9404870a1726d2bbdf93de3/FLAG1255c3509 [2025-03-16 14:08:12,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1bdc572/b0d3eab6f9404870a1726d2bbdf93de3 [2025-03-16 14:08:12,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:08:12,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:08:12,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:12,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:08:12,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:08:12,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd134e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12, skipping insertion in model container [2025-03-16 14:08:12,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:08:12,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/Problem02_label04.c[17470,17483] [2025-03-16 14:08:12,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:12,574 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:08:12,623 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/Problem02_label04.c[17470,17483] [2025-03-16 14:08:12,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:12,640 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:08:12,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12 WrapperNode [2025-03-16 14:08:12,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:12,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:12,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:08:12,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:08:12,647 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:08:12" (1/1) ... [2025-03-16 14:08:12,659 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:08:12" (1/1) ... [2025-03-16 14:08:12,691 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-16 14:08:12,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:12,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:08:12,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:08:12,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:08:12,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,726 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:08:12,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:08:12,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:08:12,759 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:08:12,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:08:12,760 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (1/1) ... [2025-03-16 14:08:12,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:12,785 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:08:12,792 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:08:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:08:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:08:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:08:12,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:08:12,866 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:08:12,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:08:13,591 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:08:13,592 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:08:13,602 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:08:13,603 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:08:13,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:13 BoogieIcfgContainer [2025-03-16 14:08:13,603 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:08:13,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:08:13,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:08:13,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:08:13,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:08:12" (1/3) ... [2025-03-16 14:08:13,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b922a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:13, skipping insertion in model container [2025-03-16 14:08:13,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:12" (2/3) ... [2025-03-16 14:08:13,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b922a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:13, skipping insertion in model container [2025-03-16 14:08:13,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:13" (3/3) ... [2025-03-16 14:08:13,611 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label04.c [2025-03-16 14:08:13,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:08:13,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label04.c that has 1 procedures, 166 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:08:13,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:08:13,676 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;@28423c4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:08:13,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:08:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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:08:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 14:08:13,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:13,687 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] [2025-03-16 14:08:13,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1833359531, now seen corresponding path program 1 times [2025-03-16 14:08:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555706360] [2025-03-16 14:08:13,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:13,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 14:08:13,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 14:08:13,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:13,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:13,959 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:08:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555706360] [2025-03-16 14:08:13,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555706360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:13,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:13,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056146774] [2025-03-16 14:08:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:13,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:08:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:13,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:08:13,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:08:13,986 INFO L87 Difference]: Start difference. First operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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:08:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:14,012 INFO L93 Difference]: Finished difference Result 331 states and 625 transitions. [2025-03-16 14:08:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:08:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2025-03-16 14:08:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:14,020 INFO L225 Difference]: With dead ends: 331 [2025-03-16 14:08:14,020 INFO L226 Difference]: Without dead ends: 163 [2025-03-16 14:08:14,024 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:08:14,025 INFO L435 NwaCegarLoop]: 251 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, 251 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:08:14,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:08:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-16 14:08:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-16 14:08:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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:08:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2025-03-16 14:08:14,052 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 105 [2025-03-16 14:08:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:14,052 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2025-03-16 14:08:14,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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:08:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2025-03-16 14:08:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 14:08:14,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:14,053 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] [2025-03-16 14:08:14,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:08:14,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash -982857322, now seen corresponding path program 1 times [2025-03-16 14:08:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:14,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860183756] [2025-03-16 14:08:14,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:14,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 14:08:14,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 14:08:14,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:14,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:14,288 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:08:14,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860183756] [2025-03-16 14:08:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860183756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:14,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777293243] [2025-03-16 14:08:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:14,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:14,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:14,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:14,290 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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:08:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:14,774 INFO L93 Difference]: Finished difference Result 470 states and 719 transitions. [2025-03-16 14:08:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:14,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2025-03-16 14:08:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:14,776 INFO L225 Difference]: With dead ends: 470 [2025-03-16 14:08:14,777 INFO L226 Difference]: Without dead ends: 308 [2025-03-16 14:08:14,777 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:08:14,778 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 44 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:14,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 117 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:08:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-16 14:08:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2025-03-16 14:08:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.3311475409836067) internal successors, (406), 305 states have internal predecessors, (406), 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:08:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2025-03-16 14:08:14,789 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 105 [2025-03-16 14:08:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:14,789 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2025-03-16 14:08:14,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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:08:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2025-03-16 14:08:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 14:08:14,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:14,791 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:08:14,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:08:14,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -184577175, now seen corresponding path program 1 times [2025-03-16 14:08:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507025775] [2025-03-16 14:08:14,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:14,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 14:08:14,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 14:08:14,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:14,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:14,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:14,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507025775] [2025-03-16 14:08:14,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507025775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:14,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:14,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170298766] [2025-03-16 14:08:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:14,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:14,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:14,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:14,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:14,960 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:08:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:15,351 INFO L93 Difference]: Finished difference Result 757 states and 1033 transitions. [2025-03-16 14:08:15,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:15,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 110 [2025-03-16 14:08:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:15,353 INFO L225 Difference]: With dead ends: 757 [2025-03-16 14:08:15,353 INFO L226 Difference]: Without dead ends: 452 [2025-03-16 14:08:15,354 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:08:15,354 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:15,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-16 14:08:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-03-16 14:08:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.2793791574279378) internal successors, (577), 451 states have internal predecessors, (577), 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:08:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 577 transitions. [2025-03-16 14:08:15,368 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 577 transitions. Word has length 110 [2025-03-16 14:08:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:15,368 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 577 transitions. [2025-03-16 14:08:15,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:08:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 577 transitions. [2025-03-16 14:08:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 14:08:15,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:15,370 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:08:15,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:08:15,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:15,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:15,371 INFO L85 PathProgramCache]: Analyzing trace with hash -566083720, now seen corresponding path program 1 times [2025-03-16 14:08:15,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:15,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401353743] [2025-03-16 14:08:15,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:15,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 14:08:15,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 14:08:15,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:15,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401353743] [2025-03-16 14:08:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401353743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:15,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:15,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013669637] [2025-03-16 14:08:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:15,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:15,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:15,447 INFO L87 Difference]: Start difference. First operand 452 states and 577 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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:08:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:15,848 INFO L93 Difference]: Finished difference Result 1324 states and 1690 transitions. [2025-03-16 14:08:15,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:15,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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 122 [2025-03-16 14:08:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:15,852 INFO L225 Difference]: With dead ends: 1324 [2025-03-16 14:08:15,852 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 14:08:15,856 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:08:15,857 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:15,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 14:08:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-03-16 14:08:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.2305045871559632) internal successors, (1073), 872 states have internal predecessors, (1073), 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:08:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1073 transitions. [2025-03-16 14:08:15,896 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1073 transitions. Word has length 122 [2025-03-16 14:08:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:15,897 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1073 transitions. [2025-03-16 14:08:15,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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:08:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1073 transitions. [2025-03-16 14:08:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 14:08:15,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:15,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:08:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:08:15,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:15,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1298431087, now seen corresponding path program 1 times [2025-03-16 14:08:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:15,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380079509] [2025-03-16 14:08:15,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:15,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 14:08:15,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 14:08:15,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:15,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:16,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380079509] [2025-03-16 14:08:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380079509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:16,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330682370] [2025-03-16 14:08:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:16,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:16,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:16,015 INFO L87 Difference]: Start difference. First operand 873 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:08:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:16,371 INFO L93 Difference]: Finished difference Result 2583 states and 3175 transitions. [2025-03-16 14:08:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 135 [2025-03-16 14:08:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:16,380 INFO L225 Difference]: With dead ends: 2583 [2025-03-16 14:08:16,380 INFO L226 Difference]: Without dead ends: 1711 [2025-03-16 14:08:16,381 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:08:16,381 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 87 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:16,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 74 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2025-03-16 14:08:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1431. [2025-03-16 14:08:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.216083916083916) internal successors, (1739), 1430 states have internal predecessors, (1739), 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:08:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1739 transitions. [2025-03-16 14:08:16,409 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1739 transitions. Word has length 135 [2025-03-16 14:08:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:16,410 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1739 transitions. [2025-03-16 14:08:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:08:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1739 transitions. [2025-03-16 14:08:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 14:08:16,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:16,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:08:16,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:08:16,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:16,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:16,414 INFO L85 PathProgramCache]: Analyzing trace with hash -736483634, now seen corresponding path program 1 times [2025-03-16 14:08:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:16,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740337915] [2025-03-16 14:08:16,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:16,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 14:08:16,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 14:08:16,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:16,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 14:08:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740337915] [2025-03-16 14:08:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740337915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:16,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:16,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106814561] [2025-03-16 14:08:16,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:16,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:08:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:16,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:08:16,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:08:16,662 INFO L87 Difference]: Start difference. First operand 1431 states and 1739 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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:08:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:17,171 INFO L93 Difference]: Finished difference Result 3364 states and 4131 transitions. [2025-03-16 14:08:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:08:17,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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 139 [2025-03-16 14:08:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:17,177 INFO L225 Difference]: With dead ends: 3364 [2025-03-16 14:08:17,177 INFO L226 Difference]: Without dead ends: 1851 [2025-03-16 14:08:17,178 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:08:17,178 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 142 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:17,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 108 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:08:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2025-03-16 14:08:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1431. [2025-03-16 14:08:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 1.211888111888112) internal successors, (1733), 1430 states have internal predecessors, (1733), 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:08:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1733 transitions. [2025-03-16 14:08:17,197 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1733 transitions. Word has length 139 [2025-03-16 14:08:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:17,198 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1733 transitions. [2025-03-16 14:08:17,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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:08:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1733 transitions. [2025-03-16 14:08:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 14:08:17,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:17,200 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 14:08:17,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:08:17,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:17,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1740559936, now seen corresponding path program 1 times [2025-03-16 14:08:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331952911] [2025-03-16 14:08:17,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:17,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 14:08:17,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 14:08:17,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:17,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 14:08:17,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331952911] [2025-03-16 14:08:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331952911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:17,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:17,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66493108] [2025-03-16 14:08:17,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:17,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:17,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:17,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:17,282 INFO L87 Difference]: Start difference. First operand 1431 states and 1733 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:08:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:17,602 INFO L93 Difference]: Finished difference Result 3143 states and 3789 transitions. [2025-03-16 14:08:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 177 [2025-03-16 14:08:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:17,606 INFO L225 Difference]: With dead ends: 3143 [2025-03-16 14:08:17,606 INFO L226 Difference]: Without dead ends: 1571 [2025-03-16 14:08:17,608 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:08:17,609 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:17,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 48 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-03-16 14:08:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1569. [2025-03-16 14:08:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.128188775510204) internal successors, (1769), 1568 states have internal predecessors, (1769), 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:08:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1769 transitions. [2025-03-16 14:08:17,639 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1769 transitions. Word has length 177 [2025-03-16 14:08:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:17,639 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 1769 transitions. [2025-03-16 14:08:17,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:08:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1769 transitions. [2025-03-16 14:08:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 14:08:17,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:17,642 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 14:08:17,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:08:17,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:17,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash 978572362, now seen corresponding path program 1 times [2025-03-16 14:08:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419128425] [2025-03-16 14:08:17,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:17,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 14:08:17,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 14:08:17,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:17,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 14:08:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419128425] [2025-03-16 14:08:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419128425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:08:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068877642] [2025-03-16 14:08:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:17,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:08:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:17,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:08:17,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:17,887 INFO L87 Difference]: Start difference. First operand 1569 states and 1769 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 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:08:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:18,443 INFO L93 Difference]: Finished difference Result 3557 states and 3986 transitions. [2025-03-16 14:08:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:08:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 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 181 [2025-03-16 14:08:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:18,449 INFO L225 Difference]: With dead ends: 3557 [2025-03-16 14:08:18,449 INFO L226 Difference]: Without dead ends: 1989 [2025-03-16 14:08:18,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:18,451 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 328 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:18,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 127 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:08:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2025-03-16 14:08:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1709. [2025-03-16 14:08:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.1194379391100702) internal successors, (1912), 1708 states have internal predecessors, (1912), 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:08:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1912 transitions. [2025-03-16 14:08:18,475 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 1912 transitions. Word has length 181 [2025-03-16 14:08:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:18,475 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 1912 transitions. [2025-03-16 14:08:18,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 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:08:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 1912 transitions. [2025-03-16 14:08:18,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-16 14:08:18,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:18,480 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:08:18,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:08:18,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:18,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1333859529, now seen corresponding path program 1 times [2025-03-16 14:08:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245173608] [2025-03-16 14:08:18,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:18,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-16 14:08:18,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-16 14:08:18,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:18,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:18,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:18,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245173608] [2025-03-16 14:08:18,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245173608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:08:18,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374368670] [2025-03-16 14:08:18,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:18,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:18,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:18,775 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:08:18,777 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:08:18,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-16 14:08:18,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-16 14:08:18,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:18,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:18,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:08:18,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:08:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 14:08:19,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:08:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374368670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:08:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:08:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131121765] [2025-03-16 14:08:19,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:19,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:19,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:19,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:19,010 INFO L87 Difference]: Start difference. First operand 1709 states and 1912 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:08:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:19,301 INFO L93 Difference]: Finished difference Result 3269 states and 3643 transitions. [2025-03-16 14:08:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:19,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 203 [2025-03-16 14:08:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:19,302 INFO L225 Difference]: With dead ends: 3269 [2025-03-16 14:08:19,302 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:08:19,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:19,305 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:19,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 203 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:08:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:08:19,306 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:08:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:08:19,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 203 [2025-03-16 14:08:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:19,306 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:08:19,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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:08:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:08:19,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:08:19,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:08:19,315 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:08:19,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:19,512 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:19,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:08:19,634 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:08:19,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:08:19 BoogieIcfgContainer [2025-03-16 14:08:19,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:08:19,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:08:19,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:08:19,644 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:08:19,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:13" (3/4) ... [2025-03-16 14:08:19,649 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:08:19,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:08:19,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:08:19,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:08:19,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:08:19,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:08:19,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:08:19,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:08:19,763 INFO L158 Benchmark]: Toolchain (without parser) took 7422.30ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.4MB in the beginning and 235.8MB in the end (delta: -125.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2025-03-16 14:08:19,763 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:19,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.25ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 84.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:08:19,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.44ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 78.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:19,763 INFO L158 Benchmark]: Boogie Preprocessor took 66.08ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 74.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:19,764 INFO L158 Benchmark]: IcfgBuilder took 844.15ms. Allocated memory is still 142.6MB. Free memory was 74.8MB in the beginning and 69.8MB in the end (delta: 5.0MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-03-16 14:08:19,764 INFO L158 Benchmark]: TraceAbstraction took 6038.36ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.8MB in the beginning and 246.5MB in the end (delta: -176.7MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2025-03-16 14:08:19,764 INFO L158 Benchmark]: Witness Printer took 118.83ms. Allocated memory is still 285.2MB. Free memory was 246.5MB in the beginning and 235.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:19,765 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.25ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 84.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.44ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 78.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.08ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 74.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 844.15ms. Allocated memory is still 142.6MB. Free memory was 74.8MB in the beginning and 69.8MB in the end (delta: 5.0MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6038.36ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.8MB in the beginning and 246.5MB in the end (delta: -176.7MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. * Witness Printer took 118.83ms. Allocated memory is still 285.2MB. Free memory was 246.5MB in the beginning and 235.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. 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: 500]: 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, 166 locations, 313 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1060 mSDsluCounter, 1255 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 592 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3672 IncrementalHoareTripleChecker+Invalid, 4264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 592 mSolverCounterUnsat, 1090 mSDtfsCounter, 3672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1709occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 984 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1480 NumberOfCodeBlocks, 1480 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1470 ConstructedInterpolants, 0 QuantifiedInterpolants, 6609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 563/621 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: 616]: Location Invariant Derived location invariant: ((((((a19 == 1) && (a11 != 1)) || ((10 <= a28) && (a19 == 1))) || (((a17 == 8) && (a21 == 1)) && (a19 == 1))) || ((a19 == 1) && (a28 <= 7))) || (a19 <= 0)) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:08:19,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE