./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label14.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 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:08:33,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:08:33,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:08:33,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:08:33,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:08:33,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:08:33,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:08:33,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:08:33,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:08:33,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:08:33,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:08:33,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:08:33,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:08:33,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:08:33,778 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:08:33,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:08:33,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:08:33,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:08:33,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:08:33,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:08:33,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:08:33,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:08:33,780 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 -> 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 [2025-03-08 02:08:33,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:08:33,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:08:33,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:08:33,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:08:33,987 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:08:33,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2025-03-08 02:08:35,109 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09edbaa79/dd9a52a401ff49089b6c87ac5dfcbbdb/FLAGd44c99e9b [2025-03-08 02:08:35,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:08:35,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2025-03-08 02:08:35,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09edbaa79/dd9a52a401ff49089b6c87ac5dfcbbdb/FLAGd44c99e9b [2025-03-08 02:08:35,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09edbaa79/dd9a52a401ff49089b6c87ac5dfcbbdb [2025-03-08 02:08:35,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:08:35,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:08:35,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:08:35,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:08:35,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:08:35,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:08:35" (1/1) ... [2025-03-08 02:08:35,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cbdfbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:35, skipping insertion in model container [2025-03-08 02:08:35,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:08:35" (1/1) ... [2025-03-08 02:08:35,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:08:35,798 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_label14.c[6990,7003] [2025-03-08 02:08:36,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:08:36,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:08:36,130 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_label14.c[6990,7003] [2025-03-08 02:08:36,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:08:36,305 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:08:36,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36 WrapperNode [2025-03-08 02:08:36,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:08:36,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:08:36,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:08:36,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:08:36,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,521 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:08:36,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:08:36,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:08:36,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:08:36,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:08:36,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,717 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-08 02:08:36,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:08:36,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:08:36,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:08:36,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:08:36,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (1/1) ... [2025-03-08 02:08:36,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:08:36,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:36,938 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-08 02:08:36,943 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-08 02:08:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:08:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:08:36,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:08:36,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:08:37,010 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:08:37,011 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:08:39,287 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:08:39,416 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:08:39,416 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:08:39,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:08:39,449 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:08:39,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:39 BoogieIcfgContainer [2025-03-08 02:08:39,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:08:39,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:08:39,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:08:39,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:08:39,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:08:35" (1/3) ... [2025-03-08 02:08:39,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a66b8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:39, skipping insertion in model container [2025-03-08 02:08:39,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:36" (2/3) ... [2025-03-08 02:08:39,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a66b8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:39, skipping insertion in model container [2025-03-08 02:08:39,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:39" (3/3) ... [2025-03-08 02:08:39,464 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label14.c [2025-03-08 02:08:39,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:08:39,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label14.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:08:39,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:08:39,585 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;@5e76228f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:08:39,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:08:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 02:08:39,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:39,599 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] [2025-03-08 02:08:39,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:39,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1664804912, now seen corresponding path program 1 times [2025-03-08 02:08:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61733468] [2025-03-08 02:08:39,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:39,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 02:08:39,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 02:08:39,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:39,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:39,899 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-08 02:08:39,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:39,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61733468] [2025-03-08 02:08:39,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61733468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:39,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:08:39,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237139922] [2025-03-08 02:08:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:39,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:39,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:39,917 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:41,874 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-03-08 02:08:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:41,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 02:08:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:41,885 INFO L225 Difference]: With dead ends: 1642 [2025-03-08 02:08:41,885 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 02:08:41,888 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-08 02:08:41,890 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 443 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:41,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:08:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 02:08:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-03-08 02:08:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-03-08 02:08:41,940 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 47 [2025-03-08 02:08:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-03-08 02:08:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-03-08 02:08:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 02:08:41,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:41,943 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, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:41,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:08:41,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash 553654887, now seen corresponding path program 1 times [2025-03-08 02:08:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829936846] [2025-03-08 02:08:41,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:41,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 02:08:42,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 02:08:42,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:42,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:08:42,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:42,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829936846] [2025-03-08 02:08:42,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829936846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:42,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:42,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:42,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56500944] [2025-03-08 02:08:42,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:42,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:42,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:42,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:42,249 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:43,974 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-03-08 02:08:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-08 02:08:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:43,981 INFO L225 Difference]: With dead ends: 2814 [2025-03-08 02:08:43,981 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:08:43,982 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-08 02:08:43,984 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 444 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 921 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:43,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:08:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:08:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-03-08 02:08:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-03-08 02:08:44,032 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 117 [2025-03-08 02:08:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:44,033 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-03-08 02:08:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-03-08 02:08:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 02:08:44,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:44,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:44,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:08:44,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:44,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 917150482, now seen corresponding path program 1 times [2025-03-08 02:08:44,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177016452] [2025-03-08 02:08:44,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:44,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 02:08:44,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 02:08:44,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:44,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:08:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:44,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177016452] [2025-03-08 02:08:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177016452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:44,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:08:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657659379] [2025-03-08 02:08:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:44,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:44,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:44,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:44,250 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:45,831 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2025-03-08 02:08:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:45,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-03-08 02:08:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:45,839 INFO L225 Difference]: With dead ends: 5395 [2025-03-08 02:08:45,839 INFO L226 Difference]: Without dead ends: 2701 [2025-03-08 02:08:45,841 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-08 02:08:45,841 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 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-08 02:08:45,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:08:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-08 02:08:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2025-03-08 02:08:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2025-03-08 02:08:45,879 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 139 [2025-03-08 02:08:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:45,879 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2025-03-08 02:08:45,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2025-03-08 02:08:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 02:08:45,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:45,882 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:45,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:08:45,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:45,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 620414891, now seen corresponding path program 1 times [2025-03-08 02:08:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547446736] [2025-03-08 02:08:45,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:45,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 02:08:45,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 02:08:45,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:45,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:08:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547446736] [2025-03-08 02:08:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547446736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343946725] [2025-03-08 02:08:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:46,094 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:47,335 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2025-03-08 02:08:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-03-08 02:08:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:47,347 INFO L225 Difference]: With dead ends: 7108 [2025-03-08 02:08:47,347 INFO L226 Difference]: Without dead ends: 4409 [2025-03-08 02:08:47,351 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-08 02:08:47,352 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 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-08 02:08:47,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:08:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-03-08 02:08:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2025-03-08 02:08:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2025-03-08 02:08:47,411 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 199 [2025-03-08 02:08:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:47,412 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2025-03-08 02:08:47,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2025-03-08 02:08:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 02:08:47,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:47,413 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, 2, 2, 2, 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] [2025-03-08 02:08:47,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:08:47,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:47,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1250649296, now seen corresponding path program 1 times [2025-03-08 02:08:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:47,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122982271] [2025-03-08 02:08:47,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:47,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 02:08:47,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 02:08:47,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:47,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:08:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122982271] [2025-03-08 02:08:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122982271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141025370] [2025-03-08 02:08:47,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:47,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:47,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:47,669 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:48,976 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2025-03-08 02:08:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:48,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 201 [2025-03-08 02:08:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:48,993 INFO L225 Difference]: With dead ends: 10936 [2025-03-08 02:08:48,993 INFO L226 Difference]: Without dead ends: 6528 [2025-03-08 02:08:48,996 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-08 02:08:48,997 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 404 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 445 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-08 02:08:48,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:08:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2025-03-08 02:08:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2025-03-08 02:08:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2025-03-08 02:08:49,045 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 201 [2025-03-08 02:08:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:49,045 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2025-03-08 02:08:49,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2025-03-08 02:08:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-08 02:08:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:49,050 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:08:49,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:08:49,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:49,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1774053336, now seen corresponding path program 1 times [2025-03-08 02:08:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:49,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632436538] [2025-03-08 02:08:49,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:49,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 02:08:49,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 02:08:49,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:49,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:08:49,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632436538] [2025-03-08 02:08:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632436538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:49,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:49,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:49,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126731156] [2025-03-08 02:08:49,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:49,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:49,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:49,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:49,290 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:50,720 INFO L93 Difference]: Finished difference Result 10910 states and 12924 transitions. [2025-03-08 02:08:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:50,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 267 [2025-03-08 02:08:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:50,737 INFO L225 Difference]: With dead ends: 10910 [2025-03-08 02:08:50,738 INFO L226 Difference]: Without dead ends: 6530 [2025-03-08 02:08:50,742 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-08 02:08:50,744 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 458 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:50,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 414 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:08:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2025-03-08 02:08:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 6096. [2025-03-08 02:08:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6096 states, 6095 states have (on average 1.188515176374077) internal successors, (7244), 6095 states have internal predecessors, (7244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 7244 transitions. [2025-03-08 02:08:50,819 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 7244 transitions. Word has length 267 [2025-03-08 02:08:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:50,820 INFO L471 AbstractCegarLoop]: Abstraction has 6096 states and 7244 transitions. [2025-03-08 02:08:50,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 7244 transitions. [2025-03-08 02:08:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-08 02:08:50,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:50,824 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:08:50,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:50,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2128884110, now seen corresponding path program 1 times [2025-03-08 02:08:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810983939] [2025-03-08 02:08:50,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:50,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-08 02:08:50,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-08 02:08:50,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:08:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:51,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810983939] [2025-03-08 02:08:51,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810983939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:51,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:51,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:51,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637812029] [2025-03-08 02:08:51,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:51,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:51,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:51,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:51,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:51,189 INFO L87 Difference]: Start difference. First operand 6096 states and 7244 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:52,708 INFO L93 Difference]: Finished difference Result 15622 states and 18732 transitions. [2025-03-08 02:08:52,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:52,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 279 [2025-03-08 02:08:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:52,726 INFO L225 Difference]: With dead ends: 15622 [2025-03-08 02:08:52,726 INFO L226 Difference]: Without dead ends: 8653 [2025-03-08 02:08:52,730 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-08 02:08:52,731 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 492 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:52,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 628 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:08:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8653 states. [2025-03-08 02:08:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8653 to 8222. [2025-03-08 02:08:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8222 states, 8221 states have (on average 1.1763775696387302) internal successors, (9671), 8221 states have internal predecessors, (9671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8222 states to 8222 states and 9671 transitions. [2025-03-08 02:08:52,810 INFO L78 Accepts]: Start accepts. Automaton has 8222 states and 9671 transitions. Word has length 279 [2025-03-08 02:08:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:52,811 INFO L471 AbstractCegarLoop]: Abstraction has 8222 states and 9671 transitions. [2025-03-08 02:08:52,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8222 states and 9671 transitions. [2025-03-08 02:08:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 02:08:52,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:52,815 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-08 02:08:52,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:08:52,815 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 220861576, now seen corresponding path program 1 times [2025-03-08 02:08:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707168694] [2025-03-08 02:08:52,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:52,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 02:08:52,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 02:08:52,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:52,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:08:53,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707168694] [2025-03-08 02:08:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707168694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:53,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:53,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:08:53,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090607919] [2025-03-08 02:08:53,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:53,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:08:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:53,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:08:53,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:08:53,143 INFO L87 Difference]: Start difference. First operand 8222 states and 9671 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:55,522 INFO L93 Difference]: Finished difference Result 30139 states and 35484 transitions. [2025-03-08 02:08:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:08:55,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-03-08 02:08:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:55,555 INFO L225 Difference]: With dead ends: 30139 [2025-03-08 02:08:55,555 INFO L226 Difference]: Without dead ends: 21064 [2025-03-08 02:08:55,561 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-08 02:08:55,562 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 860 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:55,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 272 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:08:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2025-03-08 02:08:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 20596. [2025-03-08 02:08:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20596 states, 20595 states have (on average 1.1576110706482157) internal successors, (23841), 20595 states have internal predecessors, (23841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 23841 transitions. [2025-03-08 02:08:55,761 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 23841 transitions. Word has length 307 [2025-03-08 02:08:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:55,761 INFO L471 AbstractCegarLoop]: Abstraction has 20596 states and 23841 transitions. [2025-03-08 02:08:55,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 23841 transitions. [2025-03-08 02:08:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-08 02:08:55,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:55,772 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:55,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:08:55,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:55,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1189488633, now seen corresponding path program 1 times [2025-03-08 02:08:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170554155] [2025-03-08 02:08:55,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:55,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-08 02:08:55,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-08 02:08:55,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:55,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 232 proven. 82 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 02:08:56,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:56,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170554155] [2025-03-08 02:08:56,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170554155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571165674] [2025-03-08 02:08:56,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:56,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:56,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:56,302 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-08 02:08:56,304 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-08 02:08:56,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-08 02:08:56,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-08 02:08:56,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:56,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:56,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:08:56,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 206 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:08:56,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:08:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:08:57,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571165674] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:57,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:08:57,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-03-08 02:08:57,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313497647] [2025-03-08 02:08:57,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:57,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:08:57,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:57,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:08:57,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:08:57,359 INFO L87 Difference]: Start difference. First operand 20596 states and 23841 transitions. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:00,026 INFO L93 Difference]: Finished difference Result 62901 states and 72227 transitions. [2025-03-08 02:09:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:09:00,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 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 388 [2025-03-08 02:09:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:00,075 INFO L225 Difference]: With dead ends: 62901 [2025-03-08 02:09:00,075 INFO L226 Difference]: Without dead ends: 41455 [2025-03-08 02:09:00,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:09:00,087 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1179 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:00,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 169 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 02:09:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41455 states. [2025-03-08 02:09:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41455 to 41441. [2025-03-08 02:09:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41441 states, 41440 states have (on average 1.1064913127413127) internal successors, (45853), 41440 states have internal predecessors, (45853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41441 states to 41441 states and 45853 transitions. [2025-03-08 02:09:00,589 INFO L78 Accepts]: Start accepts. Automaton has 41441 states and 45853 transitions. Word has length 388 [2025-03-08 02:09:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:00,589 INFO L471 AbstractCegarLoop]: Abstraction has 41441 states and 45853 transitions. [2025-03-08 02:09:00,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 41441 states and 45853 transitions. [2025-03-08 02:09:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-08 02:09:00,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:00,607 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, 4, 4, 4, 4, 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, 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] [2025-03-08 02:09:00,614 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-08 02:09:00,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:00,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:00,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -100324038, now seen corresponding path program 1 times [2025-03-08 02:09:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904462906] [2025-03-08 02:09:00,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:00,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-08 02:09:00,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-08 02:09:00,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:00,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 349 proven. 45 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:09:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:01,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904462906] [2025-03-08 02:09:01,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904462906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:01,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386055340] [2025-03-08 02:09:01,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:01,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:01,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:01,472 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-08 02:09:01,474 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-08 02:09:01,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-08 02:09:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-08 02:09:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:01,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:09:01,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 419 proven. 82 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 02:09:02,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 419 proven. 82 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 02:09:02,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386055340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:09:02,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:09:02,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:09:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465614237] [2025-03-08 02:09:02,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:09:02,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:09:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:02,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:09:02,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:09:02,768 INFO L87 Difference]: Start difference. First operand 41441 states and 45853 transitions. Second operand has 9 states, 9 states have (on average 82.44444444444444) internal successors, (742), 9 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:11,118 INFO L93 Difference]: Finished difference Result 123385 states and 136527 transitions. [2025-03-08 02:09:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 02:09:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.44444444444444) internal successors, (742), 9 states have internal predecessors, (742), 0 states have call successors, (0), 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 427 [2025-03-08 02:09:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:11,230 INFO L225 Difference]: With dead ends: 123385 [2025-03-08 02:09:11,230 INFO L226 Difference]: Without dead ends: 79389 [2025-03-08 02:09:11,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-03-08 02:09:11,267 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 6649 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 11469 mSolverCounterSat, 1577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6649 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 13046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1577 IncrementalHoareTripleChecker+Valid, 11469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:11,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6649 Valid, 359 Invalid, 13046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1577 Valid, 11469 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-03-08 02:09:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79389 states. [2025-03-08 02:09:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79389 to 64384. [2025-03-08 02:09:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64384 states, 64383 states have (on average 1.093052513862355) internal successors, (70374), 64383 states have internal predecessors, (70374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64384 states to 64384 states and 70374 transitions. [2025-03-08 02:09:12,027 INFO L78 Accepts]: Start accepts. Automaton has 64384 states and 70374 transitions. Word has length 427 [2025-03-08 02:09:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 64384 states and 70374 transitions. [2025-03-08 02:09:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.44444444444444) internal successors, (742), 9 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 64384 states and 70374 transitions. [2025-03-08 02:09:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-08 02:09:12,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:12,041 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:12,048 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-08 02:09:12,242 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,SelfDestructingSolverStorable9 [2025-03-08 02:09:12,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1739055801, now seen corresponding path program 1 times [2025-03-08 02:09:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854834080] [2025-03-08 02:09:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:12,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-08 02:09:12,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-08 02:09:12,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:12,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-08 02:09:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854834080] [2025-03-08 02:09:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854834080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262022270] [2025-03-08 02:09:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:12,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:12,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:12,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:12,517 INFO L87 Difference]: Start difference. First operand 64384 states and 70374 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:13,768 INFO L93 Difference]: Finished difference Result 133439 states and 145716 transitions. [2025-03-08 02:09:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 526 [2025-03-08 02:09:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:13,839 INFO L225 Difference]: With dead ends: 133439 [2025-03-08 02:09:13,839 INFO L226 Difference]: Without dead ends: 69057 [2025-03-08 02:09:13,878 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-08 02:09:13,878 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 244 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:13,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 720 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69057 states. [2025-03-08 02:09:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69057 to 66930. [2025-03-08 02:09:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66930 states, 66929 states have (on average 1.0852545234502233) internal successors, (72635), 66929 states have internal predecessors, (72635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66930 states to 66930 states and 72635 transitions. [2025-03-08 02:09:14,721 INFO L78 Accepts]: Start accepts. Automaton has 66930 states and 72635 transitions. Word has length 526 [2025-03-08 02:09:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:14,722 INFO L471 AbstractCegarLoop]: Abstraction has 66930 states and 72635 transitions. [2025-03-08 02:09:14,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 66930 states and 72635 transitions. [2025-03-08 02:09:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-08 02:09:14,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:14,739 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:14,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:09:14,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:14,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -20692176, now seen corresponding path program 1 times [2025-03-08 02:09:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342442256] [2025-03-08 02:09:14,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:14,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-08 02:09:14,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-08 02:09:14,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:14,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-08 02:09:14,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342442256] [2025-03-08 02:09:14,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342442256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542929378] [2025-03-08 02:09:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:14,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:14,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:14,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:14,933 INFO L87 Difference]: Start difference. First operand 66930 states and 72635 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:16,340 INFO L93 Difference]: Finished difference Result 141517 states and 153635 transitions. [2025-03-08 02:09:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:16,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 561 [2025-03-08 02:09:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:16,420 INFO L225 Difference]: With dead ends: 141517 [2025-03-08 02:09:16,420 INFO L226 Difference]: Without dead ends: 74589 [2025-03-08 02:09:16,444 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-08 02:09:16,444 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 482 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:16,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 652 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74589 states. [2025-03-08 02:09:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74589 to 74581. [2025-03-08 02:09:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74581 states, 74580 states have (on average 1.079431482971306) internal successors, (80504), 74580 states have internal predecessors, (80504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74581 states to 74581 states and 80504 transitions. [2025-03-08 02:09:17,327 INFO L78 Accepts]: Start accepts. Automaton has 74581 states and 80504 transitions. Word has length 561 [2025-03-08 02:09:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:17,331 INFO L471 AbstractCegarLoop]: Abstraction has 74581 states and 80504 transitions. [2025-03-08 02:09:17,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 74581 states and 80504 transitions. [2025-03-08 02:09:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-08 02:09:17,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:17,359 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, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:17,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:09:17,359 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:17,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash -368846648, now seen corresponding path program 1 times [2025-03-08 02:09:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264981845] [2025-03-08 02:09:17,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:17,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-08 02:09:17,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-08 02:09:17,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:17,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-08 02:09:17,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264981845] [2025-03-08 02:09:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264981845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:17,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:17,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918177722] [2025-03-08 02:09:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:17,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:17,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:17,721 INFO L87 Difference]: Start difference. First operand 74581 states and 80504 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:18,575 INFO L93 Difference]: Finished difference Result 136364 states and 146793 transitions. [2025-03-08 02:09:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:18,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 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 590 [2025-03-08 02:09:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:18,646 INFO L225 Difference]: With dead ends: 136364 [2025-03-08 02:09:18,646 INFO L226 Difference]: Without dead ends: 61784 [2025-03-08 02:09:18,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:18,692 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 562 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:18,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 74 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:09:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61784 states. [2025-03-08 02:09:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61784 to 61780. [2025-03-08 02:09:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61780 states, 61779 states have (on average 1.0726136713122583) internal successors, (66265), 61779 states have internal predecessors, (66265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61780 states to 61780 states and 66265 transitions. [2025-03-08 02:09:19,385 INFO L78 Accepts]: Start accepts. Automaton has 61780 states and 66265 transitions. Word has length 590 [2025-03-08 02:09:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:19,385 INFO L471 AbstractCegarLoop]: Abstraction has 61780 states and 66265 transitions. [2025-03-08 02:09:19,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 61780 states and 66265 transitions. [2025-03-08 02:09:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-03-08 02:09:19,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:19,401 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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:19,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:09:19,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:19,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1029316224, now seen corresponding path program 1 times [2025-03-08 02:09:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:19,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857793387] [2025-03-08 02:09:19,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-03-08 02:09:19,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-03-08 02:09:19,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:19,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 416 proven. 260 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-08 02:09:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857793387] [2025-03-08 02:09:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857793387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795098222] [2025-03-08 02:09:20,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:20,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:20,211 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-08 02:09:20,213 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-08 02:09:20,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-03-08 02:09:20,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-03-08 02:09:20,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:20,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:20,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:20,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 02:09:20,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:09:20,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795098222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:20,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:09:20,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 02:09:20,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222355862] [2025-03-08 02:09:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:20,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:20,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:20,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:09:20,758 INFO L87 Difference]: Start difference. First operand 61780 states and 66265 transitions. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:22,669 INFO L93 Difference]: Finished difference Result 144849 states and 155083 transitions. [2025-03-08 02:09:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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 600 [2025-03-08 02:09:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:22,755 INFO L225 Difference]: With dead ends: 144849 [2025-03-08 02:09:22,755 INFO L226 Difference]: Without dead ends: 83071 [2025-03-08 02:09:22,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:09:22,799 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 585 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:22,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 127 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:09:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83071 states. [2025-03-08 02:09:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83071 to 77114. [2025-03-08 02:09:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77114 states, 77113 states have (on average 1.0691712162670366) internal successors, (82447), 77113 states have internal predecessors, (82447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77114 states to 77114 states and 82447 transitions. [2025-03-08 02:09:23,881 INFO L78 Accepts]: Start accepts. Automaton has 77114 states and 82447 transitions. Word has length 600 [2025-03-08 02:09:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:23,882 INFO L471 AbstractCegarLoop]: Abstraction has 77114 states and 82447 transitions. [2025-03-08 02:09:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 77114 states and 82447 transitions. [2025-03-08 02:09:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-08 02:09:23,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:23,896 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:23,902 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-08 02:09:24,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:24,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:24,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 83486728, now seen corresponding path program 1 times [2025-03-08 02:09:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53800557] [2025-03-08 02:09:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:24,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-08 02:09:24,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-08 02:09:24,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:24,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 02:09:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53800557] [2025-03-08 02:09:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53800557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:24,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:24,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675111963] [2025-03-08 02:09:24,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:24,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:24,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:24,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:24,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:24,596 INFO L87 Difference]: Start difference. First operand 77114 states and 82447 transitions. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:25,826 INFO L93 Difference]: Finished difference Result 155929 states and 166661 transitions. [2025-03-08 02:09:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:25,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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 611 [2025-03-08 02:09:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:25,905 INFO L225 Difference]: With dead ends: 155929 [2025-03-08 02:09:25,906 INFO L226 Difference]: Without dead ends: 78817 [2025-03-08 02:09:25,955 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-08 02:09:25,956 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 94 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:25,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 731 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:09:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78817 states. [2025-03-08 02:09:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78817 to 77965. [2025-03-08 02:09:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77965 states, 77964 states have (on average 1.0675311682314914) internal successors, (83229), 77964 states have internal predecessors, (83229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77965 states to 77965 states and 83229 transitions. [2025-03-08 02:09:26,897 INFO L78 Accepts]: Start accepts. Automaton has 77965 states and 83229 transitions. Word has length 611 [2025-03-08 02:09:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:26,897 INFO L471 AbstractCegarLoop]: Abstraction has 77965 states and 83229 transitions. [2025-03-08 02:09:26,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 77965 states and 83229 transitions. [2025-03-08 02:09:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-08 02:09:26,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:26,916 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, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:26,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:09:26,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:26,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -803568293, now seen corresponding path program 1 times [2025-03-08 02:09:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:26,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233621107] [2025-03-08 02:09:26,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:26,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-08 02:09:27,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-08 02:09:27,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:27,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-08 02:09:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233621107] [2025-03-08 02:09:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233621107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073230476] [2025-03-08 02:09:27,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:27,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:27,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:27,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:27,366 INFO L87 Difference]: Start difference. First operand 77965 states and 83229 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:28,715 INFO L93 Difference]: Finished difference Result 170813 states and 182828 transitions. [2025-03-08 02:09:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:28,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 616 [2025-03-08 02:09:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:28,808 INFO L225 Difference]: With dead ends: 170813 [2025-03-08 02:09:28,808 INFO L226 Difference]: Without dead ends: 92850 [2025-03-08 02:09:28,855 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-08 02:09:28,856 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 262 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:28,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 235 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:09:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92850 states. [2025-03-08 02:09:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92850 to 86033. [2025-03-08 02:09:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86033 states, 86032 states have (on average 1.0618607029942346) internal successors, (91354), 86032 states have internal predecessors, (91354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86033 states to 86033 states and 91354 transitions. [2025-03-08 02:09:30,074 INFO L78 Accepts]: Start accepts. Automaton has 86033 states and 91354 transitions. Word has length 616 [2025-03-08 02:09:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:30,074 INFO L471 AbstractCegarLoop]: Abstraction has 86033 states and 91354 transitions. [2025-03-08 02:09:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 86033 states and 91354 transitions. [2025-03-08 02:09:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2025-03-08 02:09:30,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:30,094 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, 5, 5, 5, 5, 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, 3, 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] [2025-03-08 02:09:30,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:09:30,094 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:30,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:30,095 INFO L85 PathProgramCache]: Analyzing trace with hash 507864755, now seen corresponding path program 1 times [2025-03-08 02:09:30,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:30,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217268414] [2025-03-08 02:09:30,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:30,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:30,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 722 statements into 1 equivalence classes. [2025-03-08 02:09:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 722 of 722 statements. [2025-03-08 02:09:30,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:30,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 511 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 02:09:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217268414] [2025-03-08 02:09:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217268414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128350574] [2025-03-08 02:09:30,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:30,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:30,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:30,742 INFO L87 Difference]: Start difference. First operand 86033 states and 91354 transitions. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:32,796 INFO L93 Difference]: Finished difference Result 103089 states and 109271 transitions. [2025-03-08 02:09:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 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 722 [2025-03-08 02:09:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:32,899 INFO L225 Difference]: With dead ends: 103089 [2025-03-08 02:09:32,899 INFO L226 Difference]: Without dead ends: 102662 [2025-03-08 02:09:32,911 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-08 02:09:32,912 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 833 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:32,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 118 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:09:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102662 states. [2025-03-08 02:09:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102662 to 86033. [2025-03-08 02:09:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86033 states, 86032 states have (on average 1.0618025850846198) internal successors, (91349), 86032 states have internal predecessors, (91349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86033 states to 86033 states and 91349 transitions. [2025-03-08 02:09:33,788 INFO L78 Accepts]: Start accepts. Automaton has 86033 states and 91349 transitions. Word has length 722 [2025-03-08 02:09:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:33,788 INFO L471 AbstractCegarLoop]: Abstraction has 86033 states and 91349 transitions. [2025-03-08 02:09:33,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 86033 states and 91349 transitions. [2025-03-08 02:09:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-08 02:09:33,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:33,816 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 02:09:33,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:09:33,816 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:33,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2016324354, now seen corresponding path program 1 times [2025-03-08 02:09:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:33,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353993150] [2025-03-08 02:09:33,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:33,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:33,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-08 02:09:33,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-08 02:09:33,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:33,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:09:34,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:34,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353993150] [2025-03-08 02:09:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353993150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978947949] [2025-03-08 02:09:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:34,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:34,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:34,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:34,314 INFO L87 Difference]: Start difference. First operand 86033 states and 91349 transitions. Second operand has 4 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:36,518 INFO L93 Difference]: Finished difference Result 191240 states and 202558 transitions. [2025-03-08 02:09:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:36,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 752 [2025-03-08 02:09:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:36,628 INFO L225 Difference]: With dead ends: 191240 [2025-03-08 02:09:36,628 INFO L226 Difference]: Without dead ends: 104359 [2025-03-08 02:09:36,661 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-08 02:09:36,662 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 710 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:36,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 102 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:09:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104359 states. [2025-03-08 02:09:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104359 to 94962. [2025-03-08 02:09:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94962 states, 94961 states have (on average 1.0588873326944745) internal successors, (100553), 94961 states have internal predecessors, (100553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94962 states to 94962 states and 100553 transitions. [2025-03-08 02:09:37,696 INFO L78 Accepts]: Start accepts. Automaton has 94962 states and 100553 transitions. Word has length 752 [2025-03-08 02:09:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:37,696 INFO L471 AbstractCegarLoop]: Abstraction has 94962 states and 100553 transitions. [2025-03-08 02:09:37,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 94962 states and 100553 transitions. [2025-03-08 02:09:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2025-03-08 02:09:37,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:37,721 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:37,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:09:37,721 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:37,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2020566807, now seen corresponding path program 1 times [2025-03-08 02:09:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:37,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191436308] [2025-03-08 02:09:37,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:37,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-03-08 02:09:37,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-03-08 02:09:37,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:37,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 837 proven. 80 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 02:09:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191436308] [2025-03-08 02:09:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191436308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362090477] [2025-03-08 02:09:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:38,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:38,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:38,961 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-08 02:09:38,962 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-08 02:09:39,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes. [2025-03-08 02:09:39,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements. [2025-03-08 02:09:39,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:39,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:39,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:09:39,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-08 02:09:39,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:09:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362090477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:09:39,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:09:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173231802] [2025-03-08 02:09:39,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:39,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:39,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:39,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:39,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:09:39,216 INFO L87 Difference]: Start difference. First operand 94962 states and 100553 transitions. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:40,601 INFO L93 Difference]: Finished difference Result 190349 states and 201486 transitions. [2025-03-08 02:09:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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 780 [2025-03-08 02:09:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:40,698 INFO L225 Difference]: With dead ends: 190349 [2025-03-08 02:09:40,698 INFO L226 Difference]: Without dead ends: 95389 [2025-03-08 02:09:40,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 780 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:09:40,739 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 438 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:40,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 298 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95389 states. [2025-03-08 02:09:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95389 to 92409. [2025-03-08 02:09:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92409 states, 92408 states have (on average 1.0571811964332092) internal successors, (97692), 92408 states have internal predecessors, (97692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92409 states to 92409 states and 97692 transitions. [2025-03-08 02:09:41,753 INFO L78 Accepts]: Start accepts. Automaton has 92409 states and 97692 transitions. Word has length 780 [2025-03-08 02:09:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 92409 states and 97692 transitions. [2025-03-08 02:09:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 92409 states and 97692 transitions. [2025-03-08 02:09:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2025-03-08 02:09:41,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:41,781 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:41,788 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-08 02:09:41,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:41,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:41,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -566537258, now seen corresponding path program 1 times [2025-03-08 02:09:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721743628] [2025-03-08 02:09:41,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:42,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 846 statements into 1 equivalence classes. [2025-03-08 02:09:42,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 846 of 846 statements. [2025-03-08 02:09:42,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:42,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 139 proven. 85 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2025-03-08 02:09:42,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:42,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721743628] [2025-03-08 02:09:42,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721743628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:42,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480067430] [2025-03-08 02:09:42,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:42,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:42,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:42,807 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-08 02:09:42,808 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-08 02:09:42,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 846 statements into 1 equivalence classes. [2025-03-08 02:09:43,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 846 of 846 statements. [2025-03-08 02:09:43,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:43,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:43,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:09:43,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2025-03-08 02:09:43,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:09:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480067430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:09:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:09:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534739736] [2025-03-08 02:09:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:43,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:43,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:43,120 INFO L87 Difference]: Start difference. First operand 92409 states and 97692 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:44,722 INFO L93 Difference]: Finished difference Result 196734 states and 207897 transitions. [2025-03-08 02:09:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:44,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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 846 [2025-03-08 02:09:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:44,843 INFO L225 Difference]: With dead ends: 196734 [2025-03-08 02:09:44,843 INFO L226 Difference]: Without dead ends: 103902 [2025-03-08 02:09:44,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:44,899 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 441 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:44,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 136 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:09:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103902 states. [2025-03-08 02:09:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103902 to 97934. [2025-03-08 02:09:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97934 states, 97933 states have (on average 1.0575801823695792) internal successors, (103572), 97933 states have internal predecessors, (103572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97934 states to 97934 states and 103572 transitions. [2025-03-08 02:09:46,199 INFO L78 Accepts]: Start accepts. Automaton has 97934 states and 103572 transitions. Word has length 846 [2025-03-08 02:09:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:46,199 INFO L471 AbstractCegarLoop]: Abstraction has 97934 states and 103572 transitions. [2025-03-08 02:09:46,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 97934 states and 103572 transitions. [2025-03-08 02:09:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-03-08 02:09:46,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:46,233 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:46,240 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-08 02:09:46,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:46,434 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:46,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -255870018, now seen corresponding path program 1 times [2025-03-08 02:09:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358048627] [2025-03-08 02:09:46,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:46,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-03-08 02:09:46,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-03-08 02:09:46,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:46,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 1076 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-08 02:09:46,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:46,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358048627] [2025-03-08 02:09:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358048627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710731159] [2025-03-08 02:09:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:46,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:46,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:46,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:46,909 INFO L87 Difference]: Start difference. First operand 97934 states and 103572 transitions. Second operand has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:48,886 INFO L93 Difference]: Finished difference Result 201405 states and 212896 transitions. [2025-03-08 02:09:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:48,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 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 915 [2025-03-08 02:09:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:48,989 INFO L225 Difference]: With dead ends: 201405 [2025-03-08 02:09:48,989 INFO L226 Difference]: Without dead ends: 103473 [2025-03-08 02:09:49,009 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-08 02:09:49,010 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 790 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:49,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 208 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103473 states. [2025-03-08 02:09:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103473 to 93243. [2025-03-08 02:09:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93243 states, 93242 states have (on average 1.055822483430214) internal successors, (98447), 93242 states have internal predecessors, (98447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93243 states to 93243 states and 98447 transitions. [2025-03-08 02:09:50,093 INFO L78 Accepts]: Start accepts. Automaton has 93243 states and 98447 transitions. Word has length 915 [2025-03-08 02:09:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:50,093 INFO L471 AbstractCegarLoop]: Abstraction has 93243 states and 98447 transitions. [2025-03-08 02:09:50,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 93243 states and 98447 transitions. [2025-03-08 02:09:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-03-08 02:09:50,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:50,140 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:50,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:09:50,140 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:50,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -63070598, now seen corresponding path program 1 times [2025-03-08 02:09:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:50,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322539849] [2025-03-08 02:09:50,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:50,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:50,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-08 02:09:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-08 02:09:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 1088 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2025-03-08 02:09:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322539849] [2025-03-08 02:09:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322539849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:50,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:50,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:50,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707285760] [2025-03-08 02:09:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:50,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:50,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:50,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:50,781 INFO L87 Difference]: Start difference. First operand 93243 states and 98447 transitions. Second operand has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:52,923 INFO L93 Difference]: Finished difference Result 192891 states and 203557 transitions. [2025-03-08 02:09:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 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 921 [2025-03-08 02:09:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:53,017 INFO L225 Difference]: With dead ends: 192891 [2025-03-08 02:09:53,017 INFO L226 Difference]: Without dead ends: 99650 [2025-03-08 02:09:53,047 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-08 02:09:53,048 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 777 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:53,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 661 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:09:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99650 states. [2025-03-08 02:09:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99650 to 93243. [2025-03-08 02:09:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93243 states, 93242 states have (on average 1.0556508869393622) internal successors, (98431), 93242 states have internal predecessors, (98431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93243 states to 93243 states and 98431 transitions. [2025-03-08 02:09:54,002 INFO L78 Accepts]: Start accepts. Automaton has 93243 states and 98431 transitions. Word has length 921 [2025-03-08 02:09:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:54,003 INFO L471 AbstractCegarLoop]: Abstraction has 93243 states and 98431 transitions. [2025-03-08 02:09:54,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 93243 states and 98431 transitions. [2025-03-08 02:09:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2025-03-08 02:09:54,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:54,037 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:09:54,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:09:54,037 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:54,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash 73525175, now seen corresponding path program 1 times [2025-03-08 02:09:54,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:54,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364555886] [2025-03-08 02:09:54,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:54,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 947 statements into 1 equivalence classes. [2025-03-08 02:09:54,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 947 of 947 statements. [2025-03-08 02:09:54,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-03-08 02:09:54,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:54,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364555886] [2025-03-08 02:09:54,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364555886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:54,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:54,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859858800] [2025-03-08 02:09:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:54,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:54,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:54,464 INFO L87 Difference]: Start difference. First operand 93243 states and 98431 transitions. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:55,698 INFO L93 Difference]: Finished difference Result 189870 states and 200539 transitions. [2025-03-08 02:09:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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 947 [2025-03-08 02:09:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:55,794 INFO L225 Difference]: With dead ends: 189870 [2025-03-08 02:09:55,794 INFO L226 Difference]: Without dead ends: 95354 [2025-03-08 02:09:55,846 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-08 02:09:55,847 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 140 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:55,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 556 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:09:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95354 states. [2025-03-08 02:09:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95354 to 90679. [2025-03-08 02:09:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90679 states, 90678 states have (on average 1.0534418491806172) internal successors, (95524), 90678 states have internal predecessors, (95524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90679 states to 90679 states and 95524 transitions. [2025-03-08 02:09:57,029 INFO L78 Accepts]: Start accepts. Automaton has 90679 states and 95524 transitions. Word has length 947 [2025-03-08 02:09:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:57,029 INFO L471 AbstractCegarLoop]: Abstraction has 90679 states and 95524 transitions. [2025-03-08 02:09:57,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 90679 states and 95524 transitions. [2025-03-08 02:09:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1009 [2025-03-08 02:09:57,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:57,090 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:57,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:09:57,090 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:57,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -665170574, now seen corresponding path program 1 times [2025-03-08 02:09:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:57,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660029000] [2025-03-08 02:09:57,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:57,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1008 statements into 1 equivalence classes. [2025-03-08 02:09:57,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1008 of 1008 statements. [2025-03-08 02:09:57,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:57,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2025-03-08 02:09:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660029000] [2025-03-08 02:09:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660029000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:57,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469796533] [2025-03-08 02:09:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:57,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:57,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:57,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:57,734 INFO L87 Difference]: Start difference. First operand 90679 states and 95524 transitions. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)