./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_label10.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 afd00c5a93002b45b7132abaca316e0e6d6e8def0f5c0ab18ec075bedc375e21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:57:48,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:57:48,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:57:48,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:57:48,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:57:48,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:57:48,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:57:48,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:57:48,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:57:48,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:57:48,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:57:48,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:57:48,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:57:48,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:57:48,472 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:57:48,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:57:48,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:57:48,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:57:48,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:57:48,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:57:48,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:57:48,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:57:48,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:57:48,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:57:48,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:57:48,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:57:48,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:57:48,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:57:48,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:57:48,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:57:48,474 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 -> afd00c5a93002b45b7132abaca316e0e6d6e8def0f5c0ab18ec075bedc375e21 [2025-03-03 10:57:48,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:57:48,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:57:48,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:57:48,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:57:48,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:57:48,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label10.c [2025-03-03 10:57:49,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ee6d4ac/a6517ff3dbc14b43bafc2eae50d65191/FLAGda1d59cf0 [2025-03-03 10:57:50,172 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:57:50,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label10.c [2025-03-03 10:57:50,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ee6d4ac/a6517ff3dbc14b43bafc2eae50d65191/FLAGda1d59cf0 [2025-03-03 10:57:50,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ee6d4ac/a6517ff3dbc14b43bafc2eae50d65191 [2025-03-03 10:57:50,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:57:50,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:57:50,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:57:50,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:57:50,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:57:50,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:50" (1/1) ... [2025-03-03 10:57:50,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7533a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:50, skipping insertion in model container [2025-03-03 10:57:50,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:50" (1/1) ... [2025-03-03 10:57:50,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:57:50,619 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_label10.c[5916,5929] [2025-03-03 10:57:50,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:57:50,954 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:57:50,996 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_label10.c[5916,5929] [2025-03-03 10:57:51,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:57:51,157 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:57:51,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51 WrapperNode [2025-03-03 10:57:51,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:57:51,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:57:51,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:57:51,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:57:51,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,390 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 10:57:51,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:57:51,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:57:51,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:57:51,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:57:51,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,574 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-03 10:57:51,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:57:51,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:57:51,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:57:51,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:57:51,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (1/1) ... [2025-03-03 10:57:51,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:57:51,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:57:51,783 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-03 10:57:51,786 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-03 10:57:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:57:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:57:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:57:51,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:57:51,853 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:57:51,855 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:57:54,349 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 10:57:54,533 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 10:57:54,533 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:57:54,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:57:54,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:57:54,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:54 BoogieIcfgContainer [2025-03-03 10:57:54,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:57:54,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:57:54,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:57:54,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:57:54,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:57:50" (1/3) ... [2025-03-03 10:57:54,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4a669d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:54, skipping insertion in model container [2025-03-03 10:57:54,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:51" (2/3) ... [2025-03-03 10:57:54,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4a669d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:54, skipping insertion in model container [2025-03-03 10:57:54,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:54" (3/3) ... [2025-03-03 10:57:54,581 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label10.c [2025-03-03 10:57:54,608 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:57:54,610 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label10.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:57:54,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:57:54,678 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;@6cbfd745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:57:54,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:57:54,685 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-03 10:57:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 10:57:54,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:54,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:54,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1652066212, now seen corresponding path program 1 times [2025-03-03 10:57:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171089814] [2025-03-03 10:57:54,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 10:57:54,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 10:57:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:54,956 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-03 10:57:54,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:54,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171089814] [2025-03-03 10:57:54,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171089814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:54,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:54,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653849541] [2025-03-03 10:57:54,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:54,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:54,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:54,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:54,981 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 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:56,949 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-03 10:57:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:56,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 10:57:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:56,962 INFO L225 Difference]: With dead ends: 1644 [2025-03-03 10:57:56,962 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 10:57:56,965 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-03 10:57:56,967 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 449 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:56,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:57:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 10:57:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-03 10:57:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-03 10:57:57,040 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 39 [2025-03-03 10:57:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:57,040 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-03 10:57:57,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-03 10:57:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 10:57:57,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:57,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:57:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:57:57,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:57,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1499467973, now seen corresponding path program 1 times [2025-03-03 10:57:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261750096] [2025-03-03 10:57:57,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:57,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 10:57:57,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 10:57:57,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:57,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:57,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261750096] [2025-03-03 10:57:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261750096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:57,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:57,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070071382] [2025-03-03 10:57:57,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:57,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:57,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:57,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:57,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:57,304 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:59,004 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-03-03 10:57:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-03 10:57:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:59,010 INFO L225 Difference]: With dead ends: 2813 [2025-03-03 10:57:59,010 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 10:57:59,011 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-03 10:57:59,012 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:59,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:57:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 10:57:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-03-03 10:57:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-03-03 10:57:59,081 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 106 [2025-03-03 10:57:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:59,084 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-03-03 10:57:59,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-03-03 10:57:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 10:57:59,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:59,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:57:59,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:57:59,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:59,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:59,087 INFO L85 PathProgramCache]: Analyzing trace with hash 673243763, now seen corresponding path program 1 times [2025-03-03 10:57:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:59,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475128224] [2025-03-03 10:57:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:59,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 10:57:59,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 10:57:59,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:59,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:59,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475128224] [2025-03-03 10:57:59,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475128224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:59,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:59,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939992307] [2025-03-03 10:57:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:59,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:59,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:59,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:59,316 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:00,928 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2025-03-03 10:58:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-03 10:58:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:00,936 INFO L225 Difference]: With dead ends: 4552 [2025-03-03 10:58:00,936 INFO L226 Difference]: Without dead ends: 2713 [2025-03-03 10:58:00,938 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-03 10:58:00,938 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 468 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:00,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 886 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:58:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-03-03 10:58:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2025-03-03 10:58:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.3003690036900368) internal successors, (3524), 2710 states have internal predecessors, (3524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3524 transitions. [2025-03-03 10:58:00,972 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3524 transitions. Word has length 109 [2025-03-03 10:58:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:00,972 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3524 transitions. [2025-03-03 10:58:00,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3524 transitions. [2025-03-03 10:58:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 10:58:00,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:00,977 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:58:00,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:58:00,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:00,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash -346050103, now seen corresponding path program 1 times [2025-03-03 10:58:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381155255] [2025-03-03 10:58:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:00,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 10:58:01,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 10:58:01,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:01,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:58:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:01,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381155255] [2025-03-03 10:58:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381155255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:01,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:58:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855436784] [2025-03-03 10:58:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:01,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:01,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:01,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:01,191 INFO L87 Difference]: Start difference. First operand 2711 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:02,492 INFO L93 Difference]: Finished difference Result 7984 states and 10361 transitions. [2025-03-03 10:58:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 178 [2025-03-03 10:58:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:02,503 INFO L225 Difference]: With dead ends: 7984 [2025-03-03 10:58:02,503 INFO L226 Difference]: Without dead ends: 4421 [2025-03-03 10:58:02,506 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-03 10:58:02,508 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:02,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:58:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-03-03 10:58:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3571. [2025-03-03 10:58:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3570 states have (on average 1.1775910364145659) internal successors, (4204), 3570 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4204 transitions. [2025-03-03 10:58:02,552 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4204 transitions. Word has length 178 [2025-03-03 10:58:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:02,553 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4204 transitions. [2025-03-03 10:58:02,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4204 transitions. [2025-03-03 10:58:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 10:58:02,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:02,556 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:58:02,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:58:02,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:02,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1516438327, now seen corresponding path program 1 times [2025-03-03 10:58:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:02,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500250286] [2025-03-03 10:58:02,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:02,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 10:58:02,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 10:58:02,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:02,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:58:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500250286] [2025-03-03 10:58:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500250286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:02,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577946888] [2025-03-03 10:58:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:02,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:02,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:02,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:02,845 INFO L87 Difference]: Start difference. First operand 3571 states and 4204 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:04,082 INFO L93 Difference]: Finished difference Result 9273 states and 11087 transitions. [2025-03-03 10:58:04,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:04,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2025-03-03 10:58:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:04,095 INFO L225 Difference]: With dead ends: 9273 [2025-03-03 10:58:04,095 INFO L226 Difference]: Without dead ends: 5704 [2025-03-03 10:58:04,097 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-03 10:58:04,098 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-03 10:58:04,098 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-03 10:58:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2025-03-03 10:58:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5704. [2025-03-03 10:58:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5704 states, 5703 states have (on average 1.1595651411537786) internal successors, (6613), 5703 states have internal predecessors, (6613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 6613 transitions. [2025-03-03 10:58:04,157 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 6613 transitions. Word has length 191 [2025-03-03 10:58:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:04,158 INFO L471 AbstractCegarLoop]: Abstraction has 5704 states and 6613 transitions. [2025-03-03 10:58:04,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 6613 transitions. [2025-03-03 10:58:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 10:58:04,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:04,159 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:58:04,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:58:04,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:04,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1803758524, now seen corresponding path program 1 times [2025-03-03 10:58:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:04,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127683871] [2025-03-03 10:58:04,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:04,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 10:58:04,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 10:58:04,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:04,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:58:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:04,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127683871] [2025-03-03 10:58:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127683871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421046821] [2025-03-03 10:58:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:04,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:04,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:04,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:04,289 INFO L87 Difference]: Start difference. First operand 5704 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:05,701 INFO L93 Difference]: Finished difference Result 14376 states and 16776 transitions. [2025-03-03 10:58:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 193 [2025-03-03 10:58:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:05,721 INFO L225 Difference]: With dead ends: 14376 [2025-03-03 10:58:05,722 INFO L226 Difference]: Without dead ends: 8673 [2025-03-03 10:58:05,727 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-03 10:58:05,728 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 412 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 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-03 10:58:05,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:58:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8673 states. [2025-03-03 10:58:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8673 to 5677. [2025-03-03 10:58:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5676 states have (on average 1.1578576462297392) internal successors, (6572), 5676 states have internal predecessors, (6572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 6572 transitions. [2025-03-03 10:58:05,811 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 6572 transitions. Word has length 193 [2025-03-03 10:58:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:05,812 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 6572 transitions. [2025-03-03 10:58:05,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 6572 transitions. [2025-03-03 10:58:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 10:58:05,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:05,814 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:05,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:58:05,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:05,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1116278886, now seen corresponding path program 1 times [2025-03-03 10:58:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542517732] [2025-03-03 10:58:05,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:05,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 10:58:05,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 10:58:05,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:58:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542517732] [2025-03-03 10:58:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542517732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381779697] [2025-03-03 10:58:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:06,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:06,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:06,127 INFO L87 Difference]: Start difference. First operand 5677 states and 6572 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:07,444 INFO L93 Difference]: Finished difference Result 13937 states and 16239 transitions. [2025-03-03 10:58:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 271 [2025-03-03 10:58:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:07,462 INFO L225 Difference]: With dead ends: 13937 [2025-03-03 10:58:07,462 INFO L226 Difference]: Without dead ends: 7834 [2025-03-03 10:58:07,465 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-03 10:58:07,465 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 495 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:07,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 630 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:58:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2025-03-03 10:58:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 7402. [2025-03-03 10:58:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7402 states, 7401 states have (on average 1.1638967707066612) internal successors, (8614), 7401 states have internal predecessors, (8614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 8614 transitions. [2025-03-03 10:58:07,530 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 8614 transitions. Word has length 271 [2025-03-03 10:58:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:07,530 INFO L471 AbstractCegarLoop]: Abstraction has 7402 states and 8614 transitions. [2025-03-03 10:58:07,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 8614 transitions. [2025-03-03 10:58:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 10:58:07,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:07,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:07,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:58:07,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1880159335, now seen corresponding path program 1 times [2025-03-03 10:58:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905389555] [2025-03-03 10:58:07,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:07,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 10:58:07,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 10:58:07,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:07,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:58:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905389555] [2025-03-03 10:58:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905389555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896760531] [2025-03-03 10:58:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:07,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:07,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:07,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:07,674 INFO L87 Difference]: Start difference. First operand 7402 states and 8614 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:09,057 INFO L93 Difference]: Finished difference Result 19038 states and 22311 transitions. [2025-03-03 10:58:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-03-03 10:58:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:09,080 INFO L225 Difference]: With dead ends: 19038 [2025-03-03 10:58:09,080 INFO L226 Difference]: Without dead ends: 11213 [2025-03-03 10:58:09,087 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-03 10:58:09,087 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 379 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:09,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 842 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:58:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11213 states. [2025-03-03 10:58:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11213 to 10363. [2025-03-03 10:58:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10363 states, 10362 states have (on average 1.132117351862575) internal successors, (11731), 10362 states have internal predecessors, (11731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 11731 transitions. [2025-03-03 10:58:09,178 INFO L78 Accepts]: Start accepts. Automaton has 10363 states and 11731 transitions. Word has length 276 [2025-03-03 10:58:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:09,179 INFO L471 AbstractCegarLoop]: Abstraction has 10363 states and 11731 transitions. [2025-03-03 10:58:09,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 10363 states and 11731 transitions. [2025-03-03 10:58:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 10:58:09,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:09,182 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:09,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:58:09,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1210789055, now seen corresponding path program 1 times [2025-03-03 10:58:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039154145] [2025-03-03 10:58:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:09,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 10:58:09,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 10:58:09,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:58:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039154145] [2025-03-03 10:58:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039154145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:09,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44319872] [2025-03-03 10:58:09,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:09,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:09,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:09,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:09,512 INFO L87 Difference]: Start difference. First operand 10363 states and 11731 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:10,748 INFO L93 Difference]: Finished difference Result 24567 states and 27907 transitions. [2025-03-03 10:58:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2025-03-03 10:58:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:10,768 INFO L225 Difference]: With dead ends: 24567 [2025-03-03 10:58:10,768 INFO L226 Difference]: Without dead ends: 13774 [2025-03-03 10:58:10,776 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-03 10:58:10,777 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 444 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:10,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 296 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13774 states. [2025-03-03 10:58:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13774 to 12918. [2025-03-03 10:58:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12918 states, 12917 states have (on average 1.1388867384067507) internal successors, (14711), 12917 states have internal predecessors, (14711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12918 states to 12918 states and 14711 transitions. [2025-03-03 10:58:10,884 INFO L78 Accepts]: Start accepts. Automaton has 12918 states and 14711 transitions. Word has length 294 [2025-03-03 10:58:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:10,884 INFO L471 AbstractCegarLoop]: Abstraction has 12918 states and 14711 transitions. [2025-03-03 10:58:10,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 12918 states and 14711 transitions. [2025-03-03 10:58:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-03 10:58:10,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:10,925 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 10:58:10,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:58:10,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash -327402092, now seen corresponding path program 1 times [2025-03-03 10:58:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:10,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712002682] [2025-03-03 10:58:10,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:10,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-03 10:58:10,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-03 10:58:10,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:10,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:58:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712002682] [2025-03-03 10:58:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712002682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:11,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:11,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:58:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688401635] [2025-03-03 10:58:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:11,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:11,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:58:11,212 INFO L87 Difference]: Start difference. First operand 12918 states and 14711 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:13,473 INFO L93 Difference]: Finished difference Result 46351 states and 52889 transitions. [2025-03-03 10:58:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 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 299 [2025-03-03 10:58:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:13,519 INFO L225 Difference]: With dead ends: 46351 [2025-03-03 10:58:13,520 INFO L226 Difference]: Without dead ends: 31718 [2025-03-03 10:58:13,527 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-03 10:58:13,528 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 876 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:13,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 336 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:58:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31718 states. [2025-03-03 10:58:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31718 to 31245. [2025-03-03 10:58:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31245 states, 31244 states have (on average 1.1159582639866854) internal successors, (34867), 31244 states have internal predecessors, (34867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31245 states to 31245 states and 34867 transitions. [2025-03-03 10:58:13,790 INFO L78 Accepts]: Start accepts. Automaton has 31245 states and 34867 transitions. Word has length 299 [2025-03-03 10:58:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:13,791 INFO L471 AbstractCegarLoop]: Abstraction has 31245 states and 34867 transitions. [2025-03-03 10:58:13,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31245 states and 34867 transitions. [2025-03-03 10:58:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 10:58:13,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:13,795 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:13,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:58:13,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:13,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash -853961596, now seen corresponding path program 1 times [2025-03-03 10:58:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058836633] [2025-03-03 10:58:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:13,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 10:58:13,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 10:58:13,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:58:14,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058836633] [2025-03-03 10:58:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058836633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366405396] [2025-03-03 10:58:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:14,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:14,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:14,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:14,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:14,126 INFO L87 Difference]: Start difference. First operand 31245 states and 34867 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:15,316 INFO L93 Difference]: Finished difference Result 69313 states and 77444 transitions. [2025-03-03 10:58:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 351 [2025-03-03 10:58:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:15,359 INFO L225 Difference]: With dead ends: 69313 [2025-03-03 10:58:15,359 INFO L226 Difference]: Without dead ends: 37642 [2025-03-03 10:58:15,380 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-03 10:58:15,381 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 469 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:15,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 303 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:58:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2025-03-03 10:58:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 31246. [2025-03-03 10:58:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31246 states, 31245 states have (on average 1.1147063530164827) internal successors, (34829), 31245 states have internal predecessors, (34829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31246 states to 31246 states and 34829 transitions. [2025-03-03 10:58:15,757 INFO L78 Accepts]: Start accepts. Automaton has 31246 states and 34829 transitions. Word has length 351 [2025-03-03 10:58:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:15,758 INFO L471 AbstractCegarLoop]: Abstraction has 31246 states and 34829 transitions. [2025-03-03 10:58:15,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 31246 states and 34829 transitions. [2025-03-03 10:58:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-03 10:58:15,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:15,766 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 10:58:15,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:58:15,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:15,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928315, now seen corresponding path program 1 times [2025-03-03 10:58:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398904355] [2025-03-03 10:58:15,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:15,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-03 10:58:15,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-03 10:58:15,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:15,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 216 proven. 82 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 10:58:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398904355] [2025-03-03 10:58:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398904355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811054529] [2025-03-03 10:58:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:16,111 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-03 10:58:16,113 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-03 10:58:16,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-03 10:58:16,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-03 10:58:16,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:16,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:16,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:58:16,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 182 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:58:16,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:58:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:58:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811054529] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:17,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:58:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-03-03 10:58:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679492469] [2025-03-03 10:58:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:17,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:58:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:17,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:58:17,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:58:17,055 INFO L87 Difference]: Start difference. First operand 31246 states and 34829 transitions. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:19,651 INFO L93 Difference]: Finished difference Result 87178 states and 97114 transitions. [2025-03-03 10:58:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:58:19,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 380 [2025-03-03 10:58:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:19,709 INFO L225 Difference]: With dead ends: 87178 [2025-03-03 10:58:19,709 INFO L226 Difference]: Without dead ends: 55082 [2025-03-03 10:58:19,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 755 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-03 10:58:19,732 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1440 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:19,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 166 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:58:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55082 states. [2025-03-03 10:58:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55082 to 53364. [2025-03-03 10:58:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53364 states, 53363 states have (on average 1.095534359012799) internal successors, (58461), 53363 states have internal predecessors, (58461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53364 states to 53364 states and 58461 transitions. [2025-03-03 10:58:20,345 INFO L78 Accepts]: Start accepts. Automaton has 53364 states and 58461 transitions. Word has length 380 [2025-03-03 10:58:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:20,345 INFO L471 AbstractCegarLoop]: Abstraction has 53364 states and 58461 transitions. [2025-03-03 10:58:20,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 53364 states and 58461 transitions. [2025-03-03 10:58:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-03 10:58:20,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:20,353 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:20,360 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-03 10:58:20,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 10:58:20,554 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:20,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:20,554 INFO L85 PathProgramCache]: Analyzing trace with hash 873727801, now seen corresponding path program 1 times [2025-03-03 10:58:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:20,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632461722] [2025-03-03 10:58:20,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:20,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-03 10:58:20,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-03 10:58:20,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:20,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 10:58:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632461722] [2025-03-03 10:58:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632461722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:20,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913971419] [2025-03-03 10:58:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:20,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:20,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:20,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:20,853 INFO L87 Difference]: Start difference. First operand 53364 states and 58461 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:22,290 INFO L93 Difference]: Finished difference Result 120793 states and 132647 transitions. [2025-03-03 10:58:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 385 [2025-03-03 10:58:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:22,359 INFO L225 Difference]: With dead ends: 120793 [2025-03-03 10:58:22,359 INFO L226 Difference]: Without dead ends: 67431 [2025-03-03 10:58:22,531 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-03 10:58:22,532 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 399 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:22,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 336 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67431 states. [2025-03-03 10:58:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67431 to 66130. [2025-03-03 10:58:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66130 states, 66129 states have (on average 1.0861497981218526) internal successors, (71826), 66129 states have internal predecessors, (71826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66130 states to 66130 states and 71826 transitions. [2025-03-03 10:58:23,011 INFO L78 Accepts]: Start accepts. Automaton has 66130 states and 71826 transitions. Word has length 385 [2025-03-03 10:58:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:23,011 INFO L471 AbstractCegarLoop]: Abstraction has 66130 states and 71826 transitions. [2025-03-03 10:58:23,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 66130 states and 71826 transitions. [2025-03-03 10:58:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-03 10:58:23,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:23,017 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:58:23,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:58:23,017 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:23,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash 321106302, now seen corresponding path program 1 times [2025-03-03 10:58:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661825463] [2025-03-03 10:58:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:23,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-03 10:58:23,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-03 10:58:23,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:23,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 10:58:23,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661825463] [2025-03-03 10:58:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661825463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:23,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569810866] [2025-03-03 10:58:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:23,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:23,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:23,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:23,377 INFO L87 Difference]: Start difference. First operand 66130 states and 71826 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:24,956 INFO L93 Difference]: Finished difference Result 149747 states and 162577 transitions. [2025-03-03 10:58:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2025-03-03 10:58:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:25,027 INFO L225 Difference]: With dead ends: 149747 [2025-03-03 10:58:25,027 INFO L226 Difference]: Without dead ends: 83188 [2025-03-03 10:58:25,059 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-03 10:58:25,059 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 460 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:25,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 205 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83188 states. [2025-03-03 10:58:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83188 to 78039. [2025-03-03 10:58:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78039 states, 78038 states have (on average 1.0846510674286887) internal successors, (84644), 78038 states have internal predecessors, (84644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78039 states to 78039 states and 84644 transitions. [2025-03-03 10:58:25,721 INFO L78 Accepts]: Start accepts. Automaton has 78039 states and 84644 transitions. Word has length 402 [2025-03-03 10:58:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:25,721 INFO L471 AbstractCegarLoop]: Abstraction has 78039 states and 84644 transitions. [2025-03-03 10:58:25,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 78039 states and 84644 transitions. [2025-03-03 10:58:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-03-03 10:58:25,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:25,726 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-03 10:58:25,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:58:25,727 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:25,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1014404922, now seen corresponding path program 1 times [2025-03-03 10:58:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635248271] [2025-03-03 10:58:25,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:25,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-03 10:58:25,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-03 10:58:25,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:25,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 325 proven. 37 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:58:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635248271] [2025-03-03 10:58:26,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635248271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444686513] [2025-03-03 10:58:26,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:26,536 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-03 10:58:26,538 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-03 10:58:26,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-03 10:58:26,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-03 10:58:26,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:26,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:26,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:58:26,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 403 proven. 82 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-03 10:58:26,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:58:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 403 proven. 82 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-03 10:58:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444686513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:58:27,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:58:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-03 10:58:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365004109] [2025-03-03 10:58:27,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:58:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:58:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:27,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:58:27,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:58:27,532 INFO L87 Difference]: Start difference. First operand 78039 states and 84644 transitions. Second operand has 9 states, 9 states have (on average 81.55555555555556) internal successors, (734), 9 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:34,938 INFO L93 Difference]: Finished difference Result 203800 states and 220971 transitions. [2025-03-03 10:58:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 10:58:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 81.55555555555556) internal successors, (734), 9 states have internal predecessors, (734), 0 states have call successors, (0), 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 419 [2025-03-03 10:58:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:35,077 INFO L225 Difference]: With dead ends: 203800 [2025-03-03 10:58:35,077 INFO L226 Difference]: Without dead ends: 124061 [2025-03-03 10:58:35,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-03-03 10:58:35,131 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 6622 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 10451 mSolverCounterSat, 1290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6622 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 11741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1290 IncrementalHoareTripleChecker+Valid, 10451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:35,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6622 Valid, 341 Invalid, 11741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1290 Valid, 10451 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-03 10:58:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124061 states. [2025-03-03 10:58:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124061 to 101825. [2025-03-03 10:58:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101825 states, 101824 states have (on average 1.0732440289126335) internal successors, (109282), 101824 states have internal predecessors, (109282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101825 states to 101825 states and 109282 transitions. [2025-03-03 10:58:36,785 INFO L78 Accepts]: Start accepts. Automaton has 101825 states and 109282 transitions. Word has length 419 [2025-03-03 10:58:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:36,786 INFO L471 AbstractCegarLoop]: Abstraction has 101825 states and 109282 transitions. [2025-03-03 10:58:36,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.55555555555556) internal successors, (734), 9 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 101825 states and 109282 transitions. [2025-03-03 10:58:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-03 10:58:36,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:36,795 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:58:36,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:58:36,996 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,SelfDestructingSolverStorable14 [2025-03-03 10:58:36,996 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2016648441, now seen corresponding path program 1 times [2025-03-03 10:58:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192253457] [2025-03-03 10:58:36,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:37,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-03 10:58:37,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-03 10:58:37,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:37,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-03 10:58:37,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192253457] [2025-03-03 10:58:37,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192253457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:37,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:37,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457605438] [2025-03-03 10:58:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:37,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:37,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:37,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:37,342 INFO L87 Difference]: Start difference. First operand 101825 states and 109282 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:38,605 INFO L93 Difference]: Finished difference Result 200667 states and 215403 transitions. [2025-03-03 10:58:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 505 [2025-03-03 10:58:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:38,720 INFO L225 Difference]: With dead ends: 200667 [2025-03-03 10:58:38,720 INFO L226 Difference]: Without dead ends: 98844 [2025-03-03 10:58:38,781 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-03 10:58:38,781 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 443 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:38,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 684 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:58:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98844 states. [2025-03-03 10:58:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98844 to 97566. [2025-03-03 10:58:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97566 states, 97565 states have (on average 1.0615589606928715) internal successors, (103571), 97565 states have internal predecessors, (103571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97566 states to 97566 states and 103571 transitions. [2025-03-03 10:58:39,994 INFO L78 Accepts]: Start accepts. Automaton has 97566 states and 103571 transitions. Word has length 505 [2025-03-03 10:58:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:39,994 INFO L471 AbstractCegarLoop]: Abstraction has 97566 states and 103571 transitions. [2025-03-03 10:58:39,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 97566 states and 103571 transitions. [2025-03-03 10:58:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-03 10:58:40,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:40,010 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-03 10:58:40,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:58:40,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:40,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1110237908, now seen corresponding path program 1 times [2025-03-03 10:58:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:40,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191680571] [2025-03-03 10:58:40,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:40,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-03 10:58:40,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-03 10:58:40,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:40,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 10:58:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191680571] [2025-03-03 10:58:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191680571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:40,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:40,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:58:40,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504044252] [2025-03-03 10:58:40,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:40,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:40,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:40,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:40,262 INFO L87 Difference]: Start difference. First operand 97566 states and 103571 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-03 10:58:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:41,340 INFO L93 Difference]: Finished difference Result 187455 states and 199032 transitions. [2025-03-03 10:58:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:41,340 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 582 [2025-03-03 10:58:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:41,426 INFO L225 Difference]: With dead ends: 187455 [2025-03-03 10:58:41,426 INFO L226 Difference]: Without dead ends: 89890 [2025-03-03 10:58:41,467 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-03 10:58:41,468 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 585 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:41,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 83 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:58:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89890 states. [2025-03-03 10:58:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89890 to 89875. [2025-03-03 10:58:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89875 states, 89874 states have (on average 1.0615194605781428) internal successors, (95403), 89874 states have internal predecessors, (95403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89875 states to 89875 states and 95403 transitions. [2025-03-03 10:58:42,314 INFO L78 Accepts]: Start accepts. Automaton has 89875 states and 95403 transitions. Word has length 582 [2025-03-03 10:58:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:42,315 INFO L471 AbstractCegarLoop]: Abstraction has 89875 states and 95403 transitions. [2025-03-03 10:58:42,315 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-03 10:58:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 89875 states and 95403 transitions. [2025-03-03 10:58:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-03 10:58:42,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:42,529 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-03 10:58:42,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:58:42,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:42,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -392510708, now seen corresponding path program 1 times [2025-03-03 10:58:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156271199] [2025-03-03 10:58:42,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:42,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-03 10:58:42,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-03 10:58:42,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:42,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 384 proven. 260 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 10:58:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156271199] [2025-03-03 10:58:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156271199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28962616] [2025-03-03 10:58:43,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:43,309 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-03 10:58:43,310 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-03 10:58:43,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-03 10:58:43,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-03 10:58:43,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:43,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:43,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:58:43,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 10:58:43,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:58:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28962616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:43,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:58:43,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 10:58:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767968558] [2025-03-03 10:58:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:43,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:43,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:43,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:58:43,796 INFO L87 Difference]: Start difference. First operand 89875 states and 95403 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:45,885 INFO L93 Difference]: Finished difference Result 206985 states and 219432 transitions. [2025-03-03 10:58:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 592 [2025-03-03 10:58:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:46,007 INFO L225 Difference]: With dead ends: 206985 [2025-03-03 10:58:46,007 INFO L226 Difference]: Without dead ends: 117112 [2025-03-03 10:58:46,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 591 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-03 10:58:46,057 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 604 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:46,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 128 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:58:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117112 states. [2025-03-03 10:58:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117112 to 108601. [2025-03-03 10:58:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108601 states, 108600 states have (on average 1.0589779005524862) internal successors, (115005), 108600 states have internal predecessors, (115005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108601 states to 108601 states and 115005 transitions. [2025-03-03 10:58:47,364 INFO L78 Accepts]: Start accepts. Automaton has 108601 states and 115005 transitions. Word has length 592 [2025-03-03 10:58:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 108601 states and 115005 transitions. [2025-03-03 10:58:47,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 108601 states and 115005 transitions. [2025-03-03 10:58:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-03 10:58:47,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:47,379 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-03 10:58:47,385 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-03 10:58:47,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:58:47,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:47,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1057636204, now seen corresponding path program 1 times [2025-03-03 10:58:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:47,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348569275] [2025-03-03 10:58:47,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-03 10:58:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-03 10:58:47,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:47,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 10:58:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348569275] [2025-03-03 10:58:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348569275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:48,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427058802] [2025-03-03 10:58:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:48,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:48,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:48,134 INFO L87 Difference]: Start difference. First operand 108601 states and 115005 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-03 10:58:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:49,586 INFO L93 Difference]: Finished difference Result 218478 states and 231338 transitions. [2025-03-03 10:58:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:49,587 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 603 [2025-03-03 10:58:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:49,710 INFO L225 Difference]: With dead ends: 218478 [2025-03-03 10:58:49,710 INFO L226 Difference]: Without dead ends: 109879 [2025-03-03 10:58:49,929 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-03 10:58:49,929 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 94 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:49,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 754 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:58:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109879 states. [2025-03-03 10:58:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109879 to 109452. [2025-03-03 10:58:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109452 states, 109451 states have (on average 1.0578889183287499) internal successors, (115787), 109451 states have internal predecessors, (115787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109452 states to 109452 states and 115787 transitions. [2025-03-03 10:58:50,890 INFO L78 Accepts]: Start accepts. Automaton has 109452 states and 115787 transitions. Word has length 603 [2025-03-03 10:58:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:50,891 INFO L471 AbstractCegarLoop]: Abstraction has 109452 states and 115787 transitions. [2025-03-03 10:58:50,891 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-03 10:58:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 109452 states and 115787 transitions. [2025-03-03 10:58:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-03-03 10:58:50,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:50,908 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-03 10:58:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:58:50,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1146365249, now seen corresponding path program 1 times [2025-03-03 10:58:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37094748] [2025-03-03 10:58:50,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-03-03 10:58:50,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-03-03 10:58:50,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:50,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 10:58:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37094748] [2025-03-03 10:58:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37094748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:51,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:58:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896574331] [2025-03-03 10:58:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:51,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:51,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:51,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:58:51,466 INFO L87 Difference]: Start difference. First operand 109452 states and 115787 transitions. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:53,474 INFO L93 Difference]: Finished difference Result 124379 states and 131406 transitions. [2025-03-03 10:58:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:53,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 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 714 [2025-03-03 10:58:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:53,613 INFO L225 Difference]: With dead ends: 124379 [2025-03-03 10:58:53,613 INFO L226 Difference]: Without dead ends: 123952 [2025-03-03 10:58:53,648 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-03 10:58:53,649 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 858 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:53,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 133 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:58:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123952 states. [2025-03-03 10:58:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123952 to 109452. [2025-03-03 10:58:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109452 states, 109451 states have (on average 1.057815826260153) internal successors, (115779), 109451 states have internal predecessors, (115779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109452 states to 109452 states and 115779 transitions. [2025-03-03 10:58:54,955 INFO L78 Accepts]: Start accepts. Automaton has 109452 states and 115779 transitions. Word has length 714 [2025-03-03 10:58:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:54,955 INFO L471 AbstractCegarLoop]: Abstraction has 109452 states and 115779 transitions. [2025-03-03 10:58:54,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 109452 states and 115779 transitions. [2025-03-03 10:58:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 745 [2025-03-03 10:58:55,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:55,156 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-03 10:58:55,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:58:55,156 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:55,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash 407868554, now seen corresponding path program 1 times [2025-03-03 10:58:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011706545] [2025-03-03 10:58:55,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:55,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:55,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 744 statements into 1 equivalence classes. [2025-03-03 10:58:55,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 744 of 744 statements. [2025-03-03 10:58:55,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:55,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011706545] [2025-03-03 10:58:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011706545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:58:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460168206] [2025-03-03 10:58:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:55,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:55,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:58:55,611 INFO L87 Difference]: Start difference. First operand 109452 states and 115779 transitions. Second operand has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:57,826 INFO L93 Difference]: Finished difference Result 236797 states and 250042 transitions. [2025-03-03 10:58:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:57,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 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 744 [2025-03-03 10:58:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:57,968 INFO L225 Difference]: With dead ends: 236797 [2025-03-03 10:58:57,968 INFO L226 Difference]: Without dead ends: 126497 [2025-03-03 10:58:58,032 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-03 10:58:58,033 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 733 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:58,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 117 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:58:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126497 states. [2025-03-03 10:58:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126497 to 114130. [2025-03-03 10:58:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114130 states, 114129 states have (on average 1.0573211015605148) internal successors, (120671), 114129 states have internal predecessors, (120671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114130 states to 114130 states and 120671 transitions. [2025-03-03 10:58:59,355 INFO L78 Accepts]: Start accepts. Automaton has 114130 states and 120671 transitions. Word has length 744 [2025-03-03 10:58:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:59,356 INFO L471 AbstractCegarLoop]: Abstraction has 114130 states and 120671 transitions. [2025-03-03 10:58:59,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 114130 states and 120671 transitions. [2025-03-03 10:58:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-03-03 10:58:59,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:59,389 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:58:59,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:58:59,389 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:59,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1111746611, now seen corresponding path program 1 times [2025-03-03 10:58:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:59,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750499854] [2025-03-03 10:58:59,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:59,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:59,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-03-03 10:58:59,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-03-03 10:58:59,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:59,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-03 10:59:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:00,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750499854] [2025-03-03 10:59:00,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750499854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:00,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:59:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320781283] [2025-03-03 10:59:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:00,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:00,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:00,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:59:00,349 INFO L87 Difference]: Start difference. First operand 114130 states and 120671 transitions. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:02,559 INFO L93 Difference]: Finished difference Result 252973 states and 267067 transitions. [2025-03-03 10:59:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 754 [2025-03-03 10:59:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:02,728 INFO L225 Difference]: With dead ends: 252973 [2025-03-03 10:59:02,728 INFO L226 Difference]: Without dead ends: 138416 [2025-03-03 10:59:02,802 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-03 10:59:02,804 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 942 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:02,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 623 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2748 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:59:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138416 states. [2025-03-03 10:59:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138416 to 111997. [2025-03-03 10:59:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111997 states, 111996 states have (on average 1.0576181292189006) internal successors, (118449), 111996 states have internal predecessors, (118449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111997 states to 111997 states and 118449 transitions. [2025-03-03 10:59:04,349 INFO L78 Accepts]: Start accepts. Automaton has 111997 states and 118449 transitions. Word has length 754 [2025-03-03 10:59:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:04,350 INFO L471 AbstractCegarLoop]: Abstraction has 111997 states and 118449 transitions. [2025-03-03 10:59:04,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 111997 states and 118449 transitions. [2025-03-03 10:59:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-03-03 10:59:04,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:04,377 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:59:04,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:59:04,377 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1284314283, now seen corresponding path program 1 times [2025-03-03 10:59:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145286223] [2025-03-03 10:59:04,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:04,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-03-03 10:59:04,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-03-03 10:59:04,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:04,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 10:59:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145286223] [2025-03-03 10:59:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145286223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227875609] [2025-03-03 10:59:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:04,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:04,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:04,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:04,703 INFO L87 Difference]: Start difference. First operand 111997 states and 118449 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:06,062 INFO L93 Difference]: Finished difference Result 229543 states and 242842 transitions. [2025-03-03 10:59:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 809 [2025-03-03 10:59:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:06,465 INFO L225 Difference]: With dead ends: 229543 [2025-03-03 10:59:06,465 INFO L226 Difference]: Without dead ends: 117121 [2025-03-03 10:59:06,491 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-03 10:59:06,491 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 476 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:06,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 172 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:59:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117121 states. [2025-03-03 10:59:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117121 to 110717. [2025-03-03 10:59:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110717 states, 110716 states have (on average 1.0569384732107374) internal successors, (117020), 110716 states have internal predecessors, (117020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110717 states to 110717 states and 117020 transitions. [2025-03-03 10:59:07,651 INFO L78 Accepts]: Start accepts. Automaton has 110717 states and 117020 transitions. Word has length 809 [2025-03-03 10:59:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:07,652 INFO L471 AbstractCegarLoop]: Abstraction has 110717 states and 117020 transitions. [2025-03-03 10:59:07,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 110717 states and 117020 transitions. [2025-03-03 10:59:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-03-03 10:59:07,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:07,680 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-03 10:59:07,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:59:07,680 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:07,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1783814882, now seen corresponding path program 1 times [2025-03-03 10:59:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:07,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713465456] [2025-03-03 10:59:07,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:07,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-03-03 10:59:07,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-03-03 10:59:07,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2025-03-03 10:59:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713465456] [2025-03-03 10:59:07,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713465456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:07,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099908345] [2025-03-03 10:59:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:07,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:07,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:07,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:07,923 INFO L87 Difference]: Start difference. First operand 110717 states and 117020 transitions. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:09,387 INFO L93 Difference]: Finished difference Result 221859 states and 234457 transitions. [2025-03-03 10:59:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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 838 [2025-03-03 10:59:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:09,507 INFO L225 Difference]: With dead ends: 221859 [2025-03-03 10:59:09,507 INFO L226 Difference]: Without dead ends: 110719 [2025-03-03 10:59:09,568 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-03 10:59:09,568 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 399 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:09,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 310 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:59:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110719 states. [2025-03-03 10:59:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110719 to 106035. [2025-03-03 10:59:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106035 states, 106034 states have (on average 1.0566610709772337) internal successors, (112042), 106034 states have internal predecessors, (112042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106035 states to 106035 states and 112042 transitions. [2025-03-03 10:59:11,033 INFO L78 Accepts]: Start accepts. Automaton has 106035 states and 112042 transitions. Word has length 838 [2025-03-03 10:59:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:11,033 INFO L471 AbstractCegarLoop]: Abstraction has 106035 states and 112042 transitions. [2025-03-03 10:59:11,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 106035 states and 112042 transitions. [2025-03-03 10:59:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2025-03-03 10:59:11,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:11,083 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-03 10:59:11,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:59:11,084 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:11,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash -693397046, now seen corresponding path program 1 times [2025-03-03 10:59:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742144070] [2025-03-03 10:59:11,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 907 statements into 1 equivalence classes. [2025-03-03 10:59:11,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 907 of 907 statements. [2025-03-03 10:59:11,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:11,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat