./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label08.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/Problem17_label08.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 9e8eccafd5332366d591fd0f563128386bcd6073a7941113bfddd094bb357fdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:16:21,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:16:21,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:16:21,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:16:21,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:16:21,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:16:21,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:16:21,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:16:21,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:16:21,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:16:21,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:16:21,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:16:21,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:16:21,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:16:21,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:16:21,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:16:21,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:16:21,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:16:21,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:16:21,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:16:21,482 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:16:21,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:16:21,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:16:21,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:16:21,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:16:21,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:16:21,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:16:21,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:16:21,483 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 -> 9e8eccafd5332366d591fd0f563128386bcd6073a7941113bfddd094bb357fdc [2025-03-16 15:16:21,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:16:21,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:16:21,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:16:21,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:16:21,707 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:16:21,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label08.c [2025-03-16 15:16:22,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e58eebf2/b88cd100d2354c13a00cc9ff635cdc0f/FLAG287f363ad [2025-03-16 15:16:23,244 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:16:23,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label08.c [2025-03-16 15:16:23,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e58eebf2/b88cd100d2354c13a00cc9ff635cdc0f/FLAG287f363ad [2025-03-16 15:16:23,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e58eebf2/b88cd100d2354c13a00cc9ff635cdc0f [2025-03-16 15:16:23,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:16:23,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:16:23,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:16:23,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:16:23,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:16:23,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:16:23" (1/1) ... [2025-03-16 15:16:23,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3185303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:23, skipping insertion in model container [2025-03-16 15:16:23,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:16:23" (1/1) ... [2025-03-16 15:16:23,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:16:23,642 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/Problem17_label08.c[8572,8585] [2025-03-16 15:16:23,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:16:24,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:16:24,047 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/Problem17_label08.c[8572,8585] [2025-03-16 15:16:24,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:16:24,196 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:16:24,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24 WrapperNode [2025-03-16 15:16:24,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:16:24,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:16:24,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:16:24,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:16:24,202 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:16:24" (1/1) ... [2025-03-16 15:16:24,226 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:16:24" (1/1) ... [2025-03-16 15:16:24,423 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:16:24,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:16:24,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:16:24,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:16:24,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:16:24,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,631 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:16:24,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:16:24,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:16:24,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:16:24,833 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:16:24,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (1/1) ... [2025-03-16 15:16:24,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:16:24,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:24,866 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:16:24,871 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:16:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:16:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:16:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:16:24,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:16:24,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:16:24,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:16:27,447 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:16:27,614 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:16:27,615 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:16:27,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:16:27,641 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:16:27,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:16:27 BoogieIcfgContainer [2025-03-16 15:16:27,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:16:27,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:16:27,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:16:27,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:16:27,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:16:23" (1/3) ... [2025-03-16 15:16:27,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28feeba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:16:27, skipping insertion in model container [2025-03-16 15:16:27,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:16:24" (2/3) ... [2025-03-16 15:16:27,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28feeba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:16:27, skipping insertion in model container [2025-03-16 15:16:27,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:16:27" (3/3) ... [2025-03-16 15:16:27,651 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label08.c [2025-03-16 15:16:27,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:16:27,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label08.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:16:27,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:16:27,735 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;@21c543d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:16:27,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:16:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 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:16:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 15:16:27,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:27,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:27,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:27,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash -245000774, now seen corresponding path program 1 times [2025-03-16 15:16:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:27,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913972080] [2025-03-16 15:16:27,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:27,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 15:16:27,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 15:16:27,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:27,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:27,876 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:16:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913972080] [2025-03-16 15:16:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913972080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:27,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:27,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:16:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908384115] [2025-03-16 15:16:27,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:27,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:16:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:27,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:16:27,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:16:27,903 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 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 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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:16:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:27,958 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:16:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:16:27,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 15:16:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:27,977 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:16:27,978 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:16:27,981 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:16:27,982 INFO L435 NwaCegarLoop]: 938 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, 938 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:16:27,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:16:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:16:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:16:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 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:16:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:16:28,040 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 57 [2025-03-16 15:16:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:28,041 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:16:28,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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:16:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:16:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 15:16:28,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:28,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:16:28,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:28,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1325830239, now seen corresponding path program 1 times [2025-03-16 15:16:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079023537] [2025-03-16 15:16:28,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:28,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 15:16:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 15:16:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:28,238 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:16:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079023537] [2025-03-16 15:16:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079023537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:28,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:16:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025226953] [2025-03-16 15:16:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:28,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:28,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:28,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:28,240 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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:16:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:30,059 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2025-03-16 15:16:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:30,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 15:16:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:30,063 INFO L225 Difference]: With dead ends: 1499 [2025-03-16 15:16:30,063 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 15:16:30,064 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:16:30,064 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 416 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:30,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 497 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:16:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 15:16:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2025-03-16 15:16:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 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:16:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2025-03-16 15:16:30,089 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 57 [2025-03-16 15:16:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:30,090 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2025-03-16 15:16:30,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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:16:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2025-03-16 15:16:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 15:16:30,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:30,093 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, 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] [2025-03-16 15:16:30,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:16:30,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:30,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 923192583, now seen corresponding path program 1 times [2025-03-16 15:16:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975860815] [2025-03-16 15:16:30,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:30,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 15:16:30,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 15:16:30,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:30,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:30,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975860815] [2025-03-16 15:16:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975860815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:30,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753838375] [2025-03-16 15:16:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:30,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:30,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:30,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:30,438 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:32,264 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2025-03-16 15:16:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:32,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-16 15:16:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:32,272 INFO L225 Difference]: With dead ends: 2813 [2025-03-16 15:16:32,273 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:16:32,277 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:16:32,277 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 433 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:32,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 919 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:16:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:16:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2025-03-16 15:16:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2025-03-16 15:16:32,321 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 127 [2025-03-16 15:16:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:32,321 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2025-03-16 15:16:32,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2025-03-16 15:16:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 15:16:32,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:32,324 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:32,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:16:32,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:32,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1981959044, now seen corresponding path program 1 times [2025-03-16 15:16:32,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:32,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752195278] [2025-03-16 15:16:32,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:32,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:32,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 15:16:32,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 15:16:32,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:32,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:32,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:32,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752195278] [2025-03-16 15:16:32,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752195278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:32,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:32,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:16:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393340799] [2025-03-16 15:16:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:32,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:32,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:32,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:32,472 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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:16:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:34,009 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2025-03-16 15:16:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:34,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-16 15:16:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:34,020 INFO L225 Difference]: With dead ends: 5394 [2025-03-16 15:16:34,020 INFO L226 Difference]: Without dead ends: 2700 [2025-03-16 15:16:34,025 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:16:34,027 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:34,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:16:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-16 15:16:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2025-03-16 15:16:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 0 states have call successors, (0), 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:16:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2025-03-16 15:16:34,063 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 149 [2025-03-16 15:16:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:34,064 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2025-03-16 15:16:34,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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:16:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2025-03-16 15:16:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-16 15:16:34,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:34,068 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:34,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:16:34,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:34,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:34,070 INFO L85 PathProgramCache]: Analyzing trace with hash 598308614, now seen corresponding path program 1 times [2025-03-16 15:16:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:34,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301668125] [2025-03-16 15:16:34,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:34,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 15:16:34,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 15:16:34,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:34,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:16:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301668125] [2025-03-16 15:16:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301668125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400701432] [2025-03-16 15:16:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:34,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:34,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:34,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:34,314 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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:16:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:35,521 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2025-03-16 15:16:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:35,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-16 15:16:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:35,531 INFO L225 Difference]: With dead ends: 7107 [2025-03-16 15:16:35,531 INFO L226 Difference]: Without dead ends: 4408 [2025-03-16 15:16:35,533 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:16:35,534 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:35,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:16:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2025-03-16 15:16:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2025-03-16 15:16:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 0 states have call successors, (0), 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:16:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2025-03-16 15:16:35,581 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 209 [2025-03-16 15:16:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:35,582 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2025-03-16 15:16:35,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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:16:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2025-03-16 15:16:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 15:16:35,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:35,584 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:35,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:16:35,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:35,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1305838431, now seen corresponding path program 1 times [2025-03-16 15:16:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334262987] [2025-03-16 15:16:35,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:35,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 15:16:35,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 15:16:35,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:35,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:16:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:35,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334262987] [2025-03-16 15:16:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334262987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563746194] [2025-03-16 15:16:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:35,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:35,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:35,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:35,737 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:37,066 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2025-03-16 15:16:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-16 15:16:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:37,081 INFO L225 Difference]: With dead ends: 10935 [2025-03-16 15:16:37,081 INFO L226 Difference]: Without dead ends: 6527 [2025-03-16 15:16:37,086 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:16:37,087 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 392 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:37,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:16:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2025-03-16 15:16:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2025-03-16 15:16:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 0 states have call successors, (0), 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:16:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2025-03-16 15:16:37,147 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 211 [2025-03-16 15:16:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:37,147 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2025-03-16 15:16:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2025-03-16 15:16:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 15:16:37,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:37,150 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:16:37,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 433437417, now seen corresponding path program 1 times [2025-03-16 15:16:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745774129] [2025-03-16 15:16:37,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:37,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 15:16:37,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 15:16:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:16:37,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:37,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745774129] [2025-03-16 15:16:37,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745774129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:37,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:37,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:37,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841982252] [2025-03-16 15:16:37,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:37,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:37,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:37,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:37,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:37,390 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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:16:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:38,698 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2025-03-16 15:16:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 277 [2025-03-16 15:16:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:38,710 INFO L225 Difference]: With dead ends: 10044 [2025-03-16 15:16:38,710 INFO L226 Difference]: Without dead ends: 5664 [2025-03-16 15:16:38,713 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:16:38,714 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 378 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:38,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 892 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:16:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2025-03-16 15:16:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2025-03-16 15:16:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 0 states have call successors, (0), 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:16:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2025-03-16 15:16:38,765 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 277 [2025-03-16 15:16:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:38,766 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2025-03-16 15:16:38,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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:16:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2025-03-16 15:16:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-16 15:16:38,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:38,769 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:16:38,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1127726790, now seen corresponding path program 1 times [2025-03-16 15:16:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655023881] [2025-03-16 15:16:38,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:38,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-16 15:16:38,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-16 15:16:38,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:38,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:16:39,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655023881] [2025-03-16 15:16:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655023881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:39,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:39,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282280840] [2025-03-16 15:16:39,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:39,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:39,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:39,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:39,002 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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:16:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:40,404 INFO L93 Difference]: Finished difference Result 13050 states and 15222 transitions. [2025-03-16 15:16:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:40,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 289 [2025-03-16 15:16:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:40,445 INFO L225 Difference]: With dead ends: 13050 [2025-03-16 15:16:40,445 INFO L226 Difference]: Without dead ends: 7390 [2025-03-16 15:16:40,448 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:16:40,448 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 495 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:40,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 627 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:16:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7390 states. [2025-03-16 15:16:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7390 to 6958. [2025-03-16 15:16:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6958 states, 6957 states have (on average 1.1637199942503953) internal successors, (8096), 6957 states have internal predecessors, (8096), 0 states have call successors, (0), 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:16:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 8096 transitions. [2025-03-16 15:16:40,529 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 8096 transitions. Word has length 289 [2025-03-16 15:16:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:40,529 INFO L471 AbstractCegarLoop]: Abstraction has 6958 states and 8096 transitions. [2025-03-16 15:16:40,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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:16:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 8096 transitions. [2025-03-16 15:16:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 15:16:40,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:40,534 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:16:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:16:40,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1219998157, now seen corresponding path program 1 times [2025-03-16 15:16:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361158117] [2025-03-16 15:16:40,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:40,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 15:16:40,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 15:16:40,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:40,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:16:40,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:40,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361158117] [2025-03-16 15:16:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361158117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:40,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176120063] [2025-03-16 15:16:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:40,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:40,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:40,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:40,705 INFO L87 Difference]: Start difference. First operand 6958 states and 8096 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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:16:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:42,072 INFO L93 Difference]: Finished difference Result 17315 states and 20392 transitions. [2025-03-16 15:16:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:42,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 294 [2025-03-16 15:16:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:42,089 INFO L225 Difference]: With dead ends: 17315 [2025-03-16 15:16:42,089 INFO L226 Difference]: Without dead ends: 10358 [2025-03-16 15:16:42,095 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:16:42,095 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 379 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:42,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 839 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:16:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2025-03-16 15:16:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 9508. [2025-03-16 15:16:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9508 states, 9507 states have (on average 1.1414747028505312) internal successors, (10852), 9507 states have internal predecessors, (10852), 0 states have call successors, (0), 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:16:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 10852 transitions. [2025-03-16 15:16:42,198 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 10852 transitions. Word has length 294 [2025-03-16 15:16:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:42,198 INFO L471 AbstractCegarLoop]: Abstraction has 9508 states and 10852 transitions. [2025-03-16 15:16:42,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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:16:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 10852 transitions. [2025-03-16 15:16:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-16 15:16:42,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:42,202 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, 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, 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] [2025-03-16 15:16:42,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:16:42,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:42,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1338031309, now seen corresponding path program 1 times [2025-03-16 15:16:42,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:42,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110319675] [2025-03-16 15:16:42,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:42,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-16 15:16:42,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-16 15:16:42,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:42,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:16:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:42,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110319675] [2025-03-16 15:16:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110319675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:42,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:42,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182559717] [2025-03-16 15:16:42,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:42,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:42,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:42,383 INFO L87 Difference]: Start difference. First operand 9508 states and 10852 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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:16:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:43,693 INFO L93 Difference]: Finished difference Result 22431 states and 25677 transitions. [2025-03-16 15:16:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 312 [2025-03-16 15:16:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:43,713 INFO L225 Difference]: With dead ends: 22431 [2025-03-16 15:16:43,713 INFO L226 Difference]: Without dead ends: 12492 [2025-03-16 15:16:43,735 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:16:43,736 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 443 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:43,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 294 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:16:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12492 states. [2025-03-16 15:16:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12492 to 11636. [2025-03-16 15:16:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11636 states, 11635 states have (on average 1.147314138375591) internal successors, (13349), 11635 states have internal predecessors, (13349), 0 states have call successors, (0), 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:16:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 13349 transitions. [2025-03-16 15:16:43,957 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 13349 transitions. Word has length 312 [2025-03-16 15:16:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:43,958 INFO L471 AbstractCegarLoop]: Abstraction has 11636 states and 13349 transitions. [2025-03-16 15:16:43,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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:16:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 13349 transitions. [2025-03-16 15:16:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-16 15:16:43,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:43,963 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, 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, 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] [2025-03-16 15:16:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:16:43,964 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1347651046, now seen corresponding path program 1 times [2025-03-16 15:16:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:43,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209597777] [2025-03-16 15:16:43,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:43,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-16 15:16:44,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-16 15:16:44,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:44,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:16:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209597777] [2025-03-16 15:16:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209597777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:44,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:16:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493688576] [2025-03-16 15:16:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:44,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:16:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:44,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:16:44,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:16:44,266 INFO L87 Difference]: Start difference. First operand 11636 states and 13349 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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:16:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:46,419 INFO L93 Difference]: Finished difference Result 41231 states and 47493 transitions. [2025-03-16 15:16:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:16:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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 317 [2025-03-16 15:16:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:46,455 INFO L225 Difference]: With dead ends: 41231 [2025-03-16 15:16:46,455 INFO L226 Difference]: Without dead ends: 28315 [2025-03-16 15:16:46,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:16:46,466 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 858 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 3238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:46,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 331 Invalid, 3238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:16:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28315 states. [2025-03-16 15:16:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28315 to 27840. [2025-03-16 15:16:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27840 states, 27839 states have (on average 1.1353137684543266) internal successors, (31606), 27839 states have internal predecessors, (31606), 0 states have call successors, (0), 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:16:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27840 states to 27840 states and 31606 transitions. [2025-03-16 15:16:46,838 INFO L78 Accepts]: Start accepts. Automaton has 27840 states and 31606 transitions. Word has length 317 [2025-03-16 15:16:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:46,838 INFO L471 AbstractCegarLoop]: Abstraction has 27840 states and 31606 transitions. [2025-03-16 15:16:46,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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:16:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 27840 states and 31606 transitions. [2025-03-16 15:16:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 15:16:46,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:46,846 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:46,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:16:46,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 759072210, now seen corresponding path program 1 times [2025-03-16 15:16:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634653629] [2025-03-16 15:16:46,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:46,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 15:16:46,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 15:16:46,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:46,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:16:47,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:47,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634653629] [2025-03-16 15:16:47,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634653629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:47,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:47,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:47,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797665842] [2025-03-16 15:16:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:47,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:47,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:47,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:47,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:47,157 INFO L87 Difference]: Start difference. First operand 27840 states and 31606 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:48,708 INFO L93 Difference]: Finished difference Result 71053 states and 80877 transitions. [2025-03-16 15:16:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-03-16 15:16:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:48,752 INFO L225 Difference]: With dead ends: 71053 [2025-03-16 15:16:48,752 INFO L226 Difference]: Without dead ends: 42776 [2025-03-16 15:16:48,765 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:16:48,765 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 449 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:48,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 702 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:16:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42776 states. [2025-03-16 15:16:49,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42776 to 41032. [2025-03-16 15:16:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41032 states, 41031 states have (on average 1.1225171212010432) internal successors, (46058), 41031 states have internal predecessors, (46058), 0 states have call successors, (0), 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:16:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41032 states to 41032 states and 46058 transitions. [2025-03-16 15:16:49,193 INFO L78 Accepts]: Start accepts. Automaton has 41032 states and 46058 transitions. Word has length 346 [2025-03-16 15:16:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:49,193 INFO L471 AbstractCegarLoop]: Abstraction has 41032 states and 46058 transitions. [2025-03-16 15:16:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:16:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 41032 states and 46058 transitions. [2025-03-16 15:16:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-16 15:16:49,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:49,201 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, 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, 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] [2025-03-16 15:16:49,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:16:49,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:49,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1259995883, now seen corresponding path program 1 times [2025-03-16 15:16:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246539317] [2025-03-16 15:16:49,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:49,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-16 15:16:49,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-16 15:16:49,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:49,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:16:49,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:49,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246539317] [2025-03-16 15:16:49,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246539317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:49,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:49,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730268299] [2025-03-16 15:16:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:49,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:49,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:49,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:49,399 INFO L87 Difference]: Start difference. First operand 41032 states and 46058 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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:16:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:50,759 INFO L93 Difference]: Finished difference Result 91425 states and 102895 transitions. [2025-03-16 15:16:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 390 [2025-03-16 15:16:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:50,814 INFO L225 Difference]: With dead ends: 91425 [2025-03-16 15:16:50,814 INFO L226 Difference]: Without dead ends: 49965 [2025-03-16 15:16:50,841 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:16:50,842 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 440 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:50,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 725 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:16:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49965 states. [2025-03-16 15:16:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49965 to 49958. [2025-03-16 15:16:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49958 states, 49957 states have (on average 1.1129571431431031) internal successors, (55600), 49957 states have internal predecessors, (55600), 0 states have call successors, (0), 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:16:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49958 states to 49958 states and 55600 transitions. [2025-03-16 15:16:51,327 INFO L78 Accepts]: Start accepts. Automaton has 49958 states and 55600 transitions. Word has length 390 [2025-03-16 15:16:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:51,328 INFO L471 AbstractCegarLoop]: Abstraction has 49958 states and 55600 transitions. [2025-03-16 15:16:51,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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:16:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 49958 states and 55600 transitions. [2025-03-16 15:16:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-16 15:16:51,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:51,333 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, 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, 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] [2025-03-16 15:16:51,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:16:51,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:51,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1119306446, now seen corresponding path program 1 times [2025-03-16 15:16:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417289264] [2025-03-16 15:16:51,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-16 15:16:51,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-16 15:16:51,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:51,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 244 proven. 82 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:16:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417289264] [2025-03-16 15:16:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417289264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837911835] [2025-03-16 15:16:52,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:52,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:16:52,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:16:52,039 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:16:52,043 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:16:52,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-16 15:16:52,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-16 15:16:52,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:52,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:52,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:16:52,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:16:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 244 proven. 82 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:16:52,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:16:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 15:16:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837911835] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:16:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:16:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377636842] [2025-03-16 15:16:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:52,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:16:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:52,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:16:52,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:16:52,957 INFO L87 Difference]: Start difference. First operand 49958 states and 55600 transitions. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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:16:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:55,132 INFO L93 Difference]: Finished difference Result 120771 states and 134196 transitions. [2025-03-16 15:16:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:16:55,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 393 [2025-03-16 15:16:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:55,209 INFO L225 Difference]: With dead ends: 120771 [2025-03-16 15:16:55,209 INFO L226 Difference]: Without dead ends: 69945 [2025-03-16 15:16:55,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:16:55,245 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 738 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:55,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 152 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:16:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69945 states. [2025-03-16 15:16:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69945 to 67817. [2025-03-16 15:16:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67817 states, 67816 states have (on average 1.0979119971688098) internal successors, (74456), 67816 states have internal predecessors, (74456), 0 states have call successors, (0), 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:16:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67817 states to 67817 states and 74456 transitions. [2025-03-16 15:16:56,073 INFO L78 Accepts]: Start accepts. Automaton has 67817 states and 74456 transitions. Word has length 393 [2025-03-16 15:16:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:56,073 INFO L471 AbstractCegarLoop]: Abstraction has 67817 states and 74456 transitions. [2025-03-16 15:16:56,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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:16:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 67817 states and 74456 transitions. [2025-03-16 15:16:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-16 15:16:56,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:56,080 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, 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, 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] [2025-03-16 15:16:56,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:16:56,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:16:56,281 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:56,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -534280786, now seen corresponding path program 1 times [2025-03-16 15:16:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:56,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613478047] [2025-03-16 15:16:56,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:56,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-16 15:16:56,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-16 15:16:56,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:56,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:16:56,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:56,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613478047] [2025-03-16 15:16:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613478047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:56,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:56,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100094581] [2025-03-16 15:16:56,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:56,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:56,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:56,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:56,557 INFO L87 Difference]: Start difference. First operand 67817 states and 74456 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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:16:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:16:57,927 INFO L93 Difference]: Finished difference Result 139462 states and 153017 transitions. [2025-03-16 15:16:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:16:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 423 [2025-03-16 15:16:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:16:58,001 INFO L225 Difference]: With dead ends: 139462 [2025-03-16 15:16:58,001 INFO L226 Difference]: Without dead ends: 71646 [2025-03-16 15:16:58,035 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:16:58,036 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 357 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:16:58,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 348 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:16:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71646 states. [2025-03-16 15:16:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71646 to 70790. [2025-03-16 15:16:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70790 states, 70789 states have (on average 1.0959894898924973) internal successors, (77584), 70789 states have internal predecessors, (77584), 0 states have call successors, (0), 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:16:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70790 states to 70790 states and 77584 transitions. [2025-03-16 15:16:58,801 INFO L78 Accepts]: Start accepts. Automaton has 70790 states and 77584 transitions. Word has length 423 [2025-03-16 15:16:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:16:58,801 INFO L471 AbstractCegarLoop]: Abstraction has 70790 states and 77584 transitions. [2025-03-16 15:16:58,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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:16:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 70790 states and 77584 transitions. [2025-03-16 15:16:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-16 15:16:58,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:16:58,808 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, 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, 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, 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:16:58,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:16:58,808 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:16:58,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:16:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash -934597144, now seen corresponding path program 1 times [2025-03-16 15:16:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:16:58,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115042749] [2025-03-16 15:16:58,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:16:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:16:58,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-16 15:16:58,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-16 15:16:58,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:16:58,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:16:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:16:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:16:58,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115042749] [2025-03-16 15:16:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115042749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:16:58,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:16:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:16:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163593322] [2025-03-16 15:16:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:58,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:58,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:16:58,932 INFO L87 Difference]: Start difference. First operand 70790 states and 77584 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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:17:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:00,520 INFO L93 Difference]: Finished difference Result 148383 states and 162923 transitions. [2025-03-16 15:17:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 432 [2025-03-16 15:17:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:00,603 INFO L225 Difference]: With dead ends: 148383 [2025-03-16 15:17:00,604 INFO L226 Difference]: Without dead ends: 76740 [2025-03-16 15:17:00,642 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:17:00,644 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 448 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:00,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 609 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76740 states. [2025-03-16 15:17:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76740 to 66505. [2025-03-16 15:17:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66505 states, 66504 states have (on average 1.0966708769397329) internal successors, (72933), 66504 states have internal predecessors, (72933), 0 states have call successors, (0), 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:17:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66505 states to 66505 states and 72933 transitions. [2025-03-16 15:17:01,329 INFO L78 Accepts]: Start accepts. Automaton has 66505 states and 72933 transitions. Word has length 432 [2025-03-16 15:17:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:01,329 INFO L471 AbstractCegarLoop]: Abstraction has 66505 states and 72933 transitions. [2025-03-16 15:17:01,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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:17:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 66505 states and 72933 transitions. [2025-03-16 15:17:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-16 15:17:01,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:01,337 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, 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, 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, 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:17:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:17:01,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 168232017, now seen corresponding path program 1 times [2025-03-16 15:17:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955778007] [2025-03-16 15:17:01,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:01,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 15:17:01,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 15:17:01,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:01,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 382 proven. 56 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:17:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955778007] [2025-03-16 15:17:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955778007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636216050] [2025-03-16 15:17:02,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:02,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:02,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:02,079 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:17:02,081 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:17:02,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 15:17:02,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 15:17:02,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:02,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:02,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:17:02,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 441 proven. 82 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-16 15:17:02,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 441 proven. 82 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-16 15:17:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636216050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:17:03,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:17:03,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:17:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610586245] [2025-03-16 15:17:03,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:17:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:17:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:03,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:17:03,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:17:03,194 INFO L87 Difference]: Start difference. First operand 66505 states and 72933 transitions. Second operand has 9 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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:17:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:10,698 INFO L93 Difference]: Finished difference Result 170087 states and 186263 transitions. [2025-03-16 15:17:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 15:17:10,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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 437 [2025-03-16 15:17:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:10,825 INFO L225 Difference]: With dead ends: 170087 [2025-03-16 15:17:10,825 INFO L226 Difference]: Without dead ends: 102733 [2025-03-16 15:17:10,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-03-16 15:17:10,871 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 8200 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 8474 mSolverCounterSat, 2353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8200 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 10827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2353 IncrementalHoareTripleChecker+Valid, 8474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:10,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8200 Valid, 304 Invalid, 10827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2353 Valid, 8474 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-03-16 15:17:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102733 states. [2025-03-16 15:17:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102733 to 92440. [2025-03-16 15:17:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92440 states, 92439 states have (on average 1.085970207380002) internal successors, (100386), 92439 states have internal predecessors, (100386), 0 states have call successors, (0), 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:17:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92440 states to 92440 states and 100386 transitions. [2025-03-16 15:17:11,872 INFO L78 Accepts]: Start accepts. Automaton has 92440 states and 100386 transitions. Word has length 437 [2025-03-16 15:17:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:11,872 INFO L471 AbstractCegarLoop]: Abstraction has 92440 states and 100386 transitions. [2025-03-16 15:17:11,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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:17:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 92440 states and 100386 transitions. [2025-03-16 15:17:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-16 15:17:11,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:11,879 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, 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, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:17:11,885 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:17:12,080 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,SelfDestructingSolverStorable16 [2025-03-16 15:17:12,080 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:12,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash 17471190, now seen corresponding path program 1 times [2025-03-16 15:17:12,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:12,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372441115] [2025-03-16 15:17:12,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:12,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-16 15:17:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-16 15:17:12,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:12,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 400 proven. 73 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-16 15:17:12,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:12,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372441115] [2025-03-16 15:17:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372441115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:12,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569612875] [2025-03-16 15:17:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:12,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:12,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:12,350 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:17:12,351 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:17:12,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-16 15:17:12,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-16 15:17:12,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:12,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:12,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:17:12,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 400 proven. 73 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-16 15:17:12,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-16 15:17:12,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569612875] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:12,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:17:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:17:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18446371] [2025-03-16 15:17:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:12,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:12,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:12,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:12,887 INFO L87 Difference]: Start difference. First operand 92440 states and 100386 transitions. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:17:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:15,337 INFO L93 Difference]: Finished difference Result 198930 states and 215929 transitions. [2025-03-16 15:17:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:15,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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 467 [2025-03-16 15:17:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:15,452 INFO L225 Difference]: With dead ends: 198930 [2025-03-16 15:17:15,452 INFO L226 Difference]: Without dead ends: 106916 [2025-03-16 15:17:15,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 931 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:15,490 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 859 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2209 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 2209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:15,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 195 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 2209 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:17:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106916 states. [2025-03-16 15:17:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106916 to 102665. [2025-03-16 15:17:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102665 states, 102664 states have (on average 1.0846742772539546) internal successors, (111357), 102664 states have internal predecessors, (111357), 0 states have call successors, (0), 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:17:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102665 states to 102665 states and 111357 transitions. [2025-03-16 15:17:16,621 INFO L78 Accepts]: Start accepts. Automaton has 102665 states and 111357 transitions. Word has length 467 [2025-03-16 15:17:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:16,621 INFO L471 AbstractCegarLoop]: Abstraction has 102665 states and 111357 transitions. [2025-03-16 15:17:16,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:17:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 102665 states and 111357 transitions. [2025-03-16 15:17:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-16 15:17:16,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:16,630 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:17:16,636 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:17:16,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:17:16,830 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:16,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1887271707, now seen corresponding path program 1 times [2025-03-16 15:17:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:16,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997072337] [2025-03-16 15:17:16,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:16,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-16 15:17:16,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-16 15:17:16,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:16,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 15:17:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:17,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997072337] [2025-03-16 15:17:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997072337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424796265] [2025-03-16 15:17:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:17,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:17,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:17,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:17,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:17,204 INFO L87 Difference]: Start difference. First operand 102665 states and 111357 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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:17:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:18,896 INFO L93 Difference]: Finished difference Result 204048 states and 221350 transitions. [2025-03-16 15:17:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 500 [2025-03-16 15:17:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:19,018 INFO L225 Difference]: With dead ends: 204048 [2025-03-16 15:17:19,018 INFO L226 Difference]: Without dead ends: 101808 [2025-03-16 15:17:19,049 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:17:19,049 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 437 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:19,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 693 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:17:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101808 states. [2025-03-16 15:17:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101808 to 96704. [2025-03-16 15:17:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96704 states, 96703 states have (on average 1.072024652802912) internal successors, (103668), 96703 states have internal predecessors, (103668), 0 states have call successors, (0), 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:17:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96704 states to 96704 states and 103668 transitions. [2025-03-16 15:17:20,067 INFO L78 Accepts]: Start accepts. Automaton has 96704 states and 103668 transitions. Word has length 500 [2025-03-16 15:17:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:20,068 INFO L471 AbstractCegarLoop]: Abstraction has 96704 states and 103668 transitions. [2025-03-16 15:17:20,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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:17:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 96704 states and 103668 transitions. [2025-03-16 15:17:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-16 15:17:20,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:20,081 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:20,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:17:20,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:20,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1922935462, now seen corresponding path program 1 times [2025-03-16 15:17:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:20,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646532477] [2025-03-16 15:17:20,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:20,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:20,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-16 15:17:20,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-16 15:17:20,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:20,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-03-16 15:17:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646532477] [2025-03-16 15:17:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646532477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893510248] [2025-03-16 15:17:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:20,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:20,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:20,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:20,539 INFO L87 Difference]: Start difference. First operand 96704 states and 103668 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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:17:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:21,401 INFO L93 Difference]: Finished difference Result 184459 states and 197697 transitions. [2025-03-16 15:17:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:21,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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 525 [2025-03-16 15:17:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:21,493 INFO L225 Difference]: With dead ends: 184459 [2025-03-16 15:17:21,493 INFO L226 Difference]: Without dead ends: 88180 [2025-03-16 15:17:21,546 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:17:21,546 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:21,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 83 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:17:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88180 states. [2025-03-16 15:17:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88180 to 88168. [2025-03-16 15:17:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88168 states, 88167 states have (on average 1.0709449113613938) internal successors, (94422), 88167 states have internal predecessors, (94422), 0 states have call successors, (0), 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:17:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88168 states to 88168 states and 94422 transitions. [2025-03-16 15:17:22,603 INFO L78 Accepts]: Start accepts. Automaton has 88168 states and 94422 transitions. Word has length 525 [2025-03-16 15:17:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:22,603 INFO L471 AbstractCegarLoop]: Abstraction has 88168 states and 94422 transitions. [2025-03-16 15:17:22,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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:17:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 88168 states and 94422 transitions. [2025-03-16 15:17:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-16 15:17:22,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:22,614 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:17:22,614 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1943690312, now seen corresponding path program 1 times [2025-03-16 15:17:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559445886] [2025-03-16 15:17:22,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:22,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-16 15:17:22,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-16 15:17:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 488 proven. 56 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559445886] [2025-03-16 15:17:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559445886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203343483] [2025-03-16 15:17:23,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:23,181 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:17:23,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:17:23,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-16 15:17:23,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-16 15:17:23,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:23,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:23,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:17:23,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-16 15:17:23,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:17:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203343483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:23,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:17:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-03-16 15:17:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908780654] [2025-03-16 15:17:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:23,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:23,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:23,432 INFO L87 Difference]: Start difference. First operand 88168 states and 94422 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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:17:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:24,748 INFO L93 Difference]: Finished difference Result 88602 states and 94858 transitions. [2025-03-16 15:17:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:24,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 573 [2025-03-16 15:17:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:24,828 INFO L225 Difference]: With dead ends: 88602 [2025-03-16 15:17:24,828 INFO L226 Difference]: Without dead ends: 88175 [2025-03-16 15:17:24,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:24,848 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 416 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:24,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 279 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:17:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88175 states. [2025-03-16 15:17:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88175 to 88168. [2025-03-16 15:17:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88168 states, 88167 states have (on average 1.0703664636428596) internal successors, (94371), 88167 states have internal predecessors, (94371), 0 states have call successors, (0), 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:17:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88168 states to 88168 states and 94371 transitions. [2025-03-16 15:17:25,900 INFO L78 Accepts]: Start accepts. Automaton has 88168 states and 94371 transitions. Word has length 573 [2025-03-16 15:17:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:25,901 INFO L471 AbstractCegarLoop]: Abstraction has 88168 states and 94371 transitions. [2025-03-16 15:17:25,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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:17:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 88168 states and 94371 transitions. [2025-03-16 15:17:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-16 15:17:25,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:25,912 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, 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:25,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:17:26,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:26,113 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1647334636, now seen corresponding path program 1 times [2025-03-16 15:17:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979185813] [2025-03-16 15:17:26,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:26,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-16 15:17:26,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-16 15:17:26,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:26,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 760 proven. 67 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-16 15:17:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979185813] [2025-03-16 15:17:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979185813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015424412] [2025-03-16 15:17:26,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:26,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:26,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:26,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:17:26,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:17:26,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-16 15:17:26,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-16 15:17:26,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:26,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:26,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:17:26,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2025-03-16 15:17:27,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:17:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015424412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:27,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:17:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:17:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989423416] [2025-03-16 15:17:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:27,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:27,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:27,682 INFO L87 Difference]: Start difference. First operand 88168 states and 94371 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:29,026 INFO L93 Difference]: Finished difference Result 184866 states and 197740 transitions. [2025-03-16 15:17:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 592 [2025-03-16 15:17:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:29,131 INFO L225 Difference]: With dead ends: 184866 [2025-03-16 15:17:29,131 INFO L226 Difference]: Without dead ends: 96699 [2025-03-16 15:17:29,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:29,189 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 391 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:29,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 759 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:17:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96699 states. [2025-03-16 15:17:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96699 to 94974. [2025-03-16 15:17:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94974 states, 94973 states have (on average 1.067956155960115) internal successors, (101427), 94973 states have internal predecessors, (101427), 0 states have call successors, (0), 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:17:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94974 states to 94974 states and 101427 transitions. [2025-03-16 15:17:30,530 INFO L78 Accepts]: Start accepts. Automaton has 94974 states and 101427 transitions. Word has length 592 [2025-03-16 15:17:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:30,530 INFO L471 AbstractCegarLoop]: Abstraction has 94974 states and 101427 transitions. [2025-03-16 15:17:30,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 94974 states and 101427 transitions. [2025-03-16 15:17:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-16 15:17:30,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:30,540 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, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:30,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:17:30,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-16 15:17:30,741 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:30,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1612848475, now seen corresponding path program 1 times [2025-03-16 15:17:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712372778] [2025-03-16 15:17:30,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:30,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-16 15:17:30,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-16 15:17:30,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:30,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 847 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-16 15:17:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712372778] [2025-03-16 15:17:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712372778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:17:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096997257] [2025-03-16 15:17:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:31,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:31,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:31,010 INFO L87 Difference]: Start difference. First operand 94974 states and 101427 transitions. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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:17:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:33,193 INFO L93 Difference]: Finished difference Result 212081 states and 225943 transitions. [2025-03-16 15:17:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:33,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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 597 [2025-03-16 15:17:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:33,514 INFO L225 Difference]: With dead ends: 212081 [2025-03-16 15:17:33,514 INFO L226 Difference]: Without dead ends: 117533 [2025-03-16 15:17:33,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:33,557 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 724 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:33,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 174 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:17:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117533 states. [2025-03-16 15:17:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117533 to 109023. [2025-03-16 15:17:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109023 states, 109022 states have (on average 1.0642163966905762) internal successors, (116023), 109022 states have internal predecessors, (116023), 0 states have call successors, (0), 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:17:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109023 states to 109023 states and 116023 transitions. [2025-03-16 15:17:34,642 INFO L78 Accepts]: Start accepts. Automaton has 109023 states and 116023 transitions. Word has length 597 [2025-03-16 15:17:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:34,642 INFO L471 AbstractCegarLoop]: Abstraction has 109023 states and 116023 transitions. [2025-03-16 15:17:34,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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:17:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 109023 states and 116023 transitions. [2025-03-16 15:17:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-03-16 15:17:34,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:34,655 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:17:34,655 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -272894107, now seen corresponding path program 1 times [2025-03-16 15:17:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319145916] [2025-03-16 15:17:34,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:34,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-03-16 15:17:34,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-03-16 15:17:34,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:34,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 530 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:17:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319145916] [2025-03-16 15:17:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319145916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272988096] [2025-03-16 15:17:35,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:35,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:35,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:35,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:17:35,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:17:35,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-03-16 15:17:35,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-03-16 15:17:35,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:35,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:35,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:17:35,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 382 proven. 56 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:35,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:17:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272988096] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:17:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-16 15:17:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841435107] [2025-03-16 15:17:35,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:35,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:35,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:35,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:35,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:35,995 INFO L87 Difference]: Start difference. First operand 109023 states and 116023 transitions. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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:17:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:38,342 INFO L93 Difference]: Finished difference Result 235927 states and 251483 transitions. [2025-03-16 15:17:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:38,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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 624 [2025-03-16 15:17:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:38,485 INFO L225 Difference]: With dead ends: 235927 [2025-03-16 15:17:38,485 INFO L226 Difference]: Without dead ends: 126480 [2025-03-16 15:17:38,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1244 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:17:38,547 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 852 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:38,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 152 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:17:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126480 states. [2025-03-16 15:17:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126480 to 122208. [2025-03-16 15:17:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122208 states, 122207 states have (on average 1.0676229675877813) internal successors, (130471), 122207 states have internal predecessors, (130471), 0 states have call successors, (0), 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:17:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122208 states to 122208 states and 130471 transitions. [2025-03-16 15:17:40,316 INFO L78 Accepts]: Start accepts. Automaton has 122208 states and 130471 transitions. Word has length 624 [2025-03-16 15:17:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:40,316 INFO L471 AbstractCegarLoop]: Abstraction has 122208 states and 130471 transitions. [2025-03-16 15:17:40,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 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:17:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 122208 states and 130471 transitions. [2025-03-16 15:17:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-16 15:17:40,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:40,333 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:40,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 15:17:40,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:40,534 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:40,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash 862471922, now seen corresponding path program 1 times [2025-03-16 15:17:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398389518] [2025-03-16 15:17:40,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:40,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-16 15:17:40,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-16 15:17:40,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:40,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-03-16 15:17:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398389518] [2025-03-16 15:17:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398389518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178756291] [2025-03-16 15:17:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:41,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:41,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:41,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:41,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:41,131 INFO L87 Difference]: Start difference. First operand 122208 states and 130471 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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:17:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:42,700 INFO L93 Difference]: Finished difference Result 245291 states and 261866 transitions. [2025-03-16 15:17:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:42,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 667 [2025-03-16 15:17:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:42,842 INFO L225 Difference]: With dead ends: 245291 [2025-03-16 15:17:42,843 INFO L226 Difference]: Without dead ends: 123084 [2025-03-16 15:17:42,880 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:17:42,880 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 390 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:42,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 755 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:17:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123084 states.