./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label54.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/Problem15_label54.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 4c52ec07a463523a7400028d070720f187a378d4cbca4c6c694254a0e1ef7e72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:11:10,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:11:10,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:11:10,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:11:10,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:11:10,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:11:10,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:11:10,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:11:10,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:11:10,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:11:10,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:11:10,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:11:10,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:11:10,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:11:10,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:11:10,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:11:10,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:11:10,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:11:10,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:11:10,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:11:10,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:10,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:11:10,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:11:10,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:11:10,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:11:10,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:11:10,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:11:10,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:11:10,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:11:10,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:11:10,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:11:10,572 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 -> 4c52ec07a463523a7400028d070720f187a378d4cbca4c6c694254a0e1ef7e72 [2025-03-16 15:11:10,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:11:10,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:11:10,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:11:10,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:11:10,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:11:10,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label54.c [2025-03-16 15:11:11,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c97a15d/e6a22bcabe5a43dbb696c5e0caf269a6/FLAGc9f03e35e [2025-03-16 15:11:12,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:11:12,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label54.c [2025-03-16 15:11:12,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c97a15d/e6a22bcabe5a43dbb696c5e0caf269a6/FLAGc9f03e35e [2025-03-16 15:11:12,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c97a15d/e6a22bcabe5a43dbb696c5e0caf269a6 [2025-03-16 15:11:12,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:11:12,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:11:12,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:12,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:11:12,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:11:12,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:12" (1/1) ... [2025-03-16 15:11:12,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6ebb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:12, skipping insertion in model container [2025-03-16 15:11:12,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:12" (1/1) ... [2025-03-16 15:11:12,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:11:12,672 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/Problem15_label54.c[4982,4995] [2025-03-16 15:11:12,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:12,985 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:11:13,002 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/Problem15_label54.c[4982,4995] [2025-03-16 15:11:13,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:13,153 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:11:13,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13 WrapperNode [2025-03-16 15:11:13,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:13,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:13,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:11:13,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:11:13,159 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:11:13" (1/1) ... [2025-03-16 15:11:13,193 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:11:13" (1/1) ... [2025-03-16 15:11:13,302 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:11:13,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:13,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:11:13,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:11:13,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:11:13,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,427 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:11:13,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,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:11:13" (1/1) ... [2025-03-16 15:11:13,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:11:13,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:11:13,530 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:11:13,530 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:11:13,531 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (1/1) ... [2025-03-16 15:11:13,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:13,596 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:11:13,604 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:11:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:11:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:11:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:11:13,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:11:13,662 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:11:13,663 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:11:15,570 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:11:15,632 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:11:15,632 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:11:15,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:11:15,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:11:15,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:15 BoogieIcfgContainer [2025-03-16 15:11:15,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:11:15,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:11:15,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:11:15,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:11:15,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:11:12" (1/3) ... [2025-03-16 15:11:15,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a21ded0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:15, skipping insertion in model container [2025-03-16 15:11:15,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:13" (2/3) ... [2025-03-16 15:11:15,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a21ded0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:15, skipping insertion in model container [2025-03-16 15:11:15,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:15" (3/3) ... [2025-03-16 15:11:15,659 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label54.c [2025-03-16 15:11:15,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:11:15,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label54.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:11:15,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:11:15,727 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;@d549c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:11:15,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:11:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 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:11:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 15:11:15,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:15,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:15,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:15,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 879958689, now seen corresponding path program 1 times [2025-03-16 15:11:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94933363] [2025-03-16 15:11:15,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:15,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:15,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 15:11:15,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 15:11:15,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:15,857 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:11:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:15,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94933363] [2025-03-16 15:11:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94933363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:15,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:15,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141955238] [2025-03-16 15:11:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:15,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:11:15,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:15,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:11:15,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:15,881 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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:11:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:15,925 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:11:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:11:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2025-03-16 15:11:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:15,936 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:11:15,936 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:11:15,939 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:11:15,941 INFO L435 NwaCegarLoop]: 626 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, 626 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:11:15,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:11:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:11:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:11:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 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:11:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:11:15,976 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 39 [2025-03-16 15:11:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:15,976 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:11:15,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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:11:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:11:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 15:11:15,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:15,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:15,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:11:15,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -952185411, now seen corresponding path program 1 times [2025-03-16 15:11:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073692253] [2025-03-16 15:11:15,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:15,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 15:11:16,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 15:11:16,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:16,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:16,149 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:11:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073692253] [2025-03-16 15:11:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073692253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140228296] [2025-03-16 15:11:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:16,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:16,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:16,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:16,151 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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:11:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:17,574 INFO L93 Difference]: Finished difference Result 1046 states and 1824 transitions. [2025-03-16 15:11:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:17,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2025-03-16 15:11:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:17,577 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 15:11:17,577 INFO L226 Difference]: Without dead ends: 687 [2025-03-16 15:11:17,577 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:11:17,578 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 297 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:17,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 193 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:11:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-16 15:11:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2025-03-16 15:11:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.6106194690265487) internal successors, (1092), 678 states have internal predecessors, (1092), 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:11:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1092 transitions. [2025-03-16 15:11:17,601 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1092 transitions. Word has length 39 [2025-03-16 15:11:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:17,602 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1092 transitions. [2025-03-16 15:11:17,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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:11:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1092 transitions. [2025-03-16 15:11:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 15:11:17,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:17,604 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, 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] [2025-03-16 15:11:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:11:17,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash 150057081, now seen corresponding path program 1 times [2025-03-16 15:11:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843953408] [2025-03-16 15:11:17,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:17,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 15:11:17,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 15:11:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:17,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843953408] [2025-03-16 15:11:17,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843953408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:17,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649128949] [2025-03-16 15:11:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:17,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:17,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:17,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:17,832 INFO L87 Difference]: Start difference. First operand 679 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:11:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:19,038 INFO L93 Difference]: Finished difference Result 1963 states and 3170 transitions. [2025-03-16 15:11:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:19,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2025-03-16 15:11:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:19,044 INFO L225 Difference]: With dead ends: 1963 [2025-03-16 15:11:19,044 INFO L226 Difference]: Without dead ends: 1285 [2025-03-16 15:11:19,048 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:11:19,050 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:19,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:11:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-16 15:11:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1280. [2025-03-16 15:11:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3956215793588742) internal successors, (1785), 1279 states have internal predecessors, (1785), 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:11:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1785 transitions. [2025-03-16 15:11:19,080 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1785 transitions. Word has length 107 [2025-03-16 15:11:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:19,080 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1785 transitions. [2025-03-16 15:11:19,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:11:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1785 transitions. [2025-03-16 15:11:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 15:11:19,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:19,087 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, 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] [2025-03-16 15:11:19,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:11:19,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash -302024475, now seen corresponding path program 1 times [2025-03-16 15:11:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135427155] [2025-03-16 15:11:19,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:19,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 15:11:19,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 15:11:19,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:19,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135427155] [2025-03-16 15:11:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135427155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:19,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901349377] [2025-03-16 15:11:19,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:19,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:19,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:19,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:19,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:19,411 INFO L87 Difference]: Start difference. First operand 1280 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:20,846 INFO L93 Difference]: Finished difference Result 2858 states and 3904 transitions. [2025-03-16 15:11:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-16 15:11:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:20,851 INFO L225 Difference]: With dead ends: 2858 [2025-03-16 15:11:20,851 INFO L226 Difference]: Without dead ends: 1579 [2025-03-16 15:11:20,853 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:11:20,854 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:20,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 358 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:11:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-03-16 15:11:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2025-03-16 15:11:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1578 states have (on average 1.3244613434727504) internal successors, (2090), 1578 states have internal predecessors, (2090), 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:11:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2090 transitions. [2025-03-16 15:11:20,880 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2090 transitions. Word has length 115 [2025-03-16 15:11:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2090 transitions. [2025-03-16 15:11:20,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2090 transitions. [2025-03-16 15:11:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 15:11:20,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:20,884 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:20,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:11:20,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:20,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1409410272, now seen corresponding path program 1 times [2025-03-16 15:11:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987550217] [2025-03-16 15:11:20,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:20,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 15:11:20,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 15:11:20,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:20,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 75 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987550217] [2025-03-16 15:11:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987550217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091573567] [2025-03-16 15:11:21,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:21,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:21,438 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:11:21,462 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:11:21,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 15:11:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 15:11:21,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:21,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:11:21,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 126 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:22,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:11:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 126 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091573567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:11:22,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:11:22,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-16 15:11:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879925670] [2025-03-16 15:11:22,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:11:22,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:11:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:22,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:11:22,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:11:22,590 INFO L87 Difference]: Start difference. First operand 1579 states and 2090 transitions. Second operand has 10 states, 10 states have (on average 51.6) internal successors, (516), 9 states have internal predecessors, (516), 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:11:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:28,760 INFO L93 Difference]: Finished difference Result 8166 states and 11083 transitions. [2025-03-16 15:11:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 15:11:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 51.6) internal successors, (516), 9 states have internal predecessors, (516), 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 206 [2025-03-16 15:11:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:28,771 INFO L225 Difference]: With dead ends: 8166 [2025-03-16 15:11:28,771 INFO L226 Difference]: Without dead ends: 4286 [2025-03-16 15:11:28,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 15:11:28,774 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 3228 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 9732 mSolverCounterSat, 1057 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 10789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1057 IncrementalHoareTripleChecker+Valid, 9732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:28,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 415 Invalid, 10789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1057 Valid, 9732 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-16 15:11:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-03-16 15:11:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 3977. [2025-03-16 15:11:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3976 states have (on average 1.1509054325955734) internal successors, (4576), 3976 states have internal predecessors, (4576), 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:11:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 4576 transitions. [2025-03-16 15:11:28,821 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 4576 transitions. Word has length 206 [2025-03-16 15:11:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:28,822 INFO L471 AbstractCegarLoop]: Abstraction has 3977 states and 4576 transitions. [2025-03-16 15:11:28,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 51.6) internal successors, (516), 9 states have internal predecessors, (516), 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:11:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 4576 transitions. [2025-03-16 15:11:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 15:11:28,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:28,824 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:28,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:11:29,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:29,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:29,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1843661538, now seen corresponding path program 1 times [2025-03-16 15:11:29,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:29,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431668409] [2025-03-16 15:11:29,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:29,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:29,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 15:11:29,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 15:11:29,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:29,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 15:11:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:29,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431668409] [2025-03-16 15:11:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431668409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930993763] [2025-03-16 15:11:29,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:29,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:29,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:29,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:29,263 INFO L87 Difference]: Start difference. First operand 3977 states and 4576 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 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:11:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:30,126 INFO L93 Difference]: Finished difference Result 8857 states and 10344 transitions. [2025-03-16 15:11:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 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 321 [2025-03-16 15:11:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:30,137 INFO L225 Difference]: With dead ends: 8857 [2025-03-16 15:11:30,137 INFO L226 Difference]: Without dead ends: 5180 [2025-03-16 15:11:30,141 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:11:30,142 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:30,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 264 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2025-03-16 15:11:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 5177. [2025-03-16 15:11:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5177 states, 5176 states have (on average 1.132341576506955) internal successors, (5861), 5176 states have internal predecessors, (5861), 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:11:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 5861 transitions. [2025-03-16 15:11:30,208 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 5861 transitions. Word has length 321 [2025-03-16 15:11:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:30,209 INFO L471 AbstractCegarLoop]: Abstraction has 5177 states and 5861 transitions. [2025-03-16 15:11:30,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 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:11:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 5861 transitions. [2025-03-16 15:11:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-16 15:11:30,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:30,213 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:11:30,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1521028108, now seen corresponding path program 1 times [2025-03-16 15:11:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:30,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884678110] [2025-03-16 15:11:30,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:30,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-16 15:11:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-16 15:11:30,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:30,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 75 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884678110] [2025-03-16 15:11:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884678110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477485911] [2025-03-16 15:11:31,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:31,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:31,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:31,100 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:11:31,102 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:11:31,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-16 15:11:31,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-16 15:11:31,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:31,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:31,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:11:31,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:31,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477485911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:11:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900677081] [2025-03-16 15:11:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:31,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:31,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:11:31,341 INFO L87 Difference]: Start difference. First operand 5177 states and 5861 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:32,157 INFO L93 Difference]: Finished difference Result 12758 states and 14600 transitions. [2025-03-16 15:11:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:32,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 385 [2025-03-16 15:11:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:32,173 INFO L225 Difference]: With dead ends: 12758 [2025-03-16 15:11:32,173 INFO L226 Difference]: Without dead ends: 7582 [2025-03-16 15:11:32,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:11:32,178 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 244 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:32,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 273 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7582 states. [2025-03-16 15:11:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7582 to 6979. [2025-03-16 15:11:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6979 states, 6978 states have (on average 1.1077672685583262) internal successors, (7730), 6978 states have internal predecessors, (7730), 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:11:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6979 states to 6979 states and 7730 transitions. [2025-03-16 15:11:32,262 INFO L78 Accepts]: Start accepts. Automaton has 6979 states and 7730 transitions. Word has length 385 [2025-03-16 15:11:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:32,262 INFO L471 AbstractCegarLoop]: Abstraction has 6979 states and 7730 transitions. [2025-03-16 15:11:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6979 states and 7730 transitions. [2025-03-16 15:11:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-16 15:11:32,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:32,266 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:32,273 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:11:32,470 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,SelfDestructingSolverStorable6 [2025-03-16 15:11:32,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:32,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash 847853446, now seen corresponding path program 1 times [2025-03-16 15:11:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332211290] [2025-03-16 15:11:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:32,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 15:11:32,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 15:11:32,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:32,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:11:32,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332211290] [2025-03-16 15:11:32,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332211290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:32,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:32,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:32,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945303193] [2025-03-16 15:11:32,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:32,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:32,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:32,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:32,791 INFO L87 Difference]: Start difference. First operand 6979 states and 7730 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:11:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:33,656 INFO L93 Difference]: Finished difference Result 15754 states and 17662 transitions. [2025-03-16 15:11:33,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:33,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 416 [2025-03-16 15:11:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:33,674 INFO L225 Difference]: With dead ends: 15754 [2025-03-16 15:11:33,675 INFO L226 Difference]: Without dead ends: 8776 [2025-03-16 15:11:33,680 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:11:33,680 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 285 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:33,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 547 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8776 states. [2025-03-16 15:11:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8776 to 8774. [2025-03-16 15:11:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8774 states, 8773 states have (on average 1.086743417303089) internal successors, (9534), 8773 states have internal predecessors, (9534), 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:11:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 9534 transitions. [2025-03-16 15:11:33,797 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 9534 transitions. Word has length 416 [2025-03-16 15:11:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:33,798 INFO L471 AbstractCegarLoop]: Abstraction has 8774 states and 9534 transitions. [2025-03-16 15:11:33,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:11:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 9534 transitions. [2025-03-16 15:11:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-16 15:11:33,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:33,809 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:33,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:11:33,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:33,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1081294412, now seen corresponding path program 1 times [2025-03-16 15:11:33,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325198314] [2025-03-16 15:11:33,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:33,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-16 15:11:33,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-16 15:11:33,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:33,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-16 15:11:34,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:34,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325198314] [2025-03-16 15:11:34,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325198314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965984027] [2025-03-16 15:11:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:34,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:34,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:34,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:34,111 INFO L87 Difference]: Start difference. First operand 8774 states and 9534 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:11:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:34,835 INFO L93 Difference]: Finished difference Result 17545 states and 19109 transitions. [2025-03-16 15:11:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 540 [2025-03-16 15:11:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:34,847 INFO L225 Difference]: With dead ends: 17545 [2025-03-16 15:11:34,847 INFO L226 Difference]: Without dead ends: 9071 [2025-03-16 15:11:34,851 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:11:34,851 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:34,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:11:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9071 states. [2025-03-16 15:11:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9071 to 8772. [2025-03-16 15:11:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8772 states, 8771 states have (on average 1.0865351727283092) internal successors, (9530), 8771 states have internal predecessors, (9530), 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:11:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 9530 transitions. [2025-03-16 15:11:34,911 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 9530 transitions. Word has length 540 [2025-03-16 15:11:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 8772 states and 9530 transitions. [2025-03-16 15:11:34,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:11:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 9530 transitions. [2025-03-16 15:11:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-16 15:11:34,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:34,914 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:34,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:11:34,915 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:34,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash 425447928, now seen corresponding path program 1 times [2025-03-16 15:11:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:34,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130649772] [2025-03-16 15:11:34,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:34,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:34,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-16 15:11:34,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-16 15:11:34,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:34,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 15:11:35,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130649772] [2025-03-16 15:11:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130649772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:35,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:35,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453713033] [2025-03-16 15:11:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:35,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:35,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:35,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:35,247 INFO L87 Difference]: Start difference. First operand 8772 states and 9530 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:11:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:36,177 INFO L93 Difference]: Finished difference Result 20263 states and 22046 transitions. [2025-03-16 15:11:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:36,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 566 [2025-03-16 15:11:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:36,195 INFO L225 Difference]: With dead ends: 20263 [2025-03-16 15:11:36,195 INFO L226 Difference]: Without dead ends: 11492 [2025-03-16 15:11:36,203 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:11:36,204 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 296 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:36,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 246 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:11:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11492 states. [2025-03-16 15:11:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11492 to 9373. [2025-03-16 15:11:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9373 states, 9372 states have (on average 1.083760136577038) internal successors, (10157), 9372 states have internal predecessors, (10157), 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:11:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9373 states to 9373 states and 10157 transitions. [2025-03-16 15:11:36,287 INFO L78 Accepts]: Start accepts. Automaton has 9373 states and 10157 transitions. Word has length 566 [2025-03-16 15:11:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:36,288 INFO L471 AbstractCegarLoop]: Abstraction has 9373 states and 10157 transitions. [2025-03-16 15:11:36,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:11:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9373 states and 10157 transitions. [2025-03-16 15:11:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-16 15:11:36,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:36,293 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:11:36,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:36,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1841271751, now seen corresponding path program 1 times [2025-03-16 15:11:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158760013] [2025-03-16 15:11:36,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:36,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-16 15:11:36,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-16 15:11:36,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:36,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:11:36,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:36,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158760013] [2025-03-16 15:11:36,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158760013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054985259] [2025-03-16 15:11:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:36,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:36,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:36,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:36,581 INFO L87 Difference]: Start difference. First operand 9373 states and 10157 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:11:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:37,254 INFO L93 Difference]: Finished difference Result 21136 states and 23006 transitions. [2025-03-16 15:11:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:37,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 574 [2025-03-16 15:11:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:37,271 INFO L225 Difference]: With dead ends: 21136 [2025-03-16 15:11:37,271 INFO L226 Difference]: Without dead ends: 11764 [2025-03-16 15:11:37,281 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:11:37,282 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 276 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:37,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 535 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11764 states. [2025-03-16 15:11:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11764 to 11465. [2025-03-16 15:11:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11465 states, 11464 states have (on average 1.07109211444522) internal successors, (12279), 11464 states have internal predecessors, (12279), 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:11:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11465 states to 11465 states and 12279 transitions. [2025-03-16 15:11:37,377 INFO L78 Accepts]: Start accepts. Automaton has 11465 states and 12279 transitions. Word has length 574 [2025-03-16 15:11:37,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:37,377 INFO L471 AbstractCegarLoop]: Abstraction has 11465 states and 12279 transitions. [2025-03-16 15:11:37,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:11:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 11465 states and 12279 transitions. [2025-03-16 15:11:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-16 15:11:37,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:37,381 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:37,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:11:37,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:37,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1391489498, now seen corresponding path program 1 times [2025-03-16 15:11:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959810168] [2025-03-16 15:11:37,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:37,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-16 15:11:37,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-16 15:11:37,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-16 15:11:37,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:37,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959810168] [2025-03-16 15:11:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959810168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:37,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:37,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381001127] [2025-03-16 15:11:37,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:37,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:37,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:37,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:37,587 INFO L87 Difference]: Start difference. First operand 11465 states and 12279 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:11:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:38,241 INFO L93 Difference]: Finished difference Result 25320 states and 27226 transitions. [2025-03-16 15:11:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 577 [2025-03-16 15:11:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:38,259 INFO L225 Difference]: With dead ends: 25320 [2025-03-16 15:11:38,260 INFO L226 Difference]: Without dead ends: 13856 [2025-03-16 15:11:38,269 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:11:38,270 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 305 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:38,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 464 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13856 states. [2025-03-16 15:11:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13856 to 13856. [2025-03-16 15:11:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13856 states, 13855 states have (on average 1.0654637315048718) internal successors, (14762), 13855 states have internal predecessors, (14762), 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:11:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13856 states to 13856 states and 14762 transitions. [2025-03-16 15:11:38,378 INFO L78 Accepts]: Start accepts. Automaton has 13856 states and 14762 transitions. Word has length 577 [2025-03-16 15:11:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:38,378 INFO L471 AbstractCegarLoop]: Abstraction has 13856 states and 14762 transitions. [2025-03-16 15:11:38,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:11:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13856 states and 14762 transitions. [2025-03-16 15:11:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-16 15:11:38,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:38,386 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:38,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:11:38,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1093898346, now seen corresponding path program 1 times [2025-03-16 15:11:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896978045] [2025-03-16 15:11:38,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:38,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-16 15:11:38,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-16 15:11:38,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:38,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:11:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:38,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896978045] [2025-03-16 15:11:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896978045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:38,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:38,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745529817] [2025-03-16 15:11:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:38,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:38,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:38,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:38,717 INFO L87 Difference]: Start difference. First operand 13856 states and 14762 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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:11:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:39,428 INFO L93 Difference]: Finished difference Result 30402 states and 32638 transitions. [2025-03-16 15:11:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 729 [2025-03-16 15:11:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:39,451 INFO L225 Difference]: With dead ends: 30402 [2025-03-16 15:11:39,451 INFO L226 Difference]: Without dead ends: 16846 [2025-03-16 15:11:39,461 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:11:39,462 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 160 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:39,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 512 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16846 states. [2025-03-16 15:11:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16846 to 16547. [2025-03-16 15:11:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16547 states, 16546 states have (on average 1.0582013779765502) internal successors, (17509), 16546 states have internal predecessors, (17509), 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:11:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16547 states to 16547 states and 17509 transitions. [2025-03-16 15:11:39,674 INFO L78 Accepts]: Start accepts. Automaton has 16547 states and 17509 transitions. Word has length 729 [2025-03-16 15:11:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:39,675 INFO L471 AbstractCegarLoop]: Abstraction has 16547 states and 17509 transitions. [2025-03-16 15:11:39,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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:11:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 16547 states and 17509 transitions. [2025-03-16 15:11:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-16 15:11:39,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:39,688 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:39,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:11:39,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:39,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2047295845, now seen corresponding path program 1 times [2025-03-16 15:11:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:39,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035842700] [2025-03-16 15:11:39,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:39,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-16 15:11:39,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-16 15:11:39,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:39,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-16 15:11:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:39,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035842700] [2025-03-16 15:11:39,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035842700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:39,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:39,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:39,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600279770] [2025-03-16 15:11:39,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:39,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:39,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:39,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:39,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:39,967 INFO L87 Difference]: Start difference. First operand 16547 states and 17509 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:40,633 INFO L93 Difference]: Finished difference Result 34887 states and 37019 transitions. [2025-03-16 15:11:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:40,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 732 [2025-03-16 15:11:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:40,656 INFO L225 Difference]: With dead ends: 34887 [2025-03-16 15:11:40,656 INFO L226 Difference]: Without dead ends: 18640 [2025-03-16 15:11:40,665 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:11:40,666 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 275 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:40,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 209 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18640 states. [2025-03-16 15:11:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18640 to 15046. [2025-03-16 15:11:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15046 states, 15045 states have (on average 1.057892987703556) internal successors, (15916), 15045 states have internal predecessors, (15916), 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:11:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15046 states to 15046 states and 15916 transitions. [2025-03-16 15:11:40,838 INFO L78 Accepts]: Start accepts. Automaton has 15046 states and 15916 transitions. Word has length 732 [2025-03-16 15:11:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:40,839 INFO L471 AbstractCegarLoop]: Abstraction has 15046 states and 15916 transitions. [2025-03-16 15:11:40,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 15046 states and 15916 transitions. [2025-03-16 15:11:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2025-03-16 15:11:40,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:40,849 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, 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, 5, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:40,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:11:40,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1364345730, now seen corresponding path program 1 times [2025-03-16 15:11:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522330122] [2025-03-16 15:11:40,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 816 statements into 1 equivalence classes. [2025-03-16 15:11:40,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 816 of 816 statements. [2025-03-16 15:11:40,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:40,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 844 proven. 345 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-16 15:11:41,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522330122] [2025-03-16 15:11:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522330122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499734232] [2025-03-16 15:11:41,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:41,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:41,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:41,724 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:11:41,725 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:11:41,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 816 statements into 1 equivalence classes. [2025-03-16 15:11:41,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 816 of 816 statements. [2025-03-16 15:11:41,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:41,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:41,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:11:41,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-16 15:11:42,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499734232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:42,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:11:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894588090] [2025-03-16 15:11:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:42,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:42,072 INFO L87 Difference]: Start difference. First operand 15046 states and 15916 transitions. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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:11:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:42,682 INFO L93 Difference]: Finished difference Result 30690 states and 32511 transitions. [2025-03-16 15:11:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:42,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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 816 [2025-03-16 15:11:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:42,698 INFO L225 Difference]: With dead ends: 30690 [2025-03-16 15:11:42,698 INFO L226 Difference]: Without dead ends: 15944 [2025-03-16 15:11:42,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 817 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:11:42,708 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 219 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:42,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 395 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:11:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15944 states. [2025-03-16 15:11:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15944 to 15940. [2025-03-16 15:11:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15940 states, 15939 states have (on average 1.0527636614593137) internal successors, (16780), 15939 states have internal predecessors, (16780), 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:11:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15940 states to 15940 states and 16780 transitions. [2025-03-16 15:11:42,831 INFO L78 Accepts]: Start accepts. Automaton has 15940 states and 16780 transitions. Word has length 816 [2025-03-16 15:11:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:42,832 INFO L471 AbstractCegarLoop]: Abstraction has 15940 states and 16780 transitions. [2025-03-16 15:11:42,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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:11:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 15940 states and 16780 transitions. [2025-03-16 15:11:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2025-03-16 15:11:42,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:42,841 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, 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, 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, 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, 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, 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] [2025-03-16 15:11:42,852 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:11:43,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:43,042 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:43,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -43605457, now seen corresponding path program 1 times [2025-03-16 15:11:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:43,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275329108] [2025-03-16 15:11:43,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:43,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-03-16 15:11:43,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-03-16 15:11:43,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:43,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2025-03-16 15:11:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275329108] [2025-03-16 15:11:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275329108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507827168] [2025-03-16 15:11:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:43,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:43,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:43,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:43,394 INFO L87 Difference]: Start difference. First operand 15940 states and 16780 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:44,062 INFO L93 Difference]: Finished difference Result 35466 states and 37403 transitions. [2025-03-16 15:11:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:44,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 823 [2025-03-16 15:11:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:44,081 INFO L225 Difference]: With dead ends: 35466 [2025-03-16 15:11:44,081 INFO L226 Difference]: Without dead ends: 19826 [2025-03-16 15:11:44,093 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:11:44,093 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 369 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:44,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 412 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19826 states. [2025-03-16 15:11:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19826 to 16238. [2025-03-16 15:11:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16238 states, 16237 states have (on average 1.0555521340149043) internal successors, (17139), 16237 states have internal predecessors, (17139), 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:11:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16238 states to 16238 states and 17139 transitions. [2025-03-16 15:11:44,303 INFO L78 Accepts]: Start accepts. Automaton has 16238 states and 17139 transitions. Word has length 823 [2025-03-16 15:11:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:44,304 INFO L471 AbstractCegarLoop]: Abstraction has 16238 states and 17139 transitions. [2025-03-16 15:11:44,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:11:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 16238 states and 17139 transitions. [2025-03-16 15:11:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2025-03-16 15:11:44,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:44,318 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:11:44,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:44,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1679251690, now seen corresponding path program 1 times [2025-03-16 15:11:44,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:44,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851194910] [2025-03-16 15:11:44,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:44,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:44,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 845 statements into 1 equivalence classes. [2025-03-16 15:11:44,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 845 of 845 statements. [2025-03-16 15:11:44,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:44,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-16 15:11:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851194910] [2025-03-16 15:11:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851194910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522318577] [2025-03-16 15:11:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:44,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:44,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:44,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:44,994 INFO L87 Difference]: Start difference. First operand 16238 states and 17139 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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:11:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:45,570 INFO L93 Difference]: Finished difference Result 32175 states and 33975 transitions. [2025-03-16 15:11:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:45,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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:11:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:45,582 INFO L225 Difference]: With dead ends: 32175 [2025-03-16 15:11:45,582 INFO L226 Difference]: Without dead ends: 15938 [2025-03-16 15:11:45,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:11:45,591 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 210 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:45,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 108 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:11:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15938 states. [2025-03-16 15:11:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15938 to 15339. [2025-03-16 15:11:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15339 states, 15338 states have (on average 1.048832963880558) internal successors, (16087), 15338 states have internal predecessors, (16087), 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:11:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 16087 transitions. [2025-03-16 15:11:45,691 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 16087 transitions. Word has length 845 [2025-03-16 15:11:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:45,691 INFO L471 AbstractCegarLoop]: Abstraction has 15339 states and 16087 transitions. [2025-03-16 15:11:45,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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:11:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 16087 transitions. [2025-03-16 15:11:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2025-03-16 15:11:45,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:45,700 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, 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, 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, 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, 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, 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:11:45,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:11:45,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:45,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1898913570, now seen corresponding path program 1 times [2025-03-16 15:11:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:45,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473681838] [2025-03-16 15:11:45,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:45,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 918 statements into 1 equivalence classes. [2025-03-16 15:11:45,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 918 of 918 statements. [2025-03-16 15:11:45,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:45,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1399 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2025-03-16 15:11:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473681838] [2025-03-16 15:11:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473681838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547092727] [2025-03-16 15:11:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:46,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:46,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:46,171 INFO L87 Difference]: Start difference. First operand 15339 states and 16087 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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:11:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:46,783 INFO L93 Difference]: Finished difference Result 27345 states and 28518 transitions. [2025-03-16 15:11:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:46,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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 918 [2025-03-16 15:11:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:46,784 INFO L225 Difference]: With dead ends: 27345 [2025-03-16 15:11:46,784 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:11:46,793 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:11:46,793 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 248 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:46,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 68 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:11:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:11:46,793 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:11:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:11:46,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 918 [2025-03-16 15:11:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:46,794 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:11:46,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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:11:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:11:46,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:11:46,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:11:46,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:11:46,798 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:46,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:11:47,522 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:11:47,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:11:47 BoogieIcfgContainer [2025-03-16 15:11:47,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:11:47,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:11:47,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:11:47,546 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:11:47,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:15" (3/4) ... [2025-03-16 15:11:47,548 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:11:47,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:11:47,574 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:11:47,576 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:11:47,577 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:11:47,721 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:11:47,721 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:11:47,721 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:11:47,722 INFO L158 Benchmark]: Toolchain (without parser) took 35234.34ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 100.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2025-03-16 15:11:47,722 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:11:47,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.50ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 87.6MB in the end (delta: 12.9MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2025-03-16 15:11:47,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.19ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 50.8MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:11:47,723 INFO L158 Benchmark]: Boogie Preprocessor took 225.24ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 45.6MB in the end (delta: 5.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2025-03-16 15:11:47,723 INFO L158 Benchmark]: IcfgBuilder took 2120.76ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 45.6MB in the beginning and 250.9MB in the end (delta: -205.3MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. [2025-03-16 15:11:47,724 INFO L158 Benchmark]: TraceAbstraction took 31890.59ms. Allocated memory was 377.5MB in the beginning and 1.3GB in the end (delta: 931.1MB). Free memory was 250.9MB in the beginning and 1.2GB in the end (delta: -932.3MB). Peak memory consumption was 737.6MB. Max. memory is 16.1GB. [2025-03-16 15:11:47,724 INFO L158 Benchmark]: Witness Printer took 175.32ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:11:47,725 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.50ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 87.6MB in the end (delta: 12.9MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.19ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 50.8MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 225.24ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 45.6MB in the end (delta: 5.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2120.76ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 45.6MB in the beginning and 250.9MB in the end (delta: -205.3MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. * TraceAbstraction took 31890.59ms. Allocated memory was 377.5MB in the beginning and 1.3GB in the end (delta: 931.1MB). Free memory was 250.9MB in the beginning and 1.2GB in the end (delta: -932.3MB). Peak memory consumption was 737.6MB. Max. memory is 16.1GB. * Witness Printer took 175.32ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. 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: 137]: 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, 363 locations, 688 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.1s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7387 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7387 mSDsluCounter, 6054 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 794 mSDsCounter, 3187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22299 IncrementalHoareTripleChecker+Invalid, 25486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3187 mSolverCounterUnsat, 5260 mSDtfsCounter, 22299 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1673 GetRequests, 1636 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16547occurred in iteration=13, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 11731 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 10155 NumberOfCodeBlocks, 10155 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 10339 ConstructedInterpolants, 0 QuantifiedInterpolants, 29867 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1756 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 10532/11075 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: 1776]: Location Invariant Derived location invariant: (((((((((((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (a2 <= 2)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || ((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || (((2 <= a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || ((a29 <= 41) && ((((((long long) 42 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1))))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (a2 == 4))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((2 <= a2) && (((long long) 89 + a4) <= 0)) && (a2 != 4))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 61) <= 0)) && (a2 <= 2))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:11:47,740 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