./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label48.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/Problem14_label48.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 8261a53c19f43c038d6c9bf7efdae8a565c27af3d0b11334f16494326c28bf76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:06:54,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:06:54,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:06:54,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:06:54,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:06:54,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:06:54,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:06:54,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:06:54,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:06:54,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:06:54,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:06:54,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:06:54,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:06:54,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:06:54,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:06:54,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:06:54,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:54,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:06:54,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:06:54,886 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 -> 8261a53c19f43c038d6c9bf7efdae8a565c27af3d0b11334f16494326c28bf76 [2025-03-16 15:06:55,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:06:55,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:06:55,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:06:55,138 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:06:55,139 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:06:55,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2025-03-16 15:06:56,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6e44242/b4b58ee2b7fa4ff4b642bee2bfeaac0a/FLAG7cc92c28f [2025-03-16 15:06:56,668 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:06:56,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label48.c [2025-03-16 15:06:56,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6e44242/b4b58ee2b7fa4ff4b642bee2bfeaac0a/FLAG7cc92c28f [2025-03-16 15:06:56,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e6e44242/b4b58ee2b7fa4ff4b642bee2bfeaac0a [2025-03-16 15:06:56,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:06:56,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:06:56,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:56,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:06:56,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:06:56,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:56" (1/1) ... [2025-03-16 15:06:56,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@146fae87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:56, skipping insertion in model container [2025-03-16 15:06:56,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:56" (1/1) ... [2025-03-16 15:06:56,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:06:57,101 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/Problem14_label48.c[4040,4053] [2025-03-16 15:06:57,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:57,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:06:57,272 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/Problem14_label48.c[4040,4053] [2025-03-16 15:06:57,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:57,355 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:06:57,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57 WrapperNode [2025-03-16 15:06:57,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:57,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:57,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:06:57,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:06:57,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,423 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:06:57,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:57,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:06:57,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:06:57,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:06:57,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,466 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 15:06:57,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:06:57,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:06:57,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:06:57,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:06:57,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (1/1) ... [2025-03-16 15:06:57,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:57,542 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 15:06:57,549 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 15:06:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:06:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:06:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:06:57,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:06:57,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:06:57,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:06:58,580 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:06:58,580 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:06:58,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:06:58,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:06:58,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:58 BoogieIcfgContainer [2025-03-16 15:06:58,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:06:58,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:06:58,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:06:58,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:06:58,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:06:56" (1/3) ... [2025-03-16 15:06:58,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44937f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:58, skipping insertion in model container [2025-03-16 15:06:58,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:57" (2/3) ... [2025-03-16 15:06:58,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44937f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:58, skipping insertion in model container [2025-03-16 15:06:58,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:58" (3/3) ... [2025-03-16 15:06:58,606 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label48.c [2025-03-16 15:06:58,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:06:58,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label48.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:06:58,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:06:58,679 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;@4e1f04c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:06:58,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:06:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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 15:06:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 15:06:58,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:58,690 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] [2025-03-16 15:06:58,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:58,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1762750785, now seen corresponding path program 1 times [2025-03-16 15:06:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:58,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303069655] [2025-03-16 15:06:58,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:58,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:58,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 15:06:58,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 15:06:58,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:58,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:58,818 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 15:06:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303069655] [2025-03-16 15:06:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303069655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686784578] [2025-03-16 15:06:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:06:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:58,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:06:58,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:58,843 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:58,870 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:06:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:06:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-16 15:06:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:58,877 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:06:58,877 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:06:58,879 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 15:06:58,883 INFO L435 NwaCegarLoop]: 298 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, 298 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 15:06:58,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:06:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:06:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:06:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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 15:06:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:06:58,918 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 37 [2025-03-16 15:06:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:58,918 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:06:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:06:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 15:06:58,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:58,921 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] [2025-03-16 15:06:58,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:06:58,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:58,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1319258555, now seen corresponding path program 1 times [2025-03-16 15:06:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922986713] [2025-03-16 15:06:58,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:58,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 15:06:58,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 15:06:58,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:58,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:59,092 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 15:06:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922986713] [2025-03-16 15:06:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922986713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:59,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166896973] [2025-03-16 15:06:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:59,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:59,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:59,096 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:59,748 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2025-03-16 15:06:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:59,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-16 15:06:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:59,750 INFO L225 Difference]: With dead ends: 539 [2025-03-16 15:06:59,750 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 15:06:59,751 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 15:06:59,752 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 161 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:59,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 15:06:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 15:06:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 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 15:06:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2025-03-16 15:06:59,778 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 37 [2025-03-16 15:06:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:59,778 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2025-03-16 15:06:59,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2025-03-16 15:06:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 15:06:59,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:59,785 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, 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] [2025-03-16 15:06:59,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:06:59,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:59,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1354125899, now seen corresponding path program 1 times [2025-03-16 15:06:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:59,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728375348] [2025-03-16 15:06:59,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:59,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 15:06:59,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 15:06:59,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:59,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728375348] [2025-03-16 15:07:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728375348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862478092] [2025-03-16 15:07:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:00,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:00,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:00,182 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 15:07:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:00,934 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2025-03-16 15:07:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:00,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2025-03-16 15:07:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:00,938 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:07:00,938 INFO L226 Difference]: Without dead ends: 715 [2025-03-16 15:07:00,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:00,940 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:00,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 120 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:07:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-16 15:07:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-16 15:07:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 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 15:07:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2025-03-16 15:07:00,959 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 116 [2025-03-16 15:07:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:00,960 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2025-03-16 15:07:00,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 15:07:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2025-03-16 15:07:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 15:07:00,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:00,962 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, 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] [2025-03-16 15:07:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:07:00,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:00,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1431461164, now seen corresponding path program 1 times [2025-03-16 15:07:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330284473] [2025-03-16 15:07:00,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:00,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 15:07:00,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 15:07:00,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:00,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 15:07:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:01,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330284473] [2025-03-16 15:07:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330284473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:01,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919597015] [2025-03-16 15:07:01,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:01,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:01,192 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 15:07:01,194 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 15:07:01,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 15:07:01,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 15:07:01,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:01,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:01,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 15:07:01,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919597015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:01,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:01,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:07:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520955689] [2025-03-16 15:07:01,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:01,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:01,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:01,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:01,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:01,500 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 15:07:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:01,996 INFO L93 Difference]: Finished difference Result 1251 states and 1611 transitions. [2025-03-16 15:07:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:01,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 142 [2025-03-16 15:07:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:02,000 INFO L225 Difference]: With dead ends: 1251 [2025-03-16 15:07:02,000 INFO L226 Difference]: Without dead ends: 1249 [2025-03-16 15:07:02,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:02,001 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:02,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 35 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-16 15:07:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 893. [2025-03-16 15:07:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 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 15:07:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2025-03-16 15:07:02,020 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 142 [2025-03-16 15:07:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:02,021 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2025-03-16 15:07:02,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 15:07:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2025-03-16 15:07:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 15:07:02,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:02,024 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:02,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:07:02,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:02,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1292069152, now seen corresponding path program 1 times [2025-03-16 15:07:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158312773] [2025-03-16 15:07:02,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:02,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 15:07:02,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 15:07:02,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:02,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 15:07:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:02,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158312773] [2025-03-16 15:07:02,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158312773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:02,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:02,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952326523] [2025-03-16 15:07:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:02,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:02,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:02,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:02,477 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 15:07:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:03,097 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2025-03-16 15:07:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:03,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 196 [2025-03-16 15:07:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:03,101 INFO L225 Difference]: With dead ends: 1992 [2025-03-16 15:07:03,101 INFO L226 Difference]: Without dead ends: 1071 [2025-03-16 15:07:03,101 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 15:07:03,102 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:03,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 117 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-16 15:07:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2025-03-16 15:07:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 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 15:07:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2025-03-16 15:07:03,116 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 196 [2025-03-16 15:07:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:03,117 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2025-03-16 15:07:03,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 15:07:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2025-03-16 15:07:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 15:07:03,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:03,119 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:07:03,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1380523412, now seen corresponding path program 1 times [2025-03-16 15:07:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46932675] [2025-03-16 15:07:03,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:03,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 15:07:03,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 15:07:03,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:03,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 71 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:03,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:03,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46932675] [2025-03-16 15:07:03,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46932675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:03,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778590796] [2025-03-16 15:07:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:03,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:03,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:03,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:03,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:07:03,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 15:07:03,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 15:07:03,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:03,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:03,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:03,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 15:07:03,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778590796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:03,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:03,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452483628] [2025-03-16 15:07:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:03,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:03,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:03,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:03,561 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:04,033 INFO L93 Difference]: Finished difference Result 2497 states and 3032 transitions. [2025-03-16 15:07:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-03-16 15:07:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:04,040 INFO L225 Difference]: With dead ends: 2497 [2025-03-16 15:07:04,040 INFO L226 Difference]: Without dead ends: 1427 [2025-03-16 15:07:04,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:04,042 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 144 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:04,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 84 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-16 15:07:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1071. [2025-03-16 15:07:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 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 15:07:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2025-03-16 15:07:04,060 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 208 [2025-03-16 15:07:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:04,061 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2025-03-16 15:07:04,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2025-03-16 15:07:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 15:07:04,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:04,063 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:04,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:04,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 15:07:04,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:04,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:04,264 INFO L85 PathProgramCache]: Analyzing trace with hash 457968117, now seen corresponding path program 1 times [2025-03-16 15:07:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854161240] [2025-03-16 15:07:04,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:04,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 15:07:04,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 15:07:04,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:04,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854161240] [2025-03-16 15:07:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854161240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:04,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:04,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463486749] [2025-03-16 15:07:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:04,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:04,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:04,457 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 15:07:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:04,910 INFO L93 Difference]: Finished difference Result 2675 states and 3212 transitions. [2025-03-16 15:07:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 211 [2025-03-16 15:07:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:04,917 INFO L225 Difference]: With dead ends: 2675 [2025-03-16 15:07:04,918 INFO L226 Difference]: Without dead ends: 1605 [2025-03-16 15:07:04,919 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 15:07:04,920 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:04,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 57 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-16 15:07:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1427. [2025-03-16 15:07:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.156381486676017) internal successors, (1649), 1426 states have internal predecessors, (1649), 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 15:07:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1649 transitions. [2025-03-16 15:07:04,941 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1649 transitions. Word has length 211 [2025-03-16 15:07:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:04,942 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1649 transitions. [2025-03-16 15:07:04,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 15:07:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1649 transitions. [2025-03-16 15:07:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-16 15:07:04,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:04,944 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:04,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:07:04,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:04,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1575490480, now seen corresponding path program 1 times [2025-03-16 15:07:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:04,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265464144] [2025-03-16 15:07:04,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:04,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-16 15:07:04,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-16 15:07:04,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:04,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 162 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:07:05,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265464144] [2025-03-16 15:07:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265464144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368244749] [2025-03-16 15:07:05,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:05,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:05,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:05,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:05,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:07:05,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-16 15:07:05,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-16 15:07:05,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:05,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:05,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:05,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-16 15:07:05,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368244749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 15:07:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924757966] [2025-03-16 15:07:05,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:05,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:05,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:05,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:05,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:05,693 INFO L87 Difference]: Start difference. First operand 1427 states and 1649 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:06,115 INFO L93 Difference]: Finished difference Result 3209 states and 3787 transitions. [2025-03-16 15:07:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2025-03-16 15:07:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:06,120 INFO L225 Difference]: With dead ends: 3209 [2025-03-16 15:07:06,120 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:07:06,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:06,122 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:06,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 46 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:07:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2025-03-16 15:07:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1402918069584735) internal successors, (2032), 1782 states have internal predecessors, (2032), 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 15:07:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2032 transitions. [2025-03-16 15:07:06,142 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2032 transitions. Word has length 330 [2025-03-16 15:07:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:06,142 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2032 transitions. [2025-03-16 15:07:06,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2032 transitions. [2025-03-16 15:07:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-16 15:07:06,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:06,145 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-16 15:07:06,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:07:06,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:06,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:06,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1676915173, now seen corresponding path program 1 times [2025-03-16 15:07:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413890338] [2025-03-16 15:07:06,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:06,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-16 15:07:06,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-16 15:07:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:06,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-16 15:07:06,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413890338] [2025-03-16 15:07:06,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413890338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:06,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:06,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932234680] [2025-03-16 15:07:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:06,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:06,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:06,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:06,650 INFO L87 Difference]: Start difference. First operand 1783 states and 2032 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 15:07:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:07,165 INFO L93 Difference]: Finished difference Result 3594 states and 4115 transitions. [2025-03-16 15:07:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 407 [2025-03-16 15:07:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:07,171 INFO L225 Difference]: With dead ends: 3594 [2025-03-16 15:07:07,171 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:07:07,173 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 15:07:07,174 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:07,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 15 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:07:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2025-03-16 15:07:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.0897867564534232) internal successors, (1942), 1782 states have internal predecessors, (1942), 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 15:07:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1942 transitions. [2025-03-16 15:07:07,204 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1942 transitions. Word has length 407 [2025-03-16 15:07:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:07,204 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1942 transitions. [2025-03-16 15:07:07,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 15:07:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1942 transitions. [2025-03-16 15:07:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-16 15:07:07,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:07,211 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:07,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:07:07,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1616056430, now seen corresponding path program 1 times [2025-03-16 15:07:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880930717] [2025-03-16 15:07:07,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:07,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-16 15:07:07,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-16 15:07:07,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:07,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:07:07,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:07,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880930717] [2025-03-16 15:07:07,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880930717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:07,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:07,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463545172] [2025-03-16 15:07:07,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:07,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:07,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:07,544 INFO L87 Difference]: Start difference. First operand 1783 states and 1942 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 15:07:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:07,957 INFO L93 Difference]: Finished difference Result 4277 states and 4714 transitions. [2025-03-16 15:07:07,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:07,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 430 [2025-03-16 15:07:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:07,964 INFO L225 Difference]: With dead ends: 4277 [2025-03-16 15:07:07,964 INFO L226 Difference]: Without dead ends: 2673 [2025-03-16 15:07:07,966 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 15:07:07,966 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:07,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 218 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-16 15:07:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2317. [2025-03-16 15:07:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.0854922279792747) internal successors, (2514), 2316 states have internal predecessors, (2514), 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 15:07:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2514 transitions. [2025-03-16 15:07:07,997 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2514 transitions. Word has length 430 [2025-03-16 15:07:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:07,997 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2514 transitions. [2025-03-16 15:07:07,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 15:07:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2514 transitions. [2025-03-16 15:07:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-16 15:07:08,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:08,003 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2025-03-16 15:07:08,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:07:08,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:08,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1504981820, now seen corresponding path program 1 times [2025-03-16 15:07:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637389488] [2025-03-16 15:07:08,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:08,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-16 15:07:08,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-16 15:07:08,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:08,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 393 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 15:07:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637389488] [2025-03-16 15:07:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637389488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690359745] [2025-03-16 15:07:08,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:08,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:08,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:08,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:08,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:07:08,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-16 15:07:08,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-16 15:07:08,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:08,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:08,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:08,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 15:07:08,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690359745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:08,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278474817] [2025-03-16 15:07:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:08,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:08,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:08,609 INFO L87 Difference]: Start difference. First operand 2317 states and 2514 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:08,983 INFO L93 Difference]: Finished difference Result 4989 states and 5430 transitions. [2025-03-16 15:07:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2025-03-16 15:07:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:08,989 INFO L225 Difference]: With dead ends: 4989 [2025-03-16 15:07:08,989 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 15:07:08,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:08,992 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 143 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:08,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 245 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 15:07:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2317. [2025-03-16 15:07:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.0807426597582037) internal successors, (2503), 2316 states have internal predecessors, (2503), 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 15:07:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2503 transitions. [2025-03-16 15:07:09,025 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2503 transitions. Word has length 433 [2025-03-16 15:07:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:09,026 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2503 transitions. [2025-03-16 15:07:09,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2503 transitions. [2025-03-16 15:07:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-16 15:07:09,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:09,031 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 15:07:09,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:07:09,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:09,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:09,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash 446590430, now seen corresponding path program 1 times [2025-03-16 15:07:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428264810] [2025-03-16 15:07:09,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:09,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-16 15:07:09,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-16 15:07:09,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:09,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 247 proven. 195 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-16 15:07:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428264810] [2025-03-16 15:07:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428264810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405834020] [2025-03-16 15:07:09,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:09,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:09,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:09,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:07:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-16 15:07:09,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-16 15:07:09,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:09,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:09,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2025-03-16 15:07:09,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405834020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106251926] [2025-03-16 15:07:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:09,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:09,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:09,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:09,838 INFO L87 Difference]: Start difference. First operand 2317 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:10,217 INFO L93 Difference]: Finished difference Result 4989 states and 5461 transitions. [2025-03-16 15:07:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:10,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2025-03-16 15:07:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:10,225 INFO L225 Difference]: With dead ends: 4989 [2025-03-16 15:07:10,225 INFO L226 Difference]: Without dead ends: 3029 [2025-03-16 15:07:10,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:10,228 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 143 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:10,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 239 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2025-03-16 15:07:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2673. [2025-03-16 15:07:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0827095808383234) internal successors, (2893), 2672 states have internal predecessors, (2893), 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 15:07:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2893 transitions. [2025-03-16 15:07:10,260 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2893 transitions. Word has length 445 [2025-03-16 15:07:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:10,260 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2893 transitions. [2025-03-16 15:07:10,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2893 transitions. [2025-03-16 15:07:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-03-16 15:07:10,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:10,264 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:10,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 15:07:10,465 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2050534266, now seen corresponding path program 1 times [2025-03-16 15:07:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485189941] [2025-03-16 15:07:10,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:10,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-03-16 15:07:10,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-03-16 15:07:10,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:10,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 784 proven. 2 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-16 15:07:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:10,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485189941] [2025-03-16 15:07:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485189941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:10,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889557620] [2025-03-16 15:07:10,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:10,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:10,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:10,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:10,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:07:10,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-03-16 15:07:10,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-03-16 15:07:10,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:10,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:10,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:10,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 786 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-16 15:07:12,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889557620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:12,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-16 15:07:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927372353] [2025-03-16 15:07:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:12,463 INFO L87 Difference]: Start difference. First operand 2673 states and 2893 transitions. Second operand has 5 states, 5 states have (on average 63.8) internal successors, (319), 4 states have internal predecessors, (319), 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 15:07:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:13,098 INFO L93 Difference]: Finished difference Result 5167 states and 5609 transitions. [2025-03-16 15:07:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:13,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 4 states have internal predecessors, (319), 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 562 [2025-03-16 15:07:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:13,104 INFO L225 Difference]: With dead ends: 5167 [2025-03-16 15:07:13,104 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 15:07:13,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:13,107 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 216 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:13,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 49 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 15:07:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2317. [2025-03-16 15:07:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.0552677029360966) internal successors, (2444), 2316 states have internal predecessors, (2444), 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 15:07:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2444 transitions. [2025-03-16 15:07:13,131 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2444 transitions. Word has length 562 [2025-03-16 15:07:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:13,132 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2444 transitions. [2025-03-16 15:07:13,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 4 states have internal predecessors, (319), 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 15:07:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2444 transitions. [2025-03-16 15:07:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-03-16 15:07:13,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:13,135 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-16 15:07:13,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:13,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:13,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:13,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1084806411, now seen corresponding path program 1 times [2025-03-16 15:07:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590178748] [2025-03-16 15:07:13,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:13,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-03-16 15:07:13,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-03-16 15:07:13,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:13,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 700 proven. 93 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-16 15:07:13,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:13,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590178748] [2025-03-16 15:07:13,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590178748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:13,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786933807] [2025-03-16 15:07:13,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:13,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:13,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:13,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:13,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:07:13,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-03-16 15:07:13,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-03-16 15:07:13,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:13,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:13,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:13,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-16 15:07:14,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786933807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:14,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086886798] [2025-03-16 15:07:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:14,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:14,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:14,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:14,072 INFO L87 Difference]: Start difference. First operand 2317 states and 2444 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 15:07:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:14,377 INFO L93 Difference]: Finished difference Result 5345 states and 5656 transitions. [2025-03-16 15:07:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 618 [2025-03-16 15:07:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:14,384 INFO L225 Difference]: With dead ends: 5345 [2025-03-16 15:07:14,384 INFO L226 Difference]: Without dead ends: 3207 [2025-03-16 15:07:14,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:14,386 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:14,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 36 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-03-16 15:07:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3207. [2025-03-16 15:07:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0495945102932003) internal successors, (3365), 3206 states have internal predecessors, (3365), 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 15:07:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3365 transitions. [2025-03-16 15:07:14,417 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3365 transitions. Word has length 618 [2025-03-16 15:07:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:14,417 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3365 transitions. [2025-03-16 15:07:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 15:07:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3365 transitions. [2025-03-16 15:07:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2025-03-16 15:07:14,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:14,422 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2025-03-16 15:07:14,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:07:14,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:14,622 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash -220605447, now seen corresponding path program 1 times [2025-03-16 15:07:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354380242] [2025-03-16 15:07:14,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:14,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:14,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 773 statements into 1 equivalence classes. [2025-03-16 15:07:14,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 773 of 773 statements. [2025-03-16 15:07:14,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:14,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-16 15:07:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354380242] [2025-03-16 15:07:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354380242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152101138] [2025-03-16 15:07:14,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:14,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:14,982 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:14,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:07:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 773 statements into 1 equivalence classes. [2025-03-16 15:07:15,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 773 of 773 statements. [2025-03-16 15:07:15,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:15,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:15,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:15,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-16 15:07:15,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1234 proven. 155 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-16 15:07:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152101138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:07:15,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:07:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 15:07:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893440806] [2025-03-16 15:07:15,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:07:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:07:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:07:15,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:15,754 INFO L87 Difference]: Start difference. First operand 3207 states and 3365 transitions. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 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 15:07:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:16,369 INFO L93 Difference]: Finished difference Result 7125 states and 7499 transitions. [2025-03-16 15:07:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:07:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 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 773 [2025-03-16 15:07:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:16,377 INFO L225 Difference]: With dead ends: 7125 [2025-03-16 15:07:16,378 INFO L226 Difference]: Without dead ends: 4097 [2025-03-16 15:07:16,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1548 GetRequests, 1544 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:16,380 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:16,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 42 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-03-16 15:07:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3741. [2025-03-16 15:07:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.052673796791444) internal successors, (3937), 3740 states have internal predecessors, (3937), 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 15:07:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 3937 transitions. [2025-03-16 15:07:16,418 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 3937 transitions. Word has length 773 [2025-03-16 15:07:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:16,419 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 3937 transitions. [2025-03-16 15:07:16,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 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 15:07:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 3937 transitions. [2025-03-16 15:07:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2025-03-16 15:07:16,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:16,440 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:16,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 15:07:16,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:07:16,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:16,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1086176105, now seen corresponding path program 1 times [2025-03-16 15:07:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631484536] [2025-03-16 15:07:16,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:16,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 824 statements into 1 equivalence classes. [2025-03-16 15:07:16,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 824 of 824 statements. [2025-03-16 15:07:16,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:16,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1665 proven. 0 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-03-16 15:07:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631484536] [2025-03-16 15:07:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631484536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:17,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:17,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368226487] [2025-03-16 15:07:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:17,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:17,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:17,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:17,035 INFO L87 Difference]: Start difference. First operand 3741 states and 3937 transitions. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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 15:07:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:17,330 INFO L93 Difference]: Finished difference Result 7481 states and 7874 transitions. [2025-03-16 15:07:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:17,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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 824 [2025-03-16 15:07:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:17,339 INFO L225 Difference]: With dead ends: 7481 [2025-03-16 15:07:17,339 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:07:17,342 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 15:07:17,342 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 51 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:17,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 217 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:07:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2025-03-16 15:07:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0472179683511995) internal successors, (4103), 3918 states have internal predecessors, (4103), 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 15:07:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4103 transitions. [2025-03-16 15:07:17,374 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4103 transitions. Word has length 824 [2025-03-16 15:07:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:17,375 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4103 transitions. [2025-03-16 15:07:17,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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 15:07:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4103 transitions. [2025-03-16 15:07:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2025-03-16 15:07:17,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:17,383 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2025-03-16 15:07:17,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:07:17,383 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:17,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash 575705296, now seen corresponding path program 1 times [2025-03-16 15:07:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:17,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287071782] [2025-03-16 15:07:17,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:17,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 845 statements into 1 equivalence classes. [2025-03-16 15:07:17,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 845 of 845 statements. [2025-03-16 15:07:17,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:17,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2025-03-16 15:07:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287071782] [2025-03-16 15:07:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287071782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:17,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:17,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053479161] [2025-03-16 15:07:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:17,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:17,639 INFO L87 Difference]: Start difference. First operand 3919 states and 4103 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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 15:07:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:17,952 INFO L93 Difference]: Finished difference Result 8371 states and 8803 transitions. [2025-03-16 15:07:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:17,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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 845 [2025-03-16 15:07:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:17,959 INFO L225 Difference]: With dead ends: 8371 [2025-03-16 15:07:17,959 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 15:07:17,963 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 15:07:17,963 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:17,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 24 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 15:07:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4453. [2025-03-16 15:07:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.047843665768194) internal successors, (4665), 4452 states have internal predecessors, (4665), 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 15:07:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4665 transitions. [2025-03-16 15:07:17,997 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4665 transitions. Word has length 845 [2025-03-16 15:07:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:17,997 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4665 transitions. [2025-03-16 15:07:17,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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 15:07:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4665 transitions. [2025-03-16 15:07:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2025-03-16 15:07:18,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:18,003 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-03-16 15:07:18,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:07:18,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:18,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:18,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1790451892, now seen corresponding path program 1 times [2025-03-16 15:07:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858218638] [2025-03-16 15:07:18,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:18,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 902 statements into 1 equivalence classes. [2025-03-16 15:07:18,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 902 of 902 statements. [2025-03-16 15:07:18,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:18,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2438 backedges. 1647 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2025-03-16 15:07:18,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:18,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858218638] [2025-03-16 15:07:18,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858218638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:18,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:18,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:18,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633782411] [2025-03-16 15:07:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:18,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:18,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:18,590 INFO L87 Difference]: Start difference. First operand 4453 states and 4665 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 15:07:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:18,923 INFO L93 Difference]: Finished difference Result 8549 states and 8970 transitions. [2025-03-16 15:07:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:18,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 902 [2025-03-16 15:07:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:18,934 INFO L225 Difference]: With dead ends: 8549 [2025-03-16 15:07:18,934 INFO L226 Difference]: Without dead ends: 4275 [2025-03-16 15:07:18,937 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 15:07:18,937 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:18,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 212 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-16 15:07:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4275. [2025-03-16 15:07:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0414131960692559) internal successors, (4451), 4274 states have internal predecessors, (4451), 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 15:07:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4451 transitions. [2025-03-16 15:07:18,962 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4451 transitions. Word has length 902 [2025-03-16 15:07:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4451 transitions. [2025-03-16 15:07:18,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 15:07:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4451 transitions. [2025-03-16 15:07:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2025-03-16 15:07:18,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:18,967 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2025-03-16 15:07:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:07:18,967 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2123450972, now seen corresponding path program 1 times [2025-03-16 15:07:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027096345] [2025-03-16 15:07:18,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:19,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 940 statements into 1 equivalence classes. [2025-03-16 15:07:19,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 940 of 940 statements. [2025-03-16 15:07:19,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:19,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1777 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:07:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027096345] [2025-03-16 15:07:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027096345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616303132] [2025-03-16 15:07:19,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:19,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:19,764 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:19,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 15:07:19,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 940 statements into 1 equivalence classes. [2025-03-16 15:07:19,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 940 of 940 statements. [2025-03-16 15:07:19,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:19,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:19,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:19,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1777 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-16 15:07:20,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1849 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:07:20,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616303132] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:20,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:07:20,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-16 15:07:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933153627] [2025-03-16 15:07:20,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:20,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:20,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:20,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:20,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:20,893 INFO L87 Difference]: Start difference. First operand 4275 states and 4451 transitions. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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 15:07:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:21,223 INFO L93 Difference]: Finished difference Result 8905 states and 9284 transitions. [2025-03-16 15:07:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:21,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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 940 [2025-03-16 15:07:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:21,230 INFO L225 Difference]: With dead ends: 8905 [2025-03-16 15:07:21,230 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:07:21,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1883 GetRequests, 1875 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:21,233 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 127 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:21,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 8 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:07:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4453. [2025-03-16 15:07:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0422282120395328) internal successors, (4640), 4452 states have internal predecessors, (4640), 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 15:07:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4640 transitions. [2025-03-16 15:07:21,269 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4640 transitions. Word has length 940 [2025-03-16 15:07:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4640 transitions. [2025-03-16 15:07:21,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 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 15:07:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4640 transitions. [2025-03-16 15:07:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1181 [2025-03-16 15:07:21,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:21,280 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:21,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:21,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:21,481 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:21,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash 213955454, now seen corresponding path program 1 times [2025-03-16 15:07:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716462574] [2025-03-16 15:07:21,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:21,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1180 statements into 1 equivalence classes. [2025-03-16 15:07:21,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1180 of 1180 statements. [2025-03-16 15:07:21,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:21,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4567 backedges. 1883 proven. 0 refuted. 0 times theorem prover too weak. 2684 trivial. 0 not checked. [2025-03-16 15:07:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716462574] [2025-03-16 15:07:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716462574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415484360] [2025-03-16 15:07:22,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:22,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:22,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:22,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:22,309 INFO L87 Difference]: Start difference. First operand 4453 states and 4640 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 15:07:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:22,654 INFO L93 Difference]: Finished difference Result 8727 states and 9100 transitions. [2025-03-16 15:07:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 1180 [2025-03-16 15:07:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:22,660 INFO L225 Difference]: With dead ends: 8727 [2025-03-16 15:07:22,661 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:07:22,664 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 15:07:22,665 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 53 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:22,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 219 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:07:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4453. [2025-03-16 15:07:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0404312668463611) internal successors, (4632), 4452 states have internal predecessors, (4632), 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 15:07:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4632 transitions. [2025-03-16 15:07:22,703 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4632 transitions. Word has length 1180 [2025-03-16 15:07:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:22,704 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4632 transitions. [2025-03-16 15:07:22,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 15:07:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4632 transitions. [2025-03-16 15:07:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1185 [2025-03-16 15:07:22,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:22,715 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:07:22,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:07:22,715 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:22,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash -4263103, now seen corresponding path program 1 times [2025-03-16 15:07:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379201930] [2025-03-16 15:07:22,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:22,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1184 statements into 1 equivalence classes. [2025-03-16 15:07:22,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1184 of 1184 statements. [2025-03-16 15:07:22,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:22,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3412 proven. 72 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2025-03-16 15:07:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379201930] [2025-03-16 15:07:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379201930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860070476] [2025-03-16 15:07:23,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:23,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:23,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:23,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 15:07:23,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1184 statements into 1 equivalence classes. [2025-03-16 15:07:24,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1184 of 1184 statements. [2025-03-16 15:07:24,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:24,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:24,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:24,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3371 proven. 666 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-03-16 15:07:24,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4582 backedges. 3484 proven. 0 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2025-03-16 15:07:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860070476] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:24,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:07:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-16 15:07:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012170985] [2025-03-16 15:07:24,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:24,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:24,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:24,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:24,935 INFO L87 Difference]: Start difference. First operand 4453 states and 4632 transitions. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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 15:07:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:25,260 INFO L93 Difference]: Finished difference Result 9083 states and 9450 transitions. [2025-03-16 15:07:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:25,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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 1184 [2025-03-16 15:07:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:25,266 INFO L225 Difference]: With dead ends: 9083 [2025-03-16 15:07:25,266 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:07:25,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2371 GetRequests, 2364 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:25,269 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 121 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:25,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 8 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:07:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2025-03-16 15:07:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0376455906821964) internal successors, (4989), 4808 states have internal predecessors, (4989), 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 15:07:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 4989 transitions. [2025-03-16 15:07:25,303 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 4989 transitions. Word has length 1184 [2025-03-16 15:07:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:25,304 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 4989 transitions. [2025-03-16 15:07:25,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 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 15:07:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 4989 transitions. [2025-03-16 15:07:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2025-03-16 15:07:25,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:25,315 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:25,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:25,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 15:07:25,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:25,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1473178866, now seen corresponding path program 1 times [2025-03-16 15:07:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:25,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190273975] [2025-03-16 15:07:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:25,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1471 statements into 1 equivalence classes. [2025-03-16 15:07:25,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1471 of 1471 statements. [2025-03-16 15:07:25,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:25,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5384 proven. 304 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2025-03-16 15:07:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190273975] [2025-03-16 15:07:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190273975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221774987] [2025-03-16 15:07:27,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:27,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:27,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:27,015 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:27,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 15:07:27,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1471 statements into 1 equivalence classes. [2025-03-16 15:07:27,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1471 of 1471 statements. [2025-03-16 15:07:27,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:27,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:27,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:27,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5059 proven. 716 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-03-16 15:07:27,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 5222 proven. 0 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2025-03-16 15:07:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221774987] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:28,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:07:28,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 10 [2025-03-16 15:07:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916888833] [2025-03-16 15:07:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:28,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:28,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:07:28,147 INFO L87 Difference]: Start difference. First operand 4809 states and 4989 transitions. Second operand has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 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 15:07:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:28,460 INFO L93 Difference]: Finished difference Result 9439 states and 9798 transitions. [2025-03-16 15:07:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 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 1471 [2025-03-16 15:07:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:28,468 INFO L225 Difference]: With dead ends: 9439 [2025-03-16 15:07:28,468 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:07:28,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2946 GetRequests, 2938 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:07:28,476 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 47 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:28,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 9 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:07:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2025-03-16 15:07:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0371490280777538) internal successors, (4802), 4630 states have internal predecessors, (4802), 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 15:07:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4802 transitions. [2025-03-16 15:07:28,515 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4802 transitions. Word has length 1471 [2025-03-16 15:07:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:28,516 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4802 transitions. [2025-03-16 15:07:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 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 15:07:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4802 transitions. [2025-03-16 15:07:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1727 [2025-03-16 15:07:28,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:28,532 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:28,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 15:07:28,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-16 15:07:28,733 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 637826535, now seen corresponding path program 1 times [2025-03-16 15:07:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143628567] [2025-03-16 15:07:28,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:28,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1726 statements into 1 equivalence classes. [2025-03-16 15:07:28,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1726 of 1726 statements. [2025-03-16 15:07:28,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:28,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9684 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2025-03-16 15:07:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143628567] [2025-03-16 15:07:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143628567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:29,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:29,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978156924] [2025-03-16 15:07:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:29,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:29,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:29,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:29,577 INFO L87 Difference]: Start difference. First operand 4631 states and 4802 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 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 15:07:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:29,907 INFO L93 Difference]: Finished difference Result 9093 states and 9424 transitions. [2025-03-16 15:07:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 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 1726 [2025-03-16 15:07:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:29,908 INFO L225 Difference]: With dead ends: 9093 [2025-03-16 15:07:29,908 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:07:29,911 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 15:07:29,911 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:29,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:07:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:07:29,912 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 15:07:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:07:29,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1726 [2025-03-16 15:07:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:29,912 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:07:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 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 15:07:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:07:29,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:07:29,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:07:29,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:07:29,916 INFO L422 BasicCegarLoop]: Path program histogram: [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 15:07:29,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:07:30,168 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:07:30,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:07:30 BoogieIcfgContainer [2025-03-16 15:07:30,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:07:30,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:07:30,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:07:30,184 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:07:30,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:58" (3/4) ... [2025-03-16 15:07:30,186 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:07:30,208 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:07:30,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:07:30,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:07:30,210 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:07:30,327 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:07:30,327 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:07:30,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:07:30,330 INFO L158 Benchmark]: Toolchain (without parser) took 33413.36ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 112.0MB in the beginning and 988.4MB in the end (delta: -876.4MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:30,330 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:07:30,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.20ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 80.5MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:07:30,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.53ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 71.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:30,332 INFO L158 Benchmark]: Boogie Preprocessor took 84.90ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 60.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:30,332 INFO L158 Benchmark]: IcfgBuilder took 1086.69ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 73.1MB in the end (delta: -13.0MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2025-03-16 15:07:30,332 INFO L158 Benchmark]: TraceAbstraction took 31583.39ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 73.1MB in the beginning and 909.0MB in the end (delta: -835.9MB). Peak memory consumption was 596.3MB. Max. memory is 16.1GB. [2025-03-16 15:07:30,332 INFO L158 Benchmark]: Witness Printer took 143.88ms. Allocated memory is still 1.0GB. Free memory was 909.0MB in the beginning and 988.4MB in the end (delta: -79.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2025-03-16 15:07:30,333 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.29ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.20ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 80.5MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.53ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 71.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.90ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 60.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1086.69ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 73.1MB in the end (delta: -13.0MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * TraceAbstraction took 31583.39ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 73.1MB in the beginning and 909.0MB in the end (delta: -835.9MB). Peak memory consumption was 596.3MB. Max. memory is 16.1GB. * Witness Printer took 143.88ms. Allocated memory is still 1.0GB. Free memory was 909.0MB in the beginning and 988.4MB in the end (delta: -79.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 128]: 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, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.3s, OverallIterations: 23, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2530 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2530 mSDsluCounter, 2399 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 1148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11472 IncrementalHoareTripleChecker+Invalid, 12620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1148 mSolverCounterUnsat, 2286 mSDtfsCounter, 11472 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11545 GetRequests, 11469 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4809occurred in iteration=21, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 3382 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 21123 NumberOfCodeBlocks, 21123 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 25453 ConstructedInterpolants, 0 QuantifiedInterpolants, 73078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 8970 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 38 InterpolantComputations, 22 PerfectInterpolantSequences, 75636/79252 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: 890]: Location Invariant Derived location invariant: (((((((((((((long long) a12 + 43) <= 0) && (a24 == 1)) || (((((long long) a12 + 43) <= 0) && (a21 == 9)) && (a15 <= 6))) || (((a21 == 8) && (a24 == 1)) && (a12 <= 600006))) || (((a24 == 1) && (a21 == 9)) && (a12 <= 600006))) || ((a24 == 1) && (a15 <= 6))) || (((((long long) a12 + 43) <= 0) && (a15 <= 6)) && (a21 <= 8))) || (((a24 == 1) && (a21 <= 6)) && (a12 <= 600006))) || (((a24 == 1) && (7 == a21)) && (a12 <= 600006))) || (((a24 == 1) && (a12 <= 600006)) && (8 <= a15))) || ((((a24 == 1) && (a12 <= 600006)) && (a21 == 10)) && (81 <= a12))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:07:30,378 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