./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label25.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 244b722e357e7e628c9da22f49af73d4219044ff60ec5c18a778f01607618372 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:18:05,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:18:05,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:18:05,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:18:05,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:18:05,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:18:05,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:18:05,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:18:05,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:18:05,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:18:05,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:18:05,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:18:05,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:18:05,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:18:05,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:18:05,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:18:05,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:18:05,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:18:05,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:18:05,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:18:05,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:18:05,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:18:05,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:18:05,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:18:05,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:18:05,573 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 -> 244b722e357e7e628c9da22f49af73d4219044ff60ec5c18a778f01607618372 [2025-03-16 15:18:05,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:18:05,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:18:05,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:18:05,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:18:05,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:18:05,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label25.c [2025-03-16 15:18:06,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dd40aaa/92320f0f6600455b8bbb5039cbd73791/FLAGdc1d062d0 [2025-03-16 15:18:07,335 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:18:07,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label25.c [2025-03-16 15:18:07,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dd40aaa/92320f0f6600455b8bbb5039cbd73791/FLAGdc1d062d0 [2025-03-16 15:18:07,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15dd40aaa/92320f0f6600455b8bbb5039cbd73791 [2025-03-16 15:18:07,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:18:07,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:18:07,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:18:07,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:18:07,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:18:07,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:18:07" (1/1) ... [2025-03-16 15:18:07,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:07, skipping insertion in model container [2025-03-16 15:18:07,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:18:07" (1/1) ... [2025-03-16 15:18:07,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:18:07,787 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_label25.c[3642,3655] [2025-03-16 15:18:08,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:18:08,206 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:18:08,222 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_label25.c[3642,3655] [2025-03-16 15:18:08,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:18:08,419 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:18:08,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08 WrapperNode [2025-03-16 15:18:08,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:18:08,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:18:08,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:18:08,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:18:08,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,653 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:18:08,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:18:08,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:18:08,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:18:08,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:18:08,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:18:08,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:08,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:09,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:09,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:09,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:18:09,069 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:18:09,069 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:18:09,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:18:09,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (1/1) ... [2025-03-16 15:18:09,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:18:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:18:09,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:18:09,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:18:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:18:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:18:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:18:09,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:18:09,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:18:09,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:18:11,788 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:18:11,957 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:18:11,958 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:18:11,981 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:18:11,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:18:11,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:18:11 BoogieIcfgContainer [2025-03-16 15:18:11,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:18:11,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:18:11,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:18:11,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:18:11,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:18:07" (1/3) ... [2025-03-16 15:18:11,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a90b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:18:11, skipping insertion in model container [2025-03-16 15:18:11,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:18:08" (2/3) ... [2025-03-16 15:18:11,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a90b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:18:11, skipping insertion in model container [2025-03-16 15:18:12,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:18:11" (3/3) ... [2025-03-16 15:18:12,000 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label25.c [2025-03-16 15:18:12,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:18:12,047 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label25.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:18:12,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:18:12,139 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;@3934011b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:18:12,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:18:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 15:18:12,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:12,151 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] [2025-03-16 15:18:12,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:12,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1545412651, now seen corresponding path program 1 times [2025-03-16 15:18:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484188127] [2025-03-16 15:18:12,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:12,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 15:18:12,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 15:18:12,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:12,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:12,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484188127] [2025-03-16 15:18:12,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484188127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:12,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:12,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:18:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100337184] [2025-03-16 15:18:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:18:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:12,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:18:12,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:18:12,300 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:12,350 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:18:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:18:12,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-16 15:18:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:12,363 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:18:12,364 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:18:12,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:18:12,370 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:12,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:18:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:18:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:18:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:18:12,434 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 22 [2025-03-16 15:18:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:12,434 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:18:12,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:18:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 15:18:12,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:12,435 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] [2025-03-16 15:18:12,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:18:12,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:12,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1410250071, now seen corresponding path program 1 times [2025-03-16 15:18:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293442266] [2025-03-16 15:18:12,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:12,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 15:18:12,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 15:18:12,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:12,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293442266] [2025-03-16 15:18:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293442266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:18:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351527908] [2025-03-16 15:18:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:12,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:12,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:12,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:12,590 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:14,539 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2025-03-16 15:18:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:14,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-16 15:18:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:14,543 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 15:18:14,543 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 15:18:14,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:14,545 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 449 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:14,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 449 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:18:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 15:18:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2025-03-16 15:18:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2025-03-16 15:18:14,583 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 22 [2025-03-16 15:18:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:14,583 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2025-03-16 15:18:14,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2025-03-16 15:18:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 15:18:14,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:14,585 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:18:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:18:14,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:14,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash 775063477, now seen corresponding path program 1 times [2025-03-16 15:18:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355955333] [2025-03-16 15:18:14,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:14,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 15:18:14,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 15:18:14,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:14,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355955333] [2025-03-16 15:18:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355955333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:18:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875915991] [2025-03-16 15:18:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:14,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:14,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:14,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:14,832 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:16,783 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2025-03-16 15:18:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:16,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 15:18:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:16,790 INFO L225 Difference]: With dead ends: 2812 [2025-03-16 15:18:16,791 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:18:16,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:16,796 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 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.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:16,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:18:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:18:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2025-03-16 15:18:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2025-03-16 15:18:16,844 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 89 [2025-03-16 15:18:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2025-03-16 15:18:16,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2025-03-16 15:18:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 15:18:16,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:16,850 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:18:16,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:18:16,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -545295295, now seen corresponding path program 1 times [2025-03-16 15:18:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606965697] [2025-03-16 15:18:16,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:16,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 15:18:16,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 15:18:16,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:16,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:17,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606965697] [2025-03-16 15:18:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606965697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:17,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212116747] [2025-03-16 15:18:17,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:17,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:17,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:17,033 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:18,749 INFO L93 Difference]: Finished difference Result 4551 states and 6281 transitions. [2025-03-16 15:18:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:18,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 15:18:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:18,758 INFO L225 Difference]: With dead ends: 4551 [2025-03-16 15:18:18,758 INFO L226 Difference]: Without dead ends: 2712 [2025-03-16 15:18:18,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:18,761 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 484 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 884 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.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:18,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 884 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:18:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-03-16 15:18:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2710. [2025-03-16 15:18:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.3004798818752308) internal successors, (3523), 2709 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3523 transitions. [2025-03-16 15:18:18,803 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3523 transitions. Word has length 92 [2025-03-16 15:18:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3523 transitions. [2025-03-16 15:18:18,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3523 transitions. [2025-03-16 15:18:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 15:18:18,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:18,806 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:18:18,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:18,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 878919650, now seen corresponding path program 1 times [2025-03-16 15:18:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399723028] [2025-03-16 15:18:18,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:18,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 15:18:18,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 15:18:18,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:18,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 15:18:18,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399723028] [2025-03-16 15:18:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399723028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:18:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642191487] [2025-03-16 15:18:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:18,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:19,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:19,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:19,000 INFO L87 Difference]: Start difference. First operand 2710 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:20,654 INFO L93 Difference]: Finished difference Result 7983 states and 10360 transitions. [2025-03-16 15:18:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:20,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 161 [2025-03-16 15:18:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:20,666 INFO L225 Difference]: With dead ends: 7983 [2025-03-16 15:18:20,666 INFO L226 Difference]: Without dead ends: 4420 [2025-03-16 15:18:20,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:20,670 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:20,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:18:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2025-03-16 15:18:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3570. [2025-03-16 15:18:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3569 states have (on average 1.177640795741104) internal successors, (4203), 3569 states have internal predecessors, (4203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 4203 transitions. [2025-03-16 15:18:20,717 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 4203 transitions. Word has length 161 [2025-03-16 15:18:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:20,717 INFO L471 AbstractCegarLoop]: Abstraction has 3570 states and 4203 transitions. [2025-03-16 15:18:20,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 4203 transitions. [2025-03-16 15:18:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 15:18:20,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:20,720 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:18:20,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 702451236, now seen corresponding path program 1 times [2025-03-16 15:18:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109313501] [2025-03-16 15:18:20,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:20,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 15:18:20,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 15:18:20,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:20,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109313501] [2025-03-16 15:18:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109313501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:21,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517245447] [2025-03-16 15:18:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:21,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:21,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:21,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:21,018 INFO L87 Difference]: Start difference. First operand 3570 states and 4203 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:22,305 INFO L93 Difference]: Finished difference Result 9272 states and 11086 transitions. [2025-03-16 15:18:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-03-16 15:18:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:22,321 INFO L225 Difference]: With dead ends: 9272 [2025-03-16 15:18:22,321 INFO L226 Difference]: Without dead ends: 5703 [2025-03-16 15:18:22,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:22,328 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:22,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:18:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2025-03-16 15:18:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5703. [2025-03-16 15:18:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 5702 states have (on average 1.1595931252192213) internal successors, (6612), 5702 states have internal predecessors, (6612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 6612 transitions. [2025-03-16 15:18:22,419 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 6612 transitions. Word has length 174 [2025-03-16 15:18:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:22,420 INFO L471 AbstractCegarLoop]: Abstraction has 5703 states and 6612 transitions. [2025-03-16 15:18:22,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 6612 transitions. [2025-03-16 15:18:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 15:18:22,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:22,421 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:22,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:18:22,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:22,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash 316934761, now seen corresponding path program 1 times [2025-03-16 15:18:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172705241] [2025-03-16 15:18:22,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:22,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 15:18:22,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 15:18:22,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:22,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:18:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172705241] [2025-03-16 15:18:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172705241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:22,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208670284] [2025-03-16 15:18:22,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:22,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:22,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:22,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:22,551 INFO L87 Difference]: Start difference. First operand 5703 states and 6612 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:23,919 INFO L93 Difference]: Finished difference Result 14375 states and 16775 transitions. [2025-03-16 15:18:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:23,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-03-16 15:18:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:23,936 INFO L225 Difference]: With dead ends: 14375 [2025-03-16 15:18:23,936 INFO L226 Difference]: Without dead ends: 8672 [2025-03-16 15:18:23,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:23,941 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 427 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:23,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:18:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2025-03-16 15:18:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 5676. [2025-03-16 15:18:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 5675 states have (on average 1.157885462555066) internal successors, (6571), 5675 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 6571 transitions. [2025-03-16 15:18:24,018 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 6571 transitions. Word has length 176 [2025-03-16 15:18:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:24,019 INFO L471 AbstractCegarLoop]: Abstraction has 5676 states and 6571 transitions. [2025-03-16 15:18:24,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 6571 transitions. [2025-03-16 15:18:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 15:18:24,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:24,021 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:24,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:18:24,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:24,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash 587653606, now seen corresponding path program 1 times [2025-03-16 15:18:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:24,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888856833] [2025-03-16 15:18:24,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:24,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 15:18:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 15:18:24,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:24,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-16 15:18:24,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888856833] [2025-03-16 15:18:24,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888856833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:24,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:24,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727012466] [2025-03-16 15:18:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:24,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:24,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:24,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:24,200 INFO L87 Difference]: Start difference. First operand 5676 states and 6571 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:25,733 INFO L93 Difference]: Finished difference Result 14314 states and 16679 transitions. [2025-03-16 15:18:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 254 [2025-03-16 15:18:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:25,753 INFO L225 Difference]: With dead ends: 14314 [2025-03-16 15:18:25,753 INFO L226 Difference]: Without dead ends: 7789 [2025-03-16 15:18:25,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:25,760 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:25,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 845 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:18:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7789 states. [2025-03-16 15:18:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7789 to 7789. [2025-03-16 15:18:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7789 states, 7788 states have (on average 1.11864406779661) internal successors, (8712), 7788 states have internal predecessors, (8712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 8712 transitions. [2025-03-16 15:18:25,867 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 8712 transitions. Word has length 254 [2025-03-16 15:18:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:25,868 INFO L471 AbstractCegarLoop]: Abstraction has 7789 states and 8712 transitions. [2025-03-16 15:18:25,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 8712 transitions. [2025-03-16 15:18:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 15:18:25,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:25,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:18:25,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:18:25,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:25,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1476587485, now seen corresponding path program 1 times [2025-03-16 15:18:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618481834] [2025-03-16 15:18:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:25,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 15:18:25,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 15:18:25,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:25,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:18:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618481834] [2025-03-16 15:18:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618481834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:26,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:26,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214649138] [2025-03-16 15:18:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:26,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:26,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:26,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:26,016 INFO L87 Difference]: Start difference. First operand 7789 states and 8712 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:27,385 INFO L93 Difference]: Finished difference Result 18557 states and 20948 transitions. [2025-03-16 15:18:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:27,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2025-03-16 15:18:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:27,407 INFO L225 Difference]: With dead ends: 18557 [2025-03-16 15:18:27,407 INFO L226 Difference]: Without dead ends: 10769 [2025-03-16 15:18:27,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:27,415 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 481 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:27,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 330 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:18:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10769 states. [2025-03-16 15:18:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10769 to 9915. [2025-03-16 15:18:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9915 states, 9914 states have (on average 1.1232600363122855) internal successors, (11136), 9914 states have internal predecessors, (11136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9915 states to 9915 states and 11136 transitions. [2025-03-16 15:18:27,510 INFO L78 Accepts]: Start accepts. Automaton has 9915 states and 11136 transitions. Word has length 294 [2025-03-16 15:18:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:27,510 INFO L471 AbstractCegarLoop]: Abstraction has 9915 states and 11136 transitions. [2025-03-16 15:18:27,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9915 states and 11136 transitions. [2025-03-16 15:18:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-16 15:18:27,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:27,515 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:27,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:18:27,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:27,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash -221560488, now seen corresponding path program 1 times [2025-03-16 15:18:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:27,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028887528] [2025-03-16 15:18:27,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:27,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-16 15:18:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-16 15:18:27,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:27,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028887528] [2025-03-16 15:18:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028887528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:18:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322617532] [2025-03-16 15:18:28,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:28,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:18:28,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:18:28,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:18:28,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:18:28,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-16 15:18:28,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-16 15:18:28,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:28,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:28,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:18:28,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:18:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:28,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:18:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322617532] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:18:28,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:18:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-03-16 15:18:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496000496] [2025-03-16 15:18:28,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:28,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:18:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:28,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:18:28,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:18:28,922 INFO L87 Difference]: Start difference. First operand 9915 states and 11136 transitions. Second operand has 5 states, 5 states have (on average 62.2) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:31,996 INFO L93 Difference]: Finished difference Result 32642 states and 37071 transitions. [2025-03-16 15:18:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:18:31,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 62.2) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2025-03-16 15:18:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:32,035 INFO L225 Difference]: With dead ends: 32642 [2025-03-16 15:18:32,035 INFO L226 Difference]: Without dead ends: 22299 [2025-03-16 15:18:32,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 617 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-16 15:18:32,042 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1233 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 3261 mSolverCounterSat, 768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 4029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 768 IncrementalHoareTripleChecker+Valid, 3261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:32,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 238 Invalid, 4029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [768 Valid, 3261 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:18:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22299 states. [2025-03-16 15:18:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22299 to 20169. [2025-03-16 15:18:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20169 states, 20168 states have (on average 1.130999603332011) internal successors, (22810), 20168 states have internal predecessors, (22810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 22810 transitions. [2025-03-16 15:18:32,225 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 22810 transitions. Word has length 311 [2025-03-16 15:18:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:32,226 INFO L471 AbstractCegarLoop]: Abstraction has 20169 states and 22810 transitions. [2025-03-16 15:18:32,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.2) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 22810 transitions. [2025-03-16 15:18:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-16 15:18:32,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:32,230 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:18:32,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:18:32,431 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,SelfDestructingSolverStorable9 [2025-03-16 15:18:32,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 72998642, now seen corresponding path program 1 times [2025-03-16 15:18:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637074589] [2025-03-16 15:18:32,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:32,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-16 15:18:32,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-16 15:18:32,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:32,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:18:32,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:32,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637074589] [2025-03-16 15:18:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637074589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399015645] [2025-03-16 15:18:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:32,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:32,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:32,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:32,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:32,816 INFO L87 Difference]: Start difference. First operand 20169 states and 22810 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:34,707 INFO L93 Difference]: Finished difference Result 49720 states and 56258 transitions. [2025-03-16 15:18:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2025-03-16 15:18:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:34,748 INFO L225 Difference]: With dead ends: 49720 [2025-03-16 15:18:34,748 INFO L226 Difference]: Without dead ends: 29552 [2025-03-16 15:18:34,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:34,766 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 435 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:34,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 878 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:18:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29552 states. [2025-03-16 15:18:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29552 to 27407. [2025-03-16 15:18:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27407 states, 27406 states have (on average 1.1210318908268262) internal successors, (30723), 27406 states have internal predecessors, (30723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27407 states to 27407 states and 30723 transitions. [2025-03-16 15:18:35,083 INFO L78 Accepts]: Start accepts. Automaton has 27407 states and 30723 transitions. Word has length 334 [2025-03-16 15:18:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:35,083 INFO L471 AbstractCegarLoop]: Abstraction has 27407 states and 30723 transitions. [2025-03-16 15:18:35,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27407 states and 30723 transitions. [2025-03-16 15:18:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-16 15:18:35,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:35,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:18:35,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:18:35,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash -546862918, now seen corresponding path program 1 times [2025-03-16 15:18:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516501060] [2025-03-16 15:18:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-16 15:18:35,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-16 15:18:35,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:35,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:18:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:35,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516501060] [2025-03-16 15:18:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516501060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:35,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100567748] [2025-03-16 15:18:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:35,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:35,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:35,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:35,270 INFO L87 Difference]: Start difference. First operand 27407 states and 30723 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:36,933 INFO L93 Difference]: Finished difference Result 68023 states and 76174 transitions. [2025-03-16 15:18:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:36,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 382 [2025-03-16 15:18:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:36,981 INFO L225 Difference]: With dead ends: 68023 [2025-03-16 15:18:36,981 INFO L226 Difference]: Without dead ends: 40617 [2025-03-16 15:18:37,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:37,003 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 421 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:37,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 754 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:18:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40617 states. [2025-03-16 15:18:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40617 to 37614. [2025-03-16 15:18:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37614 states, 37613 states have (on average 1.1138967910031106) internal successors, (41897), 37613 states have internal predecessors, (41897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37614 states to 37614 states and 41897 transitions. [2025-03-16 15:18:37,394 INFO L78 Accepts]: Start accepts. Automaton has 37614 states and 41897 transitions. Word has length 382 [2025-03-16 15:18:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:37,394 INFO L471 AbstractCegarLoop]: Abstraction has 37614 states and 41897 transitions. [2025-03-16 15:18:37,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 37614 states and 41897 transitions. [2025-03-16 15:18:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-16 15:18:37,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:37,400 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:18:37,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:18:37,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1546025984, now seen corresponding path program 1 times [2025-03-16 15:18:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410014027] [2025-03-16 15:18:37,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:37,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 15:18:37,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 15:18:37,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:37,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:37,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410014027] [2025-03-16 15:18:37,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410014027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:37,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:37,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:18:37,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182195524] [2025-03-16 15:18:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:37,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:18:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:37,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:18:37,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:37,876 INFO L87 Difference]: Start difference. First operand 37614 states and 41897 transitions. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:40,171 INFO L93 Difference]: Finished difference Result 99094 states and 109990 transitions. [2025-03-16 15:18:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:18:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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 404 [2025-03-16 15:18:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:40,238 INFO L225 Difference]: With dead ends: 99094 [2025-03-16 15:18:40,238 INFO L226 Difference]: Without dead ends: 61481 [2025-03-16 15:18:40,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:40,266 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 731 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:40,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 176 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:18:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61481 states. [2025-03-16 15:18:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61481 to 56362. [2025-03-16 15:18:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56362 states, 56361 states have (on average 1.1103600007097105) internal successors, (62581), 56361 states have internal predecessors, (62581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56362 states to 56362 states and 62581 transitions. [2025-03-16 15:18:40,943 INFO L78 Accepts]: Start accepts. Automaton has 56362 states and 62581 transitions. Word has length 404 [2025-03-16 15:18:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 56362 states and 62581 transitions. [2025-03-16 15:18:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56362 states and 62581 transitions. [2025-03-16 15:18:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-16 15:18:40,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:40,951 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:18:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:18:40,952 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 996762181, now seen corresponding path program 1 times [2025-03-16 15:18:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019001390] [2025-03-16 15:18:40,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:40,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-16 15:18:41,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-16 15:18:41,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:41,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:18:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:41,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019001390] [2025-03-16 15:18:41,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019001390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:41,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:41,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851934734] [2025-03-16 15:18:41,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:41,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:41,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:41,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:41,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:41,143 INFO L87 Difference]: Start difference. First operand 56362 states and 62581 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:42,806 INFO L93 Difference]: Finished difference Result 123356 states and 137707 transitions. [2025-03-16 15:18:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 426 [2025-03-16 15:18:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:42,884 INFO L225 Difference]: With dead ends: 123356 [2025-03-16 15:18:42,884 INFO L226 Difference]: Without dead ends: 64429 [2025-03-16 15:18:42,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:42,911 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 511 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:42,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 710 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:18:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64429 states. [2025-03-16 15:18:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64429 to 64420. [2025-03-16 15:18:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64420 states, 64419 states have (on average 1.1002033561526878) internal successors, (70874), 64419 states have internal predecessors, (70874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64420 states to 64420 states and 70874 transitions. [2025-03-16 15:18:43,664 INFO L78 Accepts]: Start accepts. Automaton has 64420 states and 70874 transitions. Word has length 426 [2025-03-16 15:18:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:43,665 INFO L471 AbstractCegarLoop]: Abstraction has 64420 states and 70874 transitions. [2025-03-16 15:18:43,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 64420 states and 70874 transitions. [2025-03-16 15:18:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-16 15:18:43,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:43,672 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:43,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:18:43,672 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:43,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash -578284276, now seen corresponding path program 1 times [2025-03-16 15:18:43,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:43,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924282103] [2025-03-16 15:18:43,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:43,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-16 15:18:43,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-16 15:18:43,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:43,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-03-16 15:18:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924282103] [2025-03-16 15:18:43,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924282103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:43,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:43,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319877166] [2025-03-16 15:18:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:43,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:43,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:43,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:43,864 INFO L87 Difference]: Start difference. First operand 64420 states and 70874 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:45,372 INFO L93 Difference]: Finished difference Result 140767 states and 155005 transitions. [2025-03-16 15:18:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:45,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 471 [2025-03-16 15:18:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:45,445 INFO L225 Difference]: With dead ends: 140767 [2025-03-16 15:18:45,445 INFO L226 Difference]: Without dead ends: 73790 [2025-03-16 15:18:45,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:45,482 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 436 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:45,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 783 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:18:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73790 states. [2025-03-16 15:18:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73790 to 72498. [2025-03-16 15:18:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72498 states, 72497 states have (on average 1.091589996827455) internal successors, (79137), 72497 states have internal predecessors, (79137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72498 states to 72498 states and 79137 transitions. [2025-03-16 15:18:46,343 INFO L78 Accepts]: Start accepts. Automaton has 72498 states and 79137 transitions. Word has length 471 [2025-03-16 15:18:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:46,343 INFO L471 AbstractCegarLoop]: Abstraction has 72498 states and 79137 transitions. [2025-03-16 15:18:46,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 72498 states and 79137 transitions. [2025-03-16 15:18:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 15:18:46,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:46,353 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:18:46,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:18:46,353 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:46,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash -190943706, now seen corresponding path program 1 times [2025-03-16 15:18:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496557796] [2025-03-16 15:18:46,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:46,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 15:18:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 15:18:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 299 proven. 82 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:18:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496557796] [2025-03-16 15:18:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496557796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:18:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341048269] [2025-03-16 15:18:47,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:18:47,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:18:47,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:18:47,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:18:47,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 15:18:47,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 15:18:47,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:47,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:47,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:18:47,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:18:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 299 proven. 82 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:18:48,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:18:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 299 proven. 82 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:18:49,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341048269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:18:49,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:18:49,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:18:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652282646] [2025-03-16 15:18:49,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:18:49,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:18:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:49,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:18:49,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:18:49,333 INFO L87 Difference]: Start difference. First operand 72498 states and 79137 transitions. Second operand has 10 states, 10 states have (on average 97.3) internal successors, (973), 9 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:54,200 INFO L93 Difference]: Finished difference Result 171864 states and 188412 transitions. [2025-03-16 15:18:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 15:18:54,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 97.3) internal successors, (973), 9 states have internal predecessors, (973), 0 states have call successors, (0), 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 475 [2025-03-16 15:18:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:54,311 INFO L225 Difference]: With dead ends: 171864 [2025-03-16 15:18:54,311 INFO L226 Difference]: Without dead ends: 99367 [2025-03-16 15:18:54,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 945 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:18:54,363 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 2715 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 7036 mSolverCounterSat, 981 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2715 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 8017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 981 IncrementalHoareTripleChecker+Valid, 7036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:54,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2715 Valid, 403 Invalid, 8017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [981 Valid, 7036 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:18:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99367 states. [2025-03-16 15:18:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99367 to 93769. [2025-03-16 15:18:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93769 states, 93768 states have (on average 1.0911398344851122) internal successors, (102314), 93768 states have internal predecessors, (102314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93769 states to 93769 states and 102314 transitions. [2025-03-16 15:18:55,775 INFO L78 Accepts]: Start accepts. Automaton has 93769 states and 102314 transitions. Word has length 475 [2025-03-16 15:18:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:55,776 INFO L471 AbstractCegarLoop]: Abstraction has 93769 states and 102314 transitions. [2025-03-16 15:18:55,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 97.3) internal successors, (973), 9 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 93769 states and 102314 transitions. [2025-03-16 15:18:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-16 15:18:55,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:55,784 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:55,793 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-16 15:18:55,985 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,SelfDestructingSolverStorable15 [2025-03-16 15:18:55,985 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:55,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1901775074, now seen corresponding path program 1 times [2025-03-16 15:18:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:55,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485393825] [2025-03-16 15:18:55,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:55,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:56,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-16 15:18:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-16 15:18:56,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:56,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-16 15:18:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485393825] [2025-03-16 15:18:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485393825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396203628] [2025-03-16 15:18:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:56,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:56,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:56,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:56,897 INFO L87 Difference]: Start difference. First operand 93769 states and 102314 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:18:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:58,711 INFO L93 Difference]: Finished difference Result 199049 states and 217117 transitions. [2025-03-16 15:18:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 538 [2025-03-16 15:18:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:58,837 INFO L225 Difference]: With dead ends: 199049 [2025-03-16 15:18:58,837 INFO L226 Difference]: Without dead ends: 105706 [2025-03-16 15:18:58,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:58,905 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 320 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:58,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 694 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:18:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105706 states. [2025-03-16 15:19:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105706 to 102702. [2025-03-16 15:19:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102702 states, 102701 states have (on average 1.0880322489557064) internal successors, (111742), 102701 states have internal predecessors, (111742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102702 states to 102702 states and 111742 transitions. [2025-03-16 15:19:00,182 INFO L78 Accepts]: Start accepts. Automaton has 102702 states and 111742 transitions. Word has length 538 [2025-03-16 15:19:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:00,182 INFO L471 AbstractCegarLoop]: Abstraction has 102702 states and 111742 transitions. [2025-03-16 15:19:00,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 102702 states and 111742 transitions. [2025-03-16 15:19:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-03-16 15:19:00,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:00,190 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:00,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:19:00,190 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1768108409, now seen corresponding path program 1 times [2025-03-16 15:19:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645357543] [2025-03-16 15:19:00,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:00,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-03-16 15:19:00,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-03-16 15:19:00,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:00,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:19:00,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:00,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645357543] [2025-03-16 15:19:00,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645357543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:00,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:00,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936499041] [2025-03-16 15:19:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:00,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:00,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:00,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:00,548 INFO L87 Difference]: Start difference. First operand 102702 states and 111742 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:02,350 INFO L93 Difference]: Finished difference Result 216487 states and 236134 transitions. [2025-03-16 15:19:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 551 [2025-03-16 15:19:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:02,488 INFO L225 Difference]: With dead ends: 216487 [2025-03-16 15:19:02,488 INFO L226 Difference]: Without dead ends: 113786 [2025-03-16 15:19:02,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:02,535 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 286 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:02,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 740 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:19:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113786 states. [2025-03-16 15:19:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113786 to 107820. [2025-03-16 15:19:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107820 states, 107819 states have (on average 1.0827868928481994) internal successors, (116745), 107819 states have internal predecessors, (116745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107820 states to 107820 states and 116745 transitions. [2025-03-16 15:19:03,852 INFO L78 Accepts]: Start accepts. Automaton has 107820 states and 116745 transitions. Word has length 551 [2025-03-16 15:19:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:03,852 INFO L471 AbstractCegarLoop]: Abstraction has 107820 states and 116745 transitions. [2025-03-16 15:19:03,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 107820 states and 116745 transitions. [2025-03-16 15:19:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-03-16 15:19:03,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:03,859 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:19:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:19:03,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 986048319, now seen corresponding path program 1 times [2025-03-16 15:19:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374961642] [2025-03-16 15:19:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:03,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-16 15:19:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-16 15:19:03,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:19:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374961642] [2025-03-16 15:19:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374961642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:04,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:19:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672394047] [2025-03-16 15:19:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:04,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:04,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:04,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:04,362 INFO L87 Difference]: Start difference. First operand 107820 states and 116745 transitions. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:06,370 INFO L93 Difference]: Finished difference Result 217764 states and 235708 transitions. [2025-03-16 15:19:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:06,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 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 557 [2025-03-16 15:19:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:06,514 INFO L225 Difference]: With dead ends: 217764 [2025-03-16 15:19:06,514 INFO L226 Difference]: Without dead ends: 110795 [2025-03-16 15:19:06,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:06,586 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 744 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:06,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 736 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:19:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110795 states. [2025-03-16 15:19:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110795 to 109945. [2025-03-16 15:19:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109945 states, 109944 states have (on average 1.0814778432656624) internal successors, (118902), 109944 states have internal predecessors, (118902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109945 states to 109945 states and 118902 transitions. [2025-03-16 15:19:08,187 INFO L78 Accepts]: Start accepts. Automaton has 109945 states and 118902 transitions. Word has length 557 [2025-03-16 15:19:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:08,188 INFO L471 AbstractCegarLoop]: Abstraction has 109945 states and 118902 transitions. [2025-03-16 15:19:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 109945 states and 118902 transitions. [2025-03-16 15:19:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-16 15:19:08,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:08,206 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-16 15:19:08,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:19:08,206 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:08,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -533230318, now seen corresponding path program 1 times [2025-03-16 15:19:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819164078] [2025-03-16 15:19:08,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:08,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-16 15:19:08,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-16 15:19:08,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:08,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 822 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-16 15:19:08,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:08,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819164078] [2025-03-16 15:19:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819164078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:08,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:08,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:08,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142846366] [2025-03-16 15:19:08,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:08,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:08,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:08,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:08,882 INFO L87 Difference]: Start difference. First operand 109945 states and 118902 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:10,417 INFO L93 Difference]: Finished difference Result 227985 states and 246524 transitions. [2025-03-16 15:19:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 649 [2025-03-16 15:19:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:10,550 INFO L225 Difference]: With dead ends: 227985 [2025-03-16 15:19:10,550 INFO L226 Difference]: Without dead ends: 118891 [2025-03-16 15:19:10,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:19:10,614 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 356 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:10,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 302 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:19:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2025-03-16 15:19:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 112496. [2025-03-16 15:19:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112496 states, 112495 states have (on average 1.0696208720387572) internal successors, (120327), 112495 states have internal predecessors, (120327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112496 states to 112496 states and 120327 transitions. [2025-03-16 15:19:12,063 INFO L78 Accepts]: Start accepts. Automaton has 112496 states and 120327 transitions. Word has length 649 [2025-03-16 15:19:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:12,064 INFO L471 AbstractCegarLoop]: Abstraction has 112496 states and 120327 transitions. [2025-03-16 15:19:12,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 112496 states and 120327 transitions. [2025-03-16 15:19:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-03-16 15:19:12,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:12,076 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:12,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:19:12,077 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1982945787, now seen corresponding path program 1 times [2025-03-16 15:19:12,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:12,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503193015] [2025-03-16 15:19:12,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:12,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-16 15:19:12,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-16 15:19:12,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1267 backedges. 1044 proven. 120 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-16 15:19:13,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:13,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503193015] [2025-03-16 15:19:13,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503193015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:13,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232060659] [2025-03-16 15:19:13,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:13,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:19:13,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:19:13,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:19:13,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:19:13,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-16 15:19:13,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-16 15:19:13,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:13,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:13,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:19:13,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:19:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1267 backedges. 1044 proven. 120 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-16 15:19:14,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:19:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1267 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-16 15:19:14,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232060659] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:19:14,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:19:14,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-16 15:19:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067445202] [2025-03-16 15:19:14,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:14,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:19:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:14,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:19:14,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:19:14,660 INFO L87 Difference]: Start difference. First operand 112496 states and 120327 transitions. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:16,314 INFO L93 Difference]: Finished difference Result 225843 states and 241509 transitions. [2025-03-16 15:19:16,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:19:16,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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 746 [2025-03-16 15:19:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:16,456 INFO L225 Difference]: With dead ends: 225843 [2025-03-16 15:19:16,456 INFO L226 Difference]: Without dead ends: 113773 [2025-03-16 15:19:16,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1494 GetRequests, 1490 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:19:16,531 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 336 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:16,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 324 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:19:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113773 states. [2025-03-16 15:19:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113773 to 112064. [2025-03-16 15:19:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112064 states, 112063 states have (on average 1.0641514148291586) internal successors, (119252), 112063 states have internal predecessors, (119252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112064 states to 112064 states and 119252 transitions. [2025-03-16 15:19:17,847 INFO L78 Accepts]: Start accepts. Automaton has 112064 states and 119252 transitions. Word has length 746 [2025-03-16 15:19:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 112064 states and 119252 transitions. [2025-03-16 15:19:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 112064 states and 119252 transitions. [2025-03-16 15:19:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-03-16 15:19:17,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:17,859 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:19:17,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:19:18,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:19:18,064 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:18,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash -111009733, now seen corresponding path program 1 times [2025-03-16 15:19:18,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:18,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214597858] [2025-03-16 15:19:18,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:18,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-03-16 15:19:18,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-03-16 15:19:18,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:18,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-16 15:19:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214597858] [2025-03-16 15:19:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214597858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:19:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901736892] [2025-03-16 15:19:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:19,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:19,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:19,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:19,075 INFO L87 Difference]: Start difference. First operand 112064 states and 119252 transitions. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:19:21,756 INFO L93 Difference]: Finished difference Result 259475 states and 275676 transitions. [2025-03-16 15:19:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:19:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 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 753 [2025-03-16 15:19:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:19:21,941 INFO L225 Difference]: With dead ends: 259475 [2025-03-16 15:19:21,941 INFO L226 Difference]: Without dead ends: 146987 [2025-03-16 15:19:22,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:22,214 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 656 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:19:22,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 197 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:19:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146987 states. [2025-03-16 15:19:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146987 to 130810. [2025-03-16 15:19:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130810 states, 130809 states have (on average 1.0633595547706962) internal successors, (139097), 130809 states have internal predecessors, (139097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130810 states to 130810 states and 139097 transitions. [2025-03-16 15:19:23,505 INFO L78 Accepts]: Start accepts. Automaton has 130810 states and 139097 transitions. Word has length 753 [2025-03-16 15:19:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:19:23,506 INFO L471 AbstractCegarLoop]: Abstraction has 130810 states and 139097 transitions. [2025-03-16 15:19:23,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:19:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 130810 states and 139097 transitions. [2025-03-16 15:19:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2025-03-16 15:19:23,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:19:23,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:19:23,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:19:23,523 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:19:23,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:19:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1256097201, now seen corresponding path program 1 times [2025-03-16 15:19:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:19:23,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225756391] [2025-03-16 15:19:23,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:19:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:19:23,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 770 statements into 1 equivalence classes. [2025-03-16 15:19:23,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 770 of 770 statements. [2025-03-16 15:19:23,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:19:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:19:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:19:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:19:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225756391] [2025-03-16 15:19:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225756391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:19:24,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:19:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:19:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2450642] [2025-03-16 15:19:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:19:24,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:19:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:19:24,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:19:24,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:19:24,791 INFO L87 Difference]: Start difference. First operand 130810 states and 139097 transitions. Second operand has 4 states, 4 states have (on average 187.5) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)