./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label15.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 04841d1aba9375b8a6b06dc8afee8df1fa6191c086b63f3a4a476e022f53e582 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:04:22,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:04:22,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:04:22,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:04:22,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:04:22,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:04:22,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:04:22,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:04:22,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:04:22,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:04:22,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:04:22,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:04:22,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:04:22,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:04:22,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:04:22,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:04:22,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:04:22,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:04:22,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:04:22,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:04:22,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:04:22,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:04:22,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:04:22,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:04:22,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:04:22,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:04:22,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:04:22,180 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 -> 04841d1aba9375b8a6b06dc8afee8df1fa6191c086b63f3a4a476e022f53e582 [2025-03-08 02:04:22,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:04:22,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:04:22,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:04:22,391 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:04:22,391 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:04:22,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label15.c [2025-03-08 02:04:23,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5aef38db/82305d8f57994b7588fe158736ec8a9b/FLAG626fa74b9 [2025-03-08 02:04:23,832 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:04:23,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label15.c [2025-03-08 02:04:23,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5aef38db/82305d8f57994b7588fe158736ec8a9b/FLAG626fa74b9 [2025-03-08 02:04:23,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5aef38db/82305d8f57994b7588fe158736ec8a9b [2025-03-08 02:04:23,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:04:23,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:04:23,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:04:23,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:04:23,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:04:23,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:23" (1/1) ... [2025-03-08 02:04:23,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630023be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23, skipping insertion in model container [2025-03-08 02:04:23,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:23" (1/1) ... [2025-03-08 02:04:23,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:04:24,033 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/Problem16_label15.c[2501,2514] [2025-03-08 02:04:24,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:04:24,325 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:04:24,335 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/Problem16_label15.c[2501,2514] [2025-03-08 02:04:24,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:04:24,462 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:04:24,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24 WrapperNode [2025-03-08 02:04:24,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:04:24,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:04:24,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:04:24,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:04:24,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,610 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:04:24,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:04:24,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:04:24,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:04:24,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:04:24,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,681 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:04:24,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:04:24,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:04:24,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:04:24,747 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:04:24,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (1/1) ... [2025-03-08 02:04:24,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:04:24,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:24,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:04:24,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:04:24,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:04:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:04:24,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:04:24,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:04:24,838 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:04:24,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:04:26,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:04:26,433 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:04:26,433 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:04:26,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:04:26,457 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:04:26,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:26 BoogieIcfgContainer [2025-03-08 02:04:26,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:04:26,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:04:26,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:04:26,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:04:26,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:04:23" (1/3) ... [2025-03-08 02:04:26,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85f5346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:26, skipping insertion in model container [2025-03-08 02:04:26,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:24" (2/3) ... [2025-03-08 02:04:26,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85f5346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:26, skipping insertion in model container [2025-03-08 02:04:26,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:26" (3/3) ... [2025-03-08 02:04:26,465 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label15.c [2025-03-08 02:04:26,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:04:26,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label15.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:04:26,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:04:26,538 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;@5d4a4864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:04:26,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:04:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 02:04:26,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:26,546 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-08 02:04:26,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:26,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash 221767174, now seen corresponding path program 1 times [2025-03-08 02:04:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878860277] [2025-03-08 02:04:26,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:26,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 02:04:26,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 02:04:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:26,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:04:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878860277] [2025-03-08 02:04:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878860277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:26,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:26,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:26,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213653098] [2025-03-08 02:04:26,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:26,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:26,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:26,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:26,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:26,867 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-08 02:04:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:29,088 INFO L93 Difference]: Finished difference Result 1456 states and 2760 transitions. [2025-03-08 02:04:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:04:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-08 02:04:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:29,101 INFO L225 Difference]: With dead ends: 1456 [2025-03-08 02:04:29,101 INFO L226 Difference]: Without dead ends: 991 [2025-03-08 02:04:29,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:29,106 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 988 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:29,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 347 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:04:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-08 02:04:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-03-08 02:04:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.4858585858585858) internal successors, (1471), 990 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1471 transitions. [2025-03-08 02:04:29,191 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1471 transitions. Word has length 22 [2025-03-08 02:04:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:29,191 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1471 transitions. [2025-03-08 02:04:29,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-08 02:04:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1471 transitions. [2025-03-08 02:04:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 02:04:29,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:29,195 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:04:29,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:04:29,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:29,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1546699138, now seen corresponding path program 1 times [2025-03-08 02:04:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292008990] [2025-03-08 02:04:29,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:29,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 02:04:29,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 02:04:29,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:29,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 02:04:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292008990] [2025-03-08 02:04:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292008990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:04:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518552616] [2025-03-08 02:04:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:29,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:29,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:29,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:29,397 INFO L87 Difference]: Start difference. First operand 991 states and 1471 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:30,428 INFO L93 Difference]: Finished difference Result 2309 states and 3726 transitions. [2025-03-08 02:04:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:30,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-08 02:04:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:30,434 INFO L225 Difference]: With dead ends: 2309 [2025-03-08 02:04:30,435 INFO L226 Difference]: Without dead ends: 1649 [2025-03-08 02:04:30,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:30,436 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 280 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:30,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 199 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:04:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-08 02:04:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-03-08 02:04:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.379247572815534) internal successors, (2273), 1648 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2273 transitions. [2025-03-08 02:04:30,461 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2273 transitions. Word has length 109 [2025-03-08 02:04:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:30,461 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2273 transitions. [2025-03-08 02:04:30,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2273 transitions. [2025-03-08 02:04:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 02:04:30,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:30,467 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:30,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:04:30,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:30,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1158402458, now seen corresponding path program 1 times [2025-03-08 02:04:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602820326] [2025-03-08 02:04:30,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:30,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 02:04:30,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 02:04:30,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:30,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:04:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602820326] [2025-03-08 02:04:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602820326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:30,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:30,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:04:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896807678] [2025-03-08 02:04:30,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:30,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:30,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:30,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:30,700 INFO L87 Difference]: Start difference. First operand 1649 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:31,620 INFO L93 Difference]: Finished difference Result 4283 states and 6132 transitions. [2025-03-08 02:04:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-03-08 02:04:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:31,629 INFO L225 Difference]: With dead ends: 4283 [2025-03-08 02:04:31,630 INFO L226 Difference]: Without dead ends: 2965 [2025-03-08 02:04:31,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:31,632 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:31,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:04:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-03-08 02:04:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2636. [2025-03-08 02:04:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3400379506641367) internal successors, (3531), 2635 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3531 transitions. [2025-03-08 02:04:31,669 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3531 transitions. Word has length 188 [2025-03-08 02:04:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:31,670 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3531 transitions. [2025-03-08 02:04:31,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3531 transitions. [2025-03-08 02:04:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 02:04:31,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:31,676 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:04:31,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -542590984, now seen corresponding path program 1 times [2025-03-08 02:04:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488665123] [2025-03-08 02:04:31,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:31,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 02:04:31,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 02:04:31,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:31,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 02:04:31,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:31,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488665123] [2025-03-08 02:04:31,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488665123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:31,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:31,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:04:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352706804] [2025-03-08 02:04:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:31,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:31,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:31,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:31,891 INFO L87 Difference]: Start difference. First operand 2636 states and 3531 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:32,673 INFO L93 Difference]: Finished difference Result 5599 states and 7527 transitions. [2025-03-08 02:04:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:32,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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 264 [2025-03-08 02:04:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:32,681 INFO L225 Difference]: With dead ends: 5599 [2025-03-08 02:04:32,681 INFO L226 Difference]: Without dead ends: 3294 [2025-03-08 02:04:32,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:32,687 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:32,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:04:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2025-03-08 02:04:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2025-03-08 02:04:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.2247191011235956) internal successors, (4033), 3293 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4033 transitions. [2025-03-08 02:04:32,727 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4033 transitions. Word has length 264 [2025-03-08 02:04:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:32,728 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4033 transitions. [2025-03-08 02:04:32,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4033 transitions. [2025-03-08 02:04:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-08 02:04:32,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:32,732 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:32,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:04:32,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash -341766485, now seen corresponding path program 1 times [2025-03-08 02:04:32,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:32,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696554662] [2025-03-08 02:04:32,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:32,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:32,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-08 02:04:32,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-08 02:04:32,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:32,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-08 02:04:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696554662] [2025-03-08 02:04:32,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696554662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:32,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977919550] [2025-03-08 02:04:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:32,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:32,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:32,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:32,973 INFO L87 Difference]: Start difference. First operand 3294 states and 4033 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:33,896 INFO L93 Difference]: Finished difference Result 6586 states and 8076 transitions. [2025-03-08 02:04:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:33,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 441 [2025-03-08 02:04:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:33,904 INFO L225 Difference]: With dead ends: 6586 [2025-03-08 02:04:33,904 INFO L226 Difference]: Without dead ends: 3294 [2025-03-08 02:04:33,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:33,907 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 288 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:33,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 538 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:04:33,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2025-03-08 02:04:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2025-03-08 02:04:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.0567871242028546) internal successors, (3480), 3293 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 3480 transitions. [2025-03-08 02:04:33,938 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 3480 transitions. Word has length 441 [2025-03-08 02:04:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:33,939 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 3480 transitions. [2025-03-08 02:04:33,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3480 transitions. [2025-03-08 02:04:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-08 02:04:33,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:33,943 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-08 02:04:33,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:04:33,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1847081811, now seen corresponding path program 1 times [2025-03-08 02:04:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079525151] [2025-03-08 02:04:33,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:33,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-08 02:04:33,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-08 02:04:33,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:33,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 02:04:34,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:34,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079525151] [2025-03-08 02:04:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079525151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:34,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119733867] [2025-03-08 02:04:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:34,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:34,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:34,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:34,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:34,356 INFO L87 Difference]: Start difference. First operand 3294 states and 3480 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:35,072 INFO L93 Difference]: Finished difference Result 7902 states and 8408 transitions. [2025-03-08 02:04:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:35,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 493 [2025-03-08 02:04:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:35,084 INFO L225 Difference]: With dead ends: 7902 [2025-03-08 02:04:35,085 INFO L226 Difference]: Without dead ends: 4610 [2025-03-08 02:04:35,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:35,090 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:35,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 434 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:04:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-08 02:04:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-03-08 02:04:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.045779995660664) internal successors, (4820), 4609 states have internal predecessors, (4820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4820 transitions. [2025-03-08 02:04:35,144 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4820 transitions. Word has length 493 [2025-03-08 02:04:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:35,144 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4820 transitions. [2025-03-08 02:04:35,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4820 transitions. [2025-03-08 02:04:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-08 02:04:35,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:35,152 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:04:35,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:35,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash 756160444, now seen corresponding path program 1 times [2025-03-08 02:04:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550695308] [2025-03-08 02:04:35,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:35,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-08 02:04:35,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-08 02:04:35,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:35,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 02:04:35,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:35,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550695308] [2025-03-08 02:04:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550695308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:35,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260302251] [2025-03-08 02:04:35,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:35,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:35,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:35,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:35,574 INFO L87 Difference]: Start difference. First operand 4610 states and 4820 transitions. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 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-08 02:04:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:36,280 INFO L93 Difference]: Finished difference Result 10534 states and 11087 transitions. [2025-03-08 02:04:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 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 556 [2025-03-08 02:04:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:36,293 INFO L225 Difference]: With dead ends: 10534 [2025-03-08 02:04:36,293 INFO L226 Difference]: Without dead ends: 5926 [2025-03-08 02:04:36,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:36,298 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 185 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:36,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 59 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:04:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2025-03-08 02:04:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2025-03-08 02:04:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5926 states, 5925 states have (on average 1.0486075949367089) internal successors, (6213), 5925 states have internal predecessors, (6213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6213 transitions. [2025-03-08 02:04:36,380 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6213 transitions. Word has length 556 [2025-03-08 02:04:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:36,381 INFO L471 AbstractCegarLoop]: Abstraction has 5926 states and 6213 transitions. [2025-03-08 02:04:36,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 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-08 02:04:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6213 transitions. [2025-03-08 02:04:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2025-03-08 02:04:36,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:36,395 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 02:04:36,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:04:36,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:36,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash -669021753, now seen corresponding path program 1 times [2025-03-08 02:04:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:36,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974058836] [2025-03-08 02:04:36,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:36,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 845 statements into 1 equivalence classes. [2025-03-08 02:04:36,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 845 of 845 statements. [2025-03-08 02:04:36,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:36,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-08 02:04:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:37,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974058836] [2025-03-08 02:04:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974058836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:37,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:37,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:04:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125379470] [2025-03-08 02:04:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:37,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:37,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:37,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:37,104 INFO L87 Difference]: Start difference. First operand 5926 states and 6213 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:37,681 INFO L93 Difference]: Finished difference Result 11850 states and 12432 transitions. [2025-03-08 02:04:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 845 [2025-03-08 02:04:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:37,695 INFO L225 Difference]: With dead ends: 11850 [2025-03-08 02:04:37,695 INFO L226 Difference]: Without dead ends: 6255 [2025-03-08 02:04:37,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:37,701 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:37,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 105 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-03-08 02:04:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2025-03-08 02:04:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0471698113207548) internal successors, (6549), 6254 states have internal predecessors, (6549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6549 transitions. [2025-03-08 02:04:37,768 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6549 transitions. Word has length 845 [2025-03-08 02:04:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:37,769 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6549 transitions. [2025-03-08 02:04:37,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6549 transitions. [2025-03-08 02:04:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-03-08 02:04:37,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:37,779 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:04:37,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:04:37,780 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:37,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash 60445875, now seen corresponding path program 1 times [2025-03-08 02:04:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:37,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115990156] [2025-03-08 02:04:37,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:37,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-03-08 02:04:37,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-03-08 02:04:37,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:37,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2025-03-08 02:04:38,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115990156] [2025-03-08 02:04:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115990156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:38,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523827897] [2025-03-08 02:04:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:38,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:38,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:38,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:38,630 INFO L87 Difference]: Start difference. First operand 6255 states and 6549 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:39,186 INFO L93 Difference]: Finished difference Result 11850 states and 12429 transitions. [2025-03-08 02:04:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:39,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 853 [2025-03-08 02:04:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:39,198 INFO L225 Difference]: With dead ends: 11850 [2025-03-08 02:04:39,198 INFO L226 Difference]: Without dead ends: 6255 [2025-03-08 02:04:39,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:39,204 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 226 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:39,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 377 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-03-08 02:04:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2025-03-08 02:04:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0417332906939558) internal successors, (6515), 6254 states have internal predecessors, (6515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6515 transitions. [2025-03-08 02:04:39,266 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6515 transitions. Word has length 853 [2025-03-08 02:04:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6515 transitions. [2025-03-08 02:04:39,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6515 transitions. [2025-03-08 02:04:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1116 [2025-03-08 02:04:39,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:39,279 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:39,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:04:39,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:39,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1683904839, now seen corresponding path program 1 times [2025-03-08 02:04:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:39,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439715041] [2025-03-08 02:04:39,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:39,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1115 statements into 1 equivalence classes. [2025-03-08 02:04:39,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1115 of 1115 statements. [2025-03-08 02:04:39,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:39,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 1336 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2025-03-08 02:04:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439715041] [2025-03-08 02:04:40,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439715041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:40,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:40,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:04:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049056900] [2025-03-08 02:04:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:40,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:40,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:40,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:40,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:40,489 INFO L87 Difference]: Start difference. First operand 6255 states and 6515 transitions. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:41,284 INFO L93 Difference]: Finished difference Result 11856 states and 12367 transitions. [2025-03-08 02:04:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:04:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 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 1115 [2025-03-08 02:04:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:41,293 INFO L225 Difference]: With dead ends: 11856 [2025-03-08 02:04:41,294 INFO L226 Difference]: Without dead ends: 6261 [2025-03-08 02:04:41,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:41,296 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:41,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 446 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:04:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6261 states. [2025-03-08 02:04:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6261 to 6255. [2025-03-08 02:04:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0414134953629677) internal successors, (6513), 6254 states have internal predecessors, (6513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6513 transitions. [2025-03-08 02:04:41,341 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6513 transitions. Word has length 1115 [2025-03-08 02:04:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:41,342 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6513 transitions. [2025-03-08 02:04:41,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6513 transitions. [2025-03-08 02:04:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2025-03-08 02:04:41,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:41,353 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:41,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:04:41,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -617156756, now seen corresponding path program 1 times [2025-03-08 02:04:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:41,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795716611] [2025-03-08 02:04:41,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:41,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1129 statements into 1 equivalence classes. [2025-03-08 02:04:41,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1129 of 1129 statements. [2025-03-08 02:04:41,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:41,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 1430 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2025-03-08 02:04:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795716611] [2025-03-08 02:04:42,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795716611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:42,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:04:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393392123] [2025-03-08 02:04:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:42,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:42,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:42,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:42,099 INFO L87 Difference]: Start difference. First operand 6255 states and 6513 transitions. Second operand has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:42,773 INFO L93 Difference]: Finished difference Result 12179 states and 12697 transitions. [2025-03-08 02:04:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:04:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 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 1129 [2025-03-08 02:04:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:42,783 INFO L225 Difference]: With dead ends: 12179 [2025-03-08 02:04:42,783 INFO L226 Difference]: Without dead ends: 6584 [2025-03-08 02:04:42,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:42,788 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:42,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 566 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:42,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2025-03-08 02:04:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6584. [2025-03-08 02:04:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.0394956706668692) internal successors, (6843), 6583 states have internal predecessors, (6843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6843 transitions. [2025-03-08 02:04:42,840 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6843 transitions. Word has length 1129 [2025-03-08 02:04:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:42,841 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6843 transitions. [2025-03-08 02:04:42,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6843 transitions. [2025-03-08 02:04:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2025-03-08 02:04:42,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:42,853 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:42,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:04:42,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:42,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1825307023, now seen corresponding path program 1 times [2025-03-08 02:04:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:42,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340688227] [2025-03-08 02:04:42,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:42,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1153 statements into 1 equivalence classes. [2025-03-08 02:04:42,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1153 of 1153 statements. [2025-03-08 02:04:42,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:42,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1443 proven. 0 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2025-03-08 02:04:43,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:43,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340688227] [2025-03-08 02:04:43,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340688227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:43,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:43,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94685566] [2025-03-08 02:04:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:43,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:43,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:43,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:43,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:43,791 INFO L87 Difference]: Start difference. First operand 6584 states and 6843 transitions. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:44,392 INFO L93 Difference]: Finished difference Result 13495 states and 14069 transitions. [2025-03-08 02:04:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:44,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 1153 [2025-03-08 02:04:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:44,403 INFO L225 Difference]: With dead ends: 13495 [2025-03-08 02:04:44,403 INFO L226 Difference]: Without dead ends: 7571 [2025-03-08 02:04:44,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:44,409 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:44,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 442 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-03-08 02:04:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2025-03-08 02:04:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0352708058124174) internal successors, (7837), 7570 states have internal predecessors, (7837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7837 transitions. [2025-03-08 02:04:44,466 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7837 transitions. Word has length 1153 [2025-03-08 02:04:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:44,466 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 7837 transitions. [2025-03-08 02:04:44,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7837 transitions. [2025-03-08 02:04:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2025-03-08 02:04:44,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:44,479 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:44,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:04:44,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:44,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1564662782, now seen corresponding path program 1 times [2025-03-08 02:04:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:44,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648414550] [2025-03-08 02:04:44,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:44,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:44,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1171 statements into 1 equivalence classes. [2025-03-08 02:04:44,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1171 of 1171 statements. [2025-03-08 02:04:44,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:44,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 993 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2025-03-08 02:04:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648414550] [2025-03-08 02:04:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648414550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:44,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664975783] [2025-03-08 02:04:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:44,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:44,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:44,959 INFO L87 Difference]: Start difference. First operand 7571 states and 7837 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:45,473 INFO L93 Difference]: Finished difference Result 16456 states and 17058 transitions. [2025-03-08 02:04:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:45,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1171 [2025-03-08 02:04:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:45,483 INFO L225 Difference]: With dead ends: 16456 [2025-03-08 02:04:45,483 INFO L226 Difference]: Without dead ends: 8229 [2025-03-08 02:04:45,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:45,490 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 147 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:45,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 414 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-03-08 02:04:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-03-08 02:04:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0308701993193972) internal successors, (8482), 8228 states have internal predecessors, (8482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8482 transitions. [2025-03-08 02:04:45,548 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8482 transitions. Word has length 1171 [2025-03-08 02:04:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:45,549 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8482 transitions. [2025-03-08 02:04:45,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8482 transitions. [2025-03-08 02:04:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1334 [2025-03-08 02:04:45,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:45,563 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:04:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:04:45,563 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:45,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash -778072874, now seen corresponding path program 1 times [2025-03-08 02:04:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028538179] [2025-03-08 02:04:45,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:45,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1333 statements into 1 equivalence classes. [2025-03-08 02:04:45,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1333 of 1333 statements. [2025-03-08 02:04:45,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:45,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 3443 trivial. 0 not checked. [2025-03-08 02:04:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:46,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028538179] [2025-03-08 02:04:46,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028538179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:46,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:46,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096543209] [2025-03-08 02:04:46,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:46,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:46,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:46,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:46,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:46,164 INFO L87 Difference]: Start difference. First operand 8229 states and 8482 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:46,516 INFO L93 Difference]: Finished difference Result 8565 states and 8818 transitions. [2025-03-08 02:04:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:46,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 1333 [2025-03-08 02:04:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:46,526 INFO L225 Difference]: With dead ends: 8565 [2025-03-08 02:04:46,526 INFO L226 Difference]: Without dead ends: 8229 [2025-03-08 02:04:46,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:46,529 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:46,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 02:04:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-03-08 02:04:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-03-08 02:04:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0307486631016043) internal successors, (8481), 8228 states have internal predecessors, (8481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8481 transitions. [2025-03-08 02:04:46,589 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8481 transitions. Word has length 1333 [2025-03-08 02:04:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:46,590 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8481 transitions. [2025-03-08 02:04:46,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8481 transitions. [2025-03-08 02:04:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1383 [2025-03-08 02:04:46,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:46,605 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:04:46,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:04:46,605 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:46,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -87263854, now seen corresponding path program 1 times [2025-03-08 02:04:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:46,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134937154] [2025-03-08 02:04:46,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:46,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1382 statements into 1 equivalence classes. [2025-03-08 02:04:46,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1382 of 1382 statements. [2025-03-08 02:04:46,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:46,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 1207 proven. 0 refuted. 0 times theorem prover too weak. 2581 trivial. 0 not checked. [2025-03-08 02:04:47,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134937154] [2025-03-08 02:04:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134937154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:47,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:47,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:47,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180796184] [2025-03-08 02:04:47,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:47,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:47,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:47,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:47,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:47,293 INFO L87 Difference]: Start difference. First operand 8229 states and 8481 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:47,828 INFO L93 Difference]: Finished difference Result 16127 states and 16629 transitions. [2025-03-08 02:04:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:47,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 1382 [2025-03-08 02:04:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:47,838 INFO L225 Difference]: With dead ends: 16127 [2025-03-08 02:04:47,838 INFO L226 Difference]: Without dead ends: 8229 [2025-03-08 02:04:47,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:47,847 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 140 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:47,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 409 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-03-08 02:04:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 7900. [2025-03-08 02:04:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.025572857323712) internal successors, (8101), 7899 states have internal predecessors, (8101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8101 transitions. [2025-03-08 02:04:47,902 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8101 transitions. Word has length 1382 [2025-03-08 02:04:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:47,903 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8101 transitions. [2025-03-08 02:04:47,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8101 transitions. [2025-03-08 02:04:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1593 [2025-03-08 02:04:47,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:47,951 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:47,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:04:47,951 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:47,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1327209669, now seen corresponding path program 1 times [2025-03-08 02:04:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:47,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047252339] [2025-03-08 02:04:47,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:48,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1592 statements into 1 equivalence classes. [2025-03-08 02:04:48,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1592 of 1592 statements. [2025-03-08 02:04:48,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:48,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4987 backedges. 1241 proven. 0 refuted. 0 times theorem prover too weak. 3746 trivial. 0 not checked. [2025-03-08 02:04:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:48,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047252339] [2025-03-08 02:04:48,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047252339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:48,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667740466] [2025-03-08 02:04:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:48,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:48,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:48,690 INFO L87 Difference]: Start difference. First operand 7900 states and 8101 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:49,228 INFO L93 Difference]: Finished difference Result 17114 states and 17605 transitions. [2025-03-08 02:04:49,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:49,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 1592 [2025-03-08 02:04:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:49,236 INFO L225 Difference]: With dead ends: 17114 [2025-03-08 02:04:49,236 INFO L226 Difference]: Without dead ends: 9216 [2025-03-08 02:04:49,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:49,241 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 175 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:49,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 429 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-08 02:04:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-03-08 02:04:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0239826370048832) internal successors, (9436), 9215 states have internal predecessors, (9436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9436 transitions. [2025-03-08 02:04:49,298 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9436 transitions. Word has length 1592 [2025-03-08 02:04:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:49,299 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9436 transitions. [2025-03-08 02:04:49,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9436 transitions. [2025-03-08 02:04:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1754 [2025-03-08 02:04:49,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:49,318 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:49,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:04:49,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:49,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash -811888876, now seen corresponding path program 1 times [2025-03-08 02:04:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937707933] [2025-03-08 02:04:49,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:49,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1753 statements into 1 equivalence classes. [2025-03-08 02:04:49,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1753 of 1753 statements. [2025-03-08 02:04:49,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:49,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6250 backedges. 4351 proven. 132 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2025-03-08 02:04:50,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:50,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937707933] [2025-03-08 02:04:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937707933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:50,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793779421] [2025-03-08 02:04:50,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:50,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:50,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:50,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:50,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:04:50,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1753 statements into 1 equivalence classes. [2025-03-08 02:04:51,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1753 of 1753 statements. [2025-03-08 02:04:51,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:51,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:51,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 2031 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:04:51,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6250 backedges. 2509 proven. 201 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2025-03-08 02:04:53,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:04:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6250 backedges. 2509 proven. 201 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2025-03-08 02:04:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793779421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:04:56,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:04:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:04:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486225654] [2025-03-08 02:04:56,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:04:56,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:04:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:56,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:04:56,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:04:56,334 INFO L87 Difference]: Start difference. First operand 9216 states and 9436 transitions. Second operand has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:00,434 INFO L93 Difference]: Finished difference Result 32248 states and 33091 transitions. [2025-03-08 02:05:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 02:05:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 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 1753 [2025-03-08 02:05:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:00,456 INFO L225 Difference]: With dead ends: 32248 [2025-03-08 02:05:00,456 INFO L226 Difference]: Without dead ends: 23363 [2025-03-08 02:05:00,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3531 GetRequests, 3513 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-03-08 02:05:00,466 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3238 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8056 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3238 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 8791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 735 IncrementalHoareTripleChecker+Valid, 8056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:00,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3238 Valid, 101 Invalid, 8791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [735 Valid, 8056 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 02:05:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23363 states. [2025-03-08 02:05:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23363 to 16125. [2025-03-08 02:05:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0253659141652196) internal successors, (16533), 16124 states have internal predecessors, (16533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16533 transitions. [2025-03-08 02:05:00,631 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16533 transitions. Word has length 1753 [2025-03-08 02:05:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:00,632 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16533 transitions. [2025-03-08 02:05:00,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16533 transitions. [2025-03-08 02:05:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1846 [2025-03-08 02:05:00,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:00,656 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:00,665 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-08 02:05:00,857 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,SelfDestructingSolverStorable16 [2025-03-08 02:05:00,857 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:00,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:00,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2066822508, now seen corresponding path program 1 times [2025-03-08 02:05:00,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:00,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656553465] [2025-03-08 02:05:00,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:00,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:00,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1845 statements into 1 equivalence classes. [2025-03-08 02:05:00,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1845 of 1845 statements. [2025-03-08 02:05:00,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:00,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7305 backedges. 2633 proven. 156 refuted. 0 times theorem prover too weak. 4516 trivial. 0 not checked. [2025-03-08 02:05:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656553465] [2025-03-08 02:05:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656553465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146546315] [2025-03-08 02:05:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:02,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:02,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:05:03,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1845 statements into 1 equivalence classes. [2025-03-08 02:05:03,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1845 of 1845 statements. [2025-03-08 02:05:03,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:03,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:03,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 2142 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:05:03,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7305 backedges. 2789 proven. 0 refuted. 0 times theorem prover too weak. 4516 trivial. 0 not checked. [2025-03-08 02:05:03,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146546315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 02:05:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939957148] [2025-03-08 02:05:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:03,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:03,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:03,927 INFO L87 Difference]: Start difference. First operand 16125 states and 16533 transitions. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:04,501 INFO L93 Difference]: Finished difference Result 33235 states and 34084 transitions. [2025-03-08 02:05:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:04,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 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 1845 [2025-03-08 02:05:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:04,515 INFO L225 Difference]: With dead ends: 33235 [2025-03-08 02:05:04,516 INFO L226 Difference]: Without dead ends: 17441 [2025-03-08 02:05:04,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1849 GetRequests, 1844 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:04,526 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:04,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 93 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-03-08 02:05:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 17441. [2025-03-08 02:05:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0240252293577983) internal successors, (17859), 17440 states have internal predecessors, (17859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17859 transitions. [2025-03-08 02:05:04,690 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17859 transitions. Word has length 1845 [2025-03-08 02:05:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:04,691 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17859 transitions. [2025-03-08 02:05:04,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17859 transitions. [2025-03-08 02:05:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1954 [2025-03-08 02:05:04,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:04,739 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:04,747 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-08 02:05:04,939 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,SelfDestructingSolverStorable17 [2025-03-08 02:05:04,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:04,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -926387908, now seen corresponding path program 1 times [2025-03-08 02:05:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245633882] [2025-03-08 02:05:04,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:05,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1953 statements into 1 equivalence classes. [2025-03-08 02:05:05,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1953 of 1953 statements. [2025-03-08 02:05:05,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:05,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7307 backedges. 3659 proven. 0 refuted. 0 times theorem prover too weak. 3648 trivial. 0 not checked. [2025-03-08 02:05:06,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:06,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245633882] [2025-03-08 02:05:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245633882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427284285] [2025-03-08 02:05:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:06,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:06,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:06,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:06,791 INFO L87 Difference]: Start difference. First operand 17441 states and 17859 transitions. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:07,368 INFO L93 Difference]: Finished difference Result 37512 states and 38387 transitions. [2025-03-08 02:05:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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 1953 [2025-03-08 02:05:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:07,385 INFO L225 Difference]: With dead ends: 37512 [2025-03-08 02:05:07,385 INFO L226 Difference]: Without dead ends: 20402 [2025-03-08 02:05:07,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:07,397 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:07,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 48 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-08 02:05:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 18428. [2025-03-08 02:05:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0233895913605036) internal successors, (18858), 18427 states have internal predecessors, (18858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18858 transitions. [2025-03-08 02:05:07,540 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18858 transitions. Word has length 1953 [2025-03-08 02:05:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:07,540 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18858 transitions. [2025-03-08 02:05:07,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18858 transitions. [2025-03-08 02:05:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1995 [2025-03-08 02:05:07,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:07,602 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:07,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:05:07,603 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:07,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 310894808, now seen corresponding path program 1 times [2025-03-08 02:05:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117387118] [2025-03-08 02:05:07,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:07,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1994 statements into 1 equivalence classes. [2025-03-08 02:05:07,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1994 of 1994 statements. [2025-03-08 02:05:07,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:07,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8092 backedges. 5214 proven. 553 refuted. 0 times theorem prover too weak. 2325 trivial. 0 not checked. [2025-03-08 02:05:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:10,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117387118] [2025-03-08 02:05:10,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117387118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:10,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725753498] [2025-03-08 02:05:10,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:10,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:10,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:10,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:10,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:05:11,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1994 statements into 1 equivalence classes. [2025-03-08 02:05:11,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1994 of 1994 statements. [2025-03-08 02:05:11,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:11,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:11,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 2319 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:05:11,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8092 backedges. 4267 proven. 0 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2025-03-08 02:05:11,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725753498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:11,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:05:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050426044] [2025-03-08 02:05:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:11,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:11,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:11,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:11,559 INFO L87 Difference]: Start difference. First operand 18428 states and 18858 transitions. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:12,105 INFO L93 Difference]: Finished difference Result 36854 states and 37719 transitions. [2025-03-08 02:05:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1994 [2025-03-08 02:05:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:12,120 INFO L225 Difference]: With dead ends: 36854 [2025-03-08 02:05:12,120 INFO L226 Difference]: Without dead ends: 18757 [2025-03-08 02:05:12,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2001 GetRequests, 1996 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:12,132 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:12,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 427 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-03-08 02:05:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18428. [2025-03-08 02:05:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0233353231670919) internal successors, (18857), 18427 states have internal predecessors, (18857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18857 transitions. [2025-03-08 02:05:12,251 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18857 transitions. Word has length 1994 [2025-03-08 02:05:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:12,252 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18857 transitions. [2025-03-08 02:05:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18857 transitions. [2025-03-08 02:05:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2079 [2025-03-08 02:05:12,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:12,276 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:12,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:05:12,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:12,477 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:12,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash -230628197, now seen corresponding path program 1 times [2025-03-08 02:05:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009368623] [2025-03-08 02:05:12,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:12,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2078 statements into 1 equivalence classes. [2025-03-08 02:05:12,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2078 of 2078 statements. [2025-03-08 02:05:12,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:12,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 6544 proven. 153 refuted. 0 times theorem prover too weak. 2615 trivial. 0 not checked. [2025-03-08 02:05:14,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009368623] [2025-03-08 02:05:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009368623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395588351] [2025-03-08 02:05:14,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:14,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:14,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:14,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:14,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:05:14,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2078 statements into 1 equivalence classes. [2025-03-08 02:05:14,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2078 of 2078 statements. [2025-03-08 02:05:14,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:14,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:14,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 2411 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:05:14,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 5425 proven. 0 refuted. 0 times theorem prover too weak. 3887 trivial. 0 not checked. [2025-03-08 02:05:15,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:15,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395588351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:15,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:15,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:05:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056409576] [2025-03-08 02:05:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:15,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:15,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:15,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:15,094 INFO L87 Difference]: Start difference. First operand 18428 states and 18857 transitions. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:15,791 INFO L93 Difference]: Finished difference Result 38170 states and 39105 transitions. [2025-03-08 02:05:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 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 2078 [2025-03-08 02:05:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:15,808 INFO L225 Difference]: With dead ends: 38170 [2025-03-08 02:05:15,808 INFO L226 Difference]: Without dead ends: 20073 [2025-03-08 02:05:15,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2083 GetRequests, 2078 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:15,820 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:15,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 426 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:05:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-08 02:05:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 19744. [2025-03-08 02:05:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0230967938003344) internal successors, (20199), 19743 states have internal predecessors, (20199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20199 transitions. [2025-03-08 02:05:16,021 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20199 transitions. Word has length 2078 [2025-03-08 02:05:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20199 transitions. [2025-03-08 02:05:16,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20199 transitions. [2025-03-08 02:05:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2110 [2025-03-08 02:05:16,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:16,073 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:16,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:05:16,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:16,273 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:16,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash 733419051, now seen corresponding path program 1 times [2025-03-08 02:05:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634357364] [2025-03-08 02:05:16,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:16,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2109 statements into 1 equivalence classes. [2025-03-08 02:05:16,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2109 of 2109 statements. [2025-03-08 02:05:16,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:16,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9742 backedges. 7145 proven. 91 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2025-03-08 02:05:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634357364] [2025-03-08 02:05:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634357364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102614819] [2025-03-08 02:05:18,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:18,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:18,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:18,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:18,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:05:18,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2109 statements into 1 equivalence classes. [2025-03-08 02:05:18,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2109 of 2109 statements. [2025-03-08 02:05:18,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:18,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:18,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 2445 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:05:18,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9742 backedges. 5653 proven. 0 refuted. 0 times theorem prover too weak. 4089 trivial. 0 not checked. [2025-03-08 02:05:19,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102614819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:19,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 02:05:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316830613] [2025-03-08 02:05:19,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:19,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:05:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:19,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:05:19,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:05:19,098 INFO L87 Difference]: Start difference. First operand 19744 states and 20199 transitions. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:20,088 INFO L93 Difference]: Finished difference Result 40144 states and 41071 transitions. [2025-03-08 02:05:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:05:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 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 2109 [2025-03-08 02:05:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:20,107 INFO L225 Difference]: With dead ends: 40144 [2025-03-08 02:05:20,107 INFO L226 Difference]: Without dead ends: 20731 [2025-03-08 02:05:20,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2114 GetRequests, 2108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:05:20,119 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 730 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:20,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 58 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:05:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-03-08 02:05:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 19744. [2025-03-08 02:05:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.023046142936737) internal successors, (20198), 19743 states have internal predecessors, (20198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20198 transitions. [2025-03-08 02:05:20,323 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20198 transitions. Word has length 2109 [2025-03-08 02:05:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:20,324 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20198 transitions. [2025-03-08 02:05:20,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20198 transitions. [2025-03-08 02:05:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2025-03-08 02:05:20,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:20,353 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:20,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:05:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 02:05:20,554 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash 433972216, now seen corresponding path program 1 times [2025-03-08 02:05:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:20,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704686747] [2025-03-08 02:05:20,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:20,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2238 statements into 1 equivalence classes. [2025-03-08 02:05:20,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2238 of 2238 statements. [2025-03-08 02:05:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9695 backedges. 6094 proven. 0 refuted. 0 times theorem prover too weak. 3601 trivial. 0 not checked. [2025-03-08 02:05:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704686747] [2025-03-08 02:05:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704686747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:22,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:22,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551953556] [2025-03-08 02:05:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:22,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:22,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:22,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:22,503 INFO L87 Difference]: Start difference. First operand 19744 states and 20198 transitions. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:23,110 INFO L93 Difference]: Finished difference Result 42776 states and 43743 transitions. [2025-03-08 02:05:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:23,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 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 2238 [2025-03-08 02:05:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:23,131 INFO L225 Difference]: With dead ends: 42776 [2025-03-08 02:05:23,131 INFO L226 Difference]: Without dead ends: 23363 [2025-03-08 02:05:23,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:23,143 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:23,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 406 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23363 states. [2025-03-08 02:05:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23363 to 20073. [2025-03-08 02:05:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.022120366679952) internal successors, (20516), 20072 states have internal predecessors, (20516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20516 transitions. [2025-03-08 02:05:23,289 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20516 transitions. Word has length 2238 [2025-03-08 02:05:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20516 transitions. [2025-03-08 02:05:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20516 transitions. [2025-03-08 02:05:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2025-03-08 02:05:23,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:23,317 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:23,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:05:23,317 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 54955918, now seen corresponding path program 1 times [2025-03-08 02:05:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:23,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217330465] [2025-03-08 02:05:23,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:23,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2238 statements into 1 equivalence classes. [2025-03-08 02:05:23,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2238 of 2238 statements. [2025-03-08 02:05:23,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:23,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10456 backedges. 7629 proven. 91 refuted. 0 times theorem prover too weak. 2736 trivial. 0 not checked. [2025-03-08 02:05:25,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217330465] [2025-03-08 02:05:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217330465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931818307] [2025-03-08 02:05:25,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:25,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:25,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 02:05:25,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2238 statements into 1 equivalence classes. [2025-03-08 02:05:25,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2238 of 2238 statements. [2025-03-08 02:05:25,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:25,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:25,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 2574 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:05:25,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10456 backedges. 5952 proven. 0 refuted. 0 times theorem prover too weak. 4504 trivial. 0 not checked. [2025-03-08 02:05:26,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931818307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:05:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28621828] [2025-03-08 02:05:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:26,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:26,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:26,293 INFO L87 Difference]: Start difference. First operand 20073 states and 20516 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:26,908 INFO L93 Difference]: Finished difference Result 42776 states and 43721 transitions. [2025-03-08 02:05:26,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:26,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 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 2238 [2025-03-08 02:05:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:26,930 INFO L225 Difference]: With dead ends: 42776 [2025-03-08 02:05:26,930 INFO L226 Difference]: Without dead ends: 23034 [2025-03-08 02:05:26,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2243 GetRequests, 2238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:05:26,944 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 255 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:26,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 417 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23034 states. [2025-03-08 02:05:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23034 to 20402. [2025-03-08 02:05:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.0224498799078476) internal successors, (20859), 20401 states have internal predecessors, (20859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 20859 transitions. [2025-03-08 02:05:27,104 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 20859 transitions. Word has length 2238 [2025-03-08 02:05:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:27,105 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 20859 transitions. [2025-03-08 02:05:27,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 20859 transitions. [2025-03-08 02:05:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2320 [2025-03-08 02:05:27,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:27,134 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:27,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 02:05:27,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:27,334 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:27,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1839003116, now seen corresponding path program 1 times [2025-03-08 02:05:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:27,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714110651] [2025-03-08 02:05:27,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:27,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:27,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2319 statements into 1 equivalence classes. [2025-03-08 02:05:27,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2319 of 2319 statements. [2025-03-08 02:05:27,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10691 backedges. 7812 proven. 91 refuted. 0 times theorem prover too weak. 2788 trivial. 0 not checked. [2025-03-08 02:05:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714110651] [2025-03-08 02:05:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714110651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669231400] [2025-03-08 02:05:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:29,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:29,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:29,662 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:29,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 02:05:29,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2319 statements into 1 equivalence classes. [2025-03-08 02:05:30,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2319 of 2319 statements. [2025-03-08 02:05:30,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:30,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:30,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:05:30,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10691 backedges. 6472 proven. 0 refuted. 0 times theorem prover too weak. 4219 trivial. 0 not checked. [2025-03-08 02:05:30,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:05:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669231400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:30,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:05:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 02:05:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037822484] [2025-03-08 02:05:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:30,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:05:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:30,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:05:30,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:05:30,424 INFO L87 Difference]: Start difference. First operand 20402 states and 20859 transitions. Second operand has 4 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:31,180 INFO L93 Difference]: Finished difference Result 40802 states and 41719 transitions. [2025-03-08 02:05:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:05:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 0 states have call successors, (0), 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 2319 [2025-03-08 02:05:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:31,199 INFO L225 Difference]: With dead ends: 40802 [2025-03-08 02:05:31,199 INFO L226 Difference]: Without dead ends: 20731 [2025-03-08 02:05:31,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2324 GetRequests, 2318 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:05:31,211 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 467 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:31,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 59 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:05:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-03-08 02:05:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 19744. [2025-03-08 02:05:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0222357291191815) internal successors, (20182), 19743 states have internal predecessors, (20182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20182 transitions. [2025-03-08 02:05:31,356 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20182 transitions. Word has length 2319 [2025-03-08 02:05:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:31,357 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20182 transitions. [2025-03-08 02:05:31,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20182 transitions. [2025-03-08 02:05:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2025-03-08 02:05:31,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:31,385 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:31,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 02:05:31,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:31,586 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:31,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash -737079637, now seen corresponding path program 1 times [2025-03-08 02:05:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73250910] [2025-03-08 02:05:31,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:31,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2331 statements into 1 equivalence classes. [2025-03-08 02:05:31,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2331 of 2331 statements. [2025-03-08 02:05:31,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9867 backedges. 6791 proven. 0 refuted. 0 times theorem prover too weak. 3076 trivial. 0 not checked. [2025-03-08 02:05:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:34,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73250910] [2025-03-08 02:05:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73250910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:34,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:05:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276364457] [2025-03-08 02:05:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:34,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:05:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:34,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:05:34,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:05:34,598 INFO L87 Difference]: Start difference. First operand 19744 states and 20182 transitions. Second operand has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:35,512 INFO L93 Difference]: Finished difference Result 41789 states and 42703 transitions. [2025-03-08 02:05:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:05:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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 2331 [2025-03-08 02:05:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:35,533 INFO L225 Difference]: With dead ends: 41789 [2025-03-08 02:05:35,533 INFO L226 Difference]: Without dead ends: 22376 [2025-03-08 02:05:35,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:05:35,547 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 310 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:35,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 43 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:05:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22376 states. [2025-03-08 02:05:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22376 to 20731. [2025-03-08 02:05:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.0213699951760733) internal successors, (21173), 20730 states have internal predecessors, (21173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 21173 transitions. [2025-03-08 02:05:35,717 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 21173 transitions. Word has length 2331 [2025-03-08 02:05:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:35,718 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 21173 transitions. [2025-03-08 02:05:35,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 21173 transitions. [2025-03-08 02:05:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2449 [2025-03-08 02:05:35,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:35,796 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:05:35,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 02:05:35,796 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:35,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2077055489, now seen corresponding path program 1 times [2025-03-08 02:05:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657804482] [2025-03-08 02:05:35,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:35,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2448 statements into 1 equivalence classes. [2025-03-08 02:05:35,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2448 of 2448 statements. [2025-03-08 02:05:35,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:35,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11098 backedges. 7594 proven. 574 refuted. 0 times theorem prover too weak. 2930 trivial. 0 not checked. [2025-03-08 02:05:40,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657804482] [2025-03-08 02:05:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657804482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205075899] [2025-03-08 02:05:40,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:05:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:05:40,215 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:05:40,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 02:05:40,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2448 statements into 1 equivalence classes. [2025-03-08 02:05:40,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2448 of 2448 statements. [2025-03-08 02:05:40,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:40,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:40,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:05:40,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:05:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11098 backedges. 7363 proven. 79 refuted. 0 times theorem prover too weak. 3656 trivial. 0 not checked. [2025-03-08 02:05:41,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:05:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11098 backedges. 7048 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-08 02:05:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205075899] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:05:42,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:05:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-08 02:05:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557870743] [2025-03-08 02:05:42,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:42,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:42,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:42,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:42,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:05:42,403 INFO L87 Difference]: Start difference. First operand 20731 states and 21173 transitions. Second operand has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:05:43,018 INFO L93 Difference]: Finished difference Result 41789 states and 42678 transitions. [2025-03-08 02:05:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:05:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 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 2448 [2025-03-08 02:05:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:05:43,039 INFO L225 Difference]: With dead ends: 41789 [2025-03-08 02:05:43,039 INFO L226 Difference]: Without dead ends: 21389 [2025-03-08 02:05:43,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4902 GetRequests, 4895 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:05:43,052 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 90 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:05:43,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 21 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:05:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21389 states. [2025-03-08 02:05:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 20402. [2025-03-08 02:05:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20402 states, 20401 states have (on average 1.018969658350081) internal successors, (20788), 20401 states have internal predecessors, (20788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 20788 transitions. [2025-03-08 02:05:43,214 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 20788 transitions. Word has length 2448 [2025-03-08 02:05:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:05:43,214 INFO L471 AbstractCegarLoop]: Abstraction has 20402 states and 20788 transitions. [2025-03-08 02:05:43,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:05:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 20788 transitions. [2025-03-08 02:05:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2457 [2025-03-08 02:05:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:05:43,247 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:05:43,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 02:05:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 02:05:43,447 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:05:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:05:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1904169579, now seen corresponding path program 1 times [2025-03-08 02:05:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:05:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963325018] [2025-03-08 02:05:43,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:05:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:05:43,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2456 statements into 1 equivalence classes. [2025-03-08 02:05:43,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2456 of 2456 statements. [2025-03-08 02:05:43,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:05:43,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:05:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11562 backedges. 4744 proven. 0 refuted. 0 times theorem prover too weak. 6818 trivial. 0 not checked. [2025-03-08 02:05:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:05:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963325018] [2025-03-08 02:05:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963325018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:05:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:05:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:05:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686526383] [2025-03-08 02:05:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:05:45,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:05:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:05:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:05:45,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:05:45,114 INFO L87 Difference]: Start difference. First operand 20402 states and 20788 transitions. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)