./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label07.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 4d9630e6a4c9245b15f4f309d83464d257ca20ee86c7917689a5d5471eca79bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:57:40,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:57:40,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:57:40,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:57:40,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:57:40,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:57:40,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:57:40,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:57:40,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:57:40,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:57:40,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:57:40,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:57:40,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:57:40,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:57:40,171 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:57:40,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:57:40,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:57:40,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:57:40,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:57:40,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:57:40,173 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 -> 4d9630e6a4c9245b15f4f309d83464d257ca20ee86c7917689a5d5471eca79bd [2025-03-03 10:57:40,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:57:40,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:57:40,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:57:40,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:57:40,389 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:57:40,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label07.c [2025-03-03 10:57:41,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d802e597a/cdebc6c800f1407e81a08d91d95e019f/FLAGad11236bb [2025-03-03 10:57:41,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:57:41,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label07.c [2025-03-03 10:57:41,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d802e597a/cdebc6c800f1407e81a08d91d95e019f/FLAGad11236bb [2025-03-03 10:57:42,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d802e597a/cdebc6c800f1407e81a08d91d95e019f [2025-03-03 10:57:42,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:57:42,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:57:42,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:57:42,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:57:42,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:57:42,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:42,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75854446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42, skipping insertion in model container [2025-03-03 10:57:42,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:42,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:57:42,231 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label07.c[4239,4252] [2025-03-03 10:57:42,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:57:42,632 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:57:42,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label07.c[4239,4252] [2025-03-03 10:57:42,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:57:42,843 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:57:42,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42 WrapperNode [2025-03-03 10:57:42,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:57:42,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:57:42,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:57:42,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:57:42,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:42,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,058 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 10:57:43,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:57:43,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:57:43,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:57:43,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:57:43,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:57:43,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:57:43,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:57:43,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:57:43,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:57:43,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (1/1) ... [2025-03-03 10:57:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:57:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:57:43,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:57:43,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:57:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:57:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:57:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:57:43,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:57:43,551 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:57:43,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:57:45,980 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 10:57:46,135 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 10:57:46,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:57:46,160 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:57:46,160 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:57:46,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:46 BoogieIcfgContainer [2025-03-03 10:57:46,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:57:46,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:57:46,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:57:46,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:57:46,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:57:42" (1/3) ... [2025-03-03 10:57:46,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d7342e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:46, skipping insertion in model container [2025-03-03 10:57:46,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:57:42" (2/3) ... [2025-03-03 10:57:46,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d7342e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:57:46, skipping insertion in model container [2025-03-03 10:57:46,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:57:46" (3/3) ... [2025-03-03 10:57:46,168 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label07.c [2025-03-03 10:57:46,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:57:46,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label07.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:57:46,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:57:46,239 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;@7722bc0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:57:46,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:57:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 10:57:46,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:46,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:46,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:46,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1375694546, now seen corresponding path program 1 times [2025-03-03 10:57:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568883373] [2025-03-03 10:57:46,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:46,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 10:57:46,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 10:57:46,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:46,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:46,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568883373] [2025-03-03 10:57:46,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568883373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:46,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:46,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894139102] [2025-03-03 10:57:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:46,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:46,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:46,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:46,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:46,465 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:48,361 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-03-03 10:57:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-03 10:57:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:48,380 INFO L225 Difference]: With dead ends: 1642 [2025-03-03 10:57:48,380 INFO L226 Difference]: Without dead ends: 975 [2025-03-03 10:57:48,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:48,386 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 463 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:48,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:57:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-03 10:57:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-03-03 10:57:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-03-03 10:57:48,468 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 27 [2025-03-03 10:57:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:48,468 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-03-03 10:57:48,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-03-03 10:57:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 10:57:48,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:48,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:48,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:57:48,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 711632517, now seen corresponding path program 1 times [2025-03-03 10:57:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572531833] [2025-03-03 10:57:48,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:48,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 10:57:48,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 10:57:48,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:48,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572531833] [2025-03-03 10:57:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572531833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949746088] [2025-03-03 10:57:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:48,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:48,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:48,743 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:50,477 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-03-03 10:57:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-03 10:57:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:50,484 INFO L225 Difference]: With dead ends: 2814 [2025-03-03 10:57:50,484 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 10:57:50,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:50,487 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 464 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:50,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:57:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 10:57:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-03-03 10:57:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-03-03 10:57:50,524 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 97 [2025-03-03 10:57:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:50,524 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-03-03 10:57:50,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-03-03 10:57:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 10:57:50,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:50,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:50,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:57:50,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:50,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash -543851856, now seen corresponding path program 1 times [2025-03-03 10:57:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509827327] [2025-03-03 10:57:50,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:50,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 10:57:50,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 10:57:50,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:50,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509827327] [2025-03-03 10:57:50,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509827327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:50,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:57:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776973844] [2025-03-03 10:57:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:50,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:50,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:50,728 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:52,359 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2025-03-03 10:57:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-03 10:57:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:52,367 INFO L225 Difference]: With dead ends: 5395 [2025-03-03 10:57:52,367 INFO L226 Difference]: Without dead ends: 2701 [2025-03-03 10:57:52,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:52,370 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:52,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:57:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-03 10:57:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2025-03-03 10:57:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2025-03-03 10:57:52,410 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 119 [2025-03-03 10:57:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:52,410 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2025-03-03 10:57:52,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2025-03-03 10:57:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 10:57:52,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:52,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:52,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:57:52,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1404667017, now seen corresponding path program 1 times [2025-03-03 10:57:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:52,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609782527] [2025-03-03 10:57:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:52,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 10:57:52,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 10:57:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:57:52,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:52,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609782527] [2025-03-03 10:57:52,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609782527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:52,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:52,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545772290] [2025-03-03 10:57:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:52,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:52,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:52,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:52,612 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:53,922 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2025-03-03 10:57:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:53,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2025-03-03 10:57:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:53,933 INFO L225 Difference]: With dead ends: 7108 [2025-03-03 10:57:53,933 INFO L226 Difference]: Without dead ends: 4409 [2025-03-03 10:57:53,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:53,936 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:53,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:57:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-03-03 10:57:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2025-03-03 10:57:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2025-03-03 10:57:53,987 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 179 [2025-03-03 10:57:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:53,987 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2025-03-03 10:57:53,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2025-03-03 10:57:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 10:57:53,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:53,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:53,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:57:53,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:53,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2087226510, now seen corresponding path program 1 times [2025-03-03 10:57:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119490968] [2025-03-03 10:57:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:54,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 10:57:54,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 10:57:54,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:54,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:57:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119490968] [2025-03-03 10:57:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119490968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:54,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209572912] [2025-03-03 10:57:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:54,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:54,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:54,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:54,122 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:55,485 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2025-03-03 10:57:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 181 [2025-03-03 10:57:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:55,500 INFO L225 Difference]: With dead ends: 10936 [2025-03-03 10:57:55,500 INFO L226 Difference]: Without dead ends: 6528 [2025-03-03 10:57:55,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:55,505 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 424 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:55,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:57:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2025-03-03 10:57:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2025-03-03 10:57:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2025-03-03 10:57:55,561 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 181 [2025-03-03 10:57:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:55,561 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2025-03-03 10:57:55,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2025-03-03 10:57:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 10:57:55,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:55,563 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:55,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:57:55,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1207290490, now seen corresponding path program 1 times [2025-03-03 10:57:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534127446] [2025-03-03 10:57:55,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:55,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 10:57:55,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 10:57:55,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:55,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:57:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534127446] [2025-03-03 10:57:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534127446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042743910] [2025-03-03 10:57:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:55,785 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:57,020 INFO L93 Difference]: Finished difference Result 10045 states and 11706 transitions. [2025-03-03 10:57:57,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:57,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-03-03 10:57:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:57,031 INFO L225 Difference]: With dead ends: 10045 [2025-03-03 10:57:57,031 INFO L226 Difference]: Without dead ends: 5665 [2025-03-03 10:57:57,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:57,034 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 409 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:57,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:57:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-03-03 10:57:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234. [2025-03-03 10:57:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions. [2025-03-03 10:57:57,084 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 247 [2025-03-03 10:57:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:57,084 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions. [2025-03-03 10:57:57,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions. [2025-03-03 10:57:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 10:57:57,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:57,090 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:57,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:57:57,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:57,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1175657300, now seen corresponding path program 1 times [2025-03-03 10:57:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:57,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680366248] [2025-03-03 10:57:57,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:57,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 10:57:57,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 10:57:57,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:57,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:57:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680366248] [2025-03-03 10:57:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680366248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:57,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:57,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956799896] [2025-03-03 10:57:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:57,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:57,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:57,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:57,364 INFO L87 Difference]: Start difference. First operand 5234 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:58,845 INFO L93 Difference]: Finished difference Result 13051 states and 15223 transitions. [2025-03-03 10:57:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:58,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 259 [2025-03-03 10:57:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:58,863 INFO L225 Difference]: With dead ends: 13051 [2025-03-03 10:57:58,865 INFO L226 Difference]: Without dead ends: 7391 [2025-03-03 10:57:58,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:58,871 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 495 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:58,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 629 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:57:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2025-03-03 10:57:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 6959. [2025-03-03 10:57:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6959 states, 6958 states have (on average 1.1636964645012935) internal successors, (8097), 6958 states have internal predecessors, (8097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 8097 transitions. [2025-03-03 10:57:58,968 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 8097 transitions. Word has length 259 [2025-03-03 10:57:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:58,969 INFO L471 AbstractCegarLoop]: Abstraction has 6959 states and 8097 transitions. [2025-03-03 10:57:58,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:57:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 8097 transitions. [2025-03-03 10:57:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 10:57:58,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:58,971 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:58,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:57:58,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:58,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1158049963, now seen corresponding path program 1 times [2025-03-03 10:57:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105606417] [2025-03-03 10:57:58,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:58,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 10:57:59,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 10:57:59,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:59,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:57:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105606417] [2025-03-03 10:57:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105606417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820490783] [2025-03-03 10:57:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:59,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:59,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:59,107 INFO L87 Difference]: Start difference. First operand 6959 states and 8097 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:00,317 INFO L93 Difference]: Finished difference Result 17316 states and 20393 transitions. [2025-03-03 10:58:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-03 10:58:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:00,332 INFO L225 Difference]: With dead ends: 17316 [2025-03-03 10:58:00,332 INFO L226 Difference]: Without dead ends: 10359 [2025-03-03 10:58:00,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:00,339 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 379 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:00,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 841 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10359 states. [2025-03-03 10:58:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10359 to 9509. [2025-03-03 10:58:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9509 states, 9508 states have (on average 1.141459823306689) internal successors, (10853), 9508 states have internal predecessors, (10853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9509 states to 9509 states and 10853 transitions. [2025-03-03 10:58:00,415 INFO L78 Accepts]: Start accepts. Automaton has 9509 states and 10853 transitions. Word has length 264 [2025-03-03 10:58:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:00,415 INFO L471 AbstractCegarLoop]: Abstraction has 9509 states and 10853 transitions. [2025-03-03 10:58:00,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 9509 states and 10853 transitions. [2025-03-03 10:58:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 10:58:00,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:00,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:00,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:58:00,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash 94404945, now seen corresponding path program 1 times [2025-03-03 10:58:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612184149] [2025-03-03 10:58:00,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:00,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 10:58:00,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 10:58:00,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:00,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:58:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612184149] [2025-03-03 10:58:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612184149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782639967] [2025-03-03 10:58:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:00,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:00,736 INFO L87 Difference]: Start difference. First operand 9509 states and 10853 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:02,005 INFO L93 Difference]: Finished difference Result 22432 states and 25678 transitions. [2025-03-03 10:58:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 282 [2025-03-03 10:58:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:02,026 INFO L225 Difference]: With dead ends: 22432 [2025-03-03 10:58:02,026 INFO L226 Difference]: Without dead ends: 12493 [2025-03-03 10:58:02,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:02,033 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 444 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:02,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 295 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2025-03-03 10:58:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 11637. [2025-03-03 10:58:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11637 states, 11636 states have (on average 1.1473014781711928) internal successors, (13350), 11636 states have internal predecessors, (13350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11637 states to 11637 states and 13350 transitions. [2025-03-03 10:58:02,126 INFO L78 Accepts]: Start accepts. Automaton has 11637 states and 13350 transitions. Word has length 282 [2025-03-03 10:58:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:02,127 INFO L471 AbstractCegarLoop]: Abstraction has 11637 states and 13350 transitions. [2025-03-03 10:58:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 11637 states and 13350 transitions. [2025-03-03 10:58:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-03 10:58:02,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:02,130 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:02,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:58:02,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:02,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:02,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1631325402, now seen corresponding path program 1 times [2025-03-03 10:58:02,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:02,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453827619] [2025-03-03 10:58:02,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:02,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 10:58:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 10:58:02,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:02,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 227 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:58:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453827619] [2025-03-03 10:58:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453827619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347834770] [2025-03-03 10:58:02,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:02,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:02,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:02,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:58:02,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:58:02,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 10:58:02,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 10:58:02,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:02,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:02,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:58:02,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 192 proven. 82 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:58:03,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:58:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 192 proven. 82 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:58:03,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347834770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:58:03,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:58:03,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-03 10:58:03,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122171430] [2025-03-03 10:58:03,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:58:03,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:58:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:03,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:58:03,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:58:03,859 INFO L87 Difference]: Start difference. First operand 11637 states and 13350 transitions. Second operand has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:13,527 INFO L93 Difference]: Finished difference Result 70610 states and 80045 transitions. [2025-03-03 10:58:13,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 10:58:13,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 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 287 [2025-03-03 10:58:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:13,598 INFO L225 Difference]: With dead ends: 70610 [2025-03-03 10:58:13,598 INFO L226 Difference]: Without dead ends: 54718 [2025-03-03 10:58:13,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-03 10:58:13,615 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 8996 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 12918 mSolverCounterSat, 2659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8996 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 15577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2659 IncrementalHoareTripleChecker+Valid, 12918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:13,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8996 Valid, 624 Invalid, 15577 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2659 Valid, 12918 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-03-03 10:58:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54718 states. [2025-03-03 10:58:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54718 to 46983. [2025-03-03 10:58:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46983 states, 46982 states have (on average 1.1231322634200331) internal successors, (52767), 46982 states have internal predecessors, (52767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46983 states to 46983 states and 52767 transitions. [2025-03-03 10:58:14,185 INFO L78 Accepts]: Start accepts. Automaton has 46983 states and 52767 transitions. Word has length 287 [2025-03-03 10:58:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:14,185 INFO L471 AbstractCegarLoop]: Abstraction has 46983 states and 52767 transitions. [2025-03-03 10:58:14,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 46983 states and 52767 transitions. [2025-03-03 10:58:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-03 10:58:14,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:14,190 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:14,198 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-03 10:58:14,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:58:14,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:14,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1668142770, now seen corresponding path program 1 times [2025-03-03 10:58:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:14,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016588929] [2025-03-03 10:58:14,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:14,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 10:58:14,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 10:58:14,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 454 proven. 80 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:58:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:15,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016588929] [2025-03-03 10:58:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016588929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549450696] [2025-03-03 10:58:15,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:15,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:15,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:15,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:58:15,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:58:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 10:58:15,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 10:58:15,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:15,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:15,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:58:15,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:58:15,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:58:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549450696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:15,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:58:15,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 10:58:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001224812] [2025-03-03 10:58:15,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:15,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:15,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:15,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:15,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:58:15,694 INFO L87 Difference]: Start difference. First operand 46983 states and 52767 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:17,336 INFO L93 Difference]: Finished difference Result 93539 states and 105092 transitions. [2025-03-03 10:58:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 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 369 [2025-03-03 10:58:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:17,386 INFO L225 Difference]: With dead ends: 93539 [2025-03-03 10:58:17,387 INFO L226 Difference]: Without dead ends: 47408 [2025-03-03 10:58:17,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:58:17,417 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 842 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:17,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 353 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:58:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47408 states. [2025-03-03 10:58:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47408 to 46983. [2025-03-03 10:58:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46983 states, 46982 states have (on average 1.1223660125154313) internal successors, (52731), 46982 states have internal predecessors, (52731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46983 states to 46983 states and 52731 transitions. [2025-03-03 10:58:17,962 INFO L78 Accepts]: Start accepts. Automaton has 46983 states and 52731 transitions. Word has length 369 [2025-03-03 10:58:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 46983 states and 52731 transitions. [2025-03-03 10:58:17,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 46983 states and 52731 transitions. [2025-03-03 10:58:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-03 10:58:17,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:17,967 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:17,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:58:18,168 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,SelfDestructingSolverStorable10 [2025-03-03 10:58:18,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash 876049936, now seen corresponding path program 1 times [2025-03-03 10:58:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:18,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575940251] [2025-03-03 10:58:18,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:18,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 10:58:18,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 10:58:18,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:18,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 205 proven. 73 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:58:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575940251] [2025-03-03 10:58:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575940251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:18,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959938882] [2025-03-03 10:58:18,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:18,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:58:18,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:58:18,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 10:58:18,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 10:58:18,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:18,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:18,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:58:18,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 205 proven. 73 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:58:18,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:58:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:58:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959938882] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:58:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 10:58:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787767046] [2025-03-03 10:58:19,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:19,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:19,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:19,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:58:19,097 INFO L87 Difference]: Start difference. First operand 46983 states and 52731 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:21,288 INFO L93 Difference]: Finished difference Result 116967 states and 132134 transitions. [2025-03-03 10:58:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:21,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 390 [2025-03-03 10:58:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:21,356 INFO L225 Difference]: With dead ends: 116967 [2025-03-03 10:58:21,356 INFO L226 Difference]: Without dead ends: 70411 [2025-03-03 10:58:21,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:58:21,389 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 856 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:21,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 188 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:58:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70411 states. [2025-03-03 10:58:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70411 to 67857. [2025-03-03 10:58:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67857 states, 67856 states have (on average 1.1327074982315493) internal successors, (76861), 67856 states have internal predecessors, (76861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67857 states to 67857 states and 76861 transitions. [2025-03-03 10:58:22,249 INFO L78 Accepts]: Start accepts. Automaton has 67857 states and 76861 transitions. Word has length 390 [2025-03-03 10:58:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:22,249 INFO L471 AbstractCegarLoop]: Abstraction has 67857 states and 76861 transitions. [2025-03-03 10:58:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67857 states and 76861 transitions. [2025-03-03 10:58:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-03-03 10:58:22,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:22,254 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:22,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:58:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:22,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -822851614, now seen corresponding path program 1 times [2025-03-03 10:58:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216698623] [2025-03-03 10:58:22,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:22,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-03-03 10:58:22,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-03-03 10:58:22,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:22,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:22,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216698623] [2025-03-03 10:58:22,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216698623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:22,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631865506] [2025-03-03 10:58:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:22,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:22,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:22,691 INFO L87 Difference]: Start difference. First operand 67857 states and 76861 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:24,207 INFO L93 Difference]: Finished difference Result 134428 states and 152268 transitions. [2025-03-03 10:58:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 396 [2025-03-03 10:58:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:24,274 INFO L225 Difference]: With dead ends: 134428 [2025-03-03 10:58:24,274 INFO L226 Difference]: Without dead ends: 66573 [2025-03-03 10:58:24,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:24,296 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 477 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:24,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 732 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:58:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66573 states. [2025-03-03 10:58:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66573 to 66145. [2025-03-03 10:58:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66145 states, 66144 states have (on average 1.0991473149492017) internal successors, (72702), 66144 states have internal predecessors, (72702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66145 states to 66145 states and 72702 transitions. [2025-03-03 10:58:24,993 INFO L78 Accepts]: Start accepts. Automaton has 66145 states and 72702 transitions. Word has length 396 [2025-03-03 10:58:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:24,994 INFO L471 AbstractCegarLoop]: Abstraction has 66145 states and 72702 transitions. [2025-03-03 10:58:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 66145 states and 72702 transitions. [2025-03-03 10:58:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 10:58:25,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:25,003 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:25,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:58:25,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:25,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1674105601, now seen corresponding path program 1 times [2025-03-03 10:58:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286514901] [2025-03-03 10:58:25,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:25,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:25,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 10:58:25,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 10:58:25,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-03-03 10:58:25,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286514901] [2025-03-03 10:58:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286514901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:25,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567771825] [2025-03-03 10:58:25,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:25,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:25,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:25,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:25,136 INFO L87 Difference]: Start difference. First operand 66145 states and 72702 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:26,635 INFO L93 Difference]: Finished difference Result 142495 states and 156995 transitions. [2025-03-03 10:58:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 456 [2025-03-03 10:58:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:26,721 INFO L225 Difference]: With dead ends: 142495 [2025-03-03 10:58:26,721 INFO L226 Difference]: Without dead ends: 75923 [2025-03-03 10:58:26,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:26,761 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 468 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:26,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 733 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75923 states. [2025-03-03 10:58:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75923 to 73794. [2025-03-03 10:58:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73794 states, 73793 states have (on average 1.0937893838168933) internal successors, (80714), 73793 states have internal predecessors, (80714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73794 states to 73794 states and 80714 transitions. [2025-03-03 10:58:27,530 INFO L78 Accepts]: Start accepts. Automaton has 73794 states and 80714 transitions. Word has length 456 [2025-03-03 10:58:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:27,531 INFO L471 AbstractCegarLoop]: Abstraction has 73794 states and 80714 transitions. [2025-03-03 10:58:27,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 73794 states and 80714 transitions. [2025-03-03 10:58:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 10:58:27,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:27,546 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:27,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:58:27,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:27,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1771302830, now seen corresponding path program 1 times [2025-03-03 10:58:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173496936] [2025-03-03 10:58:27,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:27,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 10:58:27,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 10:58:27,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:27,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:27,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173496936] [2025-03-03 10:58:27,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173496936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:27,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:27,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:58:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472456816] [2025-03-03 10:58:27,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:27,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:27,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:27,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:58:27,979 INFO L87 Difference]: Start difference. First operand 73794 states and 80714 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:30,465 INFO L93 Difference]: Finished difference Result 190197 states and 207050 transitions. [2025-03-03 10:58:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:30,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 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 528 [2025-03-03 10:58:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:30,592 INFO L225 Difference]: With dead ends: 190197 [2025-03-03 10:58:30,592 INFO L226 Difference]: Without dead ends: 116405 [2025-03-03 10:58:30,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:58:30,640 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 788 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:30,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 202 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:58:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116405 states. [2025-03-03 10:58:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116405 to 96397. [2025-03-03 10:58:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96397 states, 96396 states have (on average 1.089080459770115) internal successors, (104983), 96396 states have internal predecessors, (104983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96397 states to 96397 states and 104983 transitions. [2025-03-03 10:58:31,921 INFO L78 Accepts]: Start accepts. Automaton has 96397 states and 104983 transitions. Word has length 528 [2025-03-03 10:58:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:31,922 INFO L471 AbstractCegarLoop]: Abstraction has 96397 states and 104983 transitions. [2025-03-03 10:58:31,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 96397 states and 104983 transitions. [2025-03-03 10:58:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-03 10:58:31,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:31,930 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:31,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:58:31,930 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:31,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash 430100639, now seen corresponding path program 1 times [2025-03-03 10:58:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906008966] [2025-03-03 10:58:31,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:31,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-03 10:58:31,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-03 10:58:31,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:31,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-03 10:58:32,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906008966] [2025-03-03 10:58:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906008966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562521104] [2025-03-03 10:58:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:32,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:32,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:32,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:32,156 INFO L87 Difference]: Start difference. First operand 96397 states and 104983 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:33,736 INFO L93 Difference]: Finished difference Result 208127 states and 227148 transitions. [2025-03-03 10:58:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 530 [2025-03-03 10:58:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:33,865 INFO L225 Difference]: With dead ends: 208127 [2025-03-03 10:58:33,865 INFO L226 Difference]: Without dead ends: 111732 [2025-03-03 10:58:33,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:33,923 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 323 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:33,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 318 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111732 states. [2025-03-03 10:58:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111732 to 105329. [2025-03-03 10:58:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105329 states, 105328 states have (on average 1.076674768342701) internal successors, (113404), 105328 states have internal predecessors, (113404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105329 states to 105329 states and 113404 transitions. [2025-03-03 10:58:35,296 INFO L78 Accepts]: Start accepts. Automaton has 105329 states and 113404 transitions. Word has length 530 [2025-03-03 10:58:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:35,296 INFO L471 AbstractCegarLoop]: Abstraction has 105329 states and 113404 transitions. [2025-03-03 10:58:35,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 105329 states and 113404 transitions. [2025-03-03 10:58:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 10:58:35,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:35,305 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:35,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:58:35,305 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:35,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1531536935, now seen corresponding path program 1 times [2025-03-03 10:58:35,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:35,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371083449] [2025-03-03 10:58:35,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:35,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:35,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 10:58:35,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 10:58:35,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:35,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-03-03 10:58:35,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:35,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371083449] [2025-03-03 10:58:35,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371083449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:35,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:35,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:35,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859665307] [2025-03-03 10:58:35,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:35,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:35,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:35,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:35,956 INFO L87 Difference]: Start difference. First operand 105329 states and 113404 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:37,611 INFO L93 Difference]: Finished difference Result 244797 states and 263394 transitions. [2025-03-03 10:58:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:37,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 543 [2025-03-03 10:58:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:37,759 INFO L225 Difference]: With dead ends: 244797 [2025-03-03 10:58:37,760 INFO L226 Difference]: Without dead ends: 139035 [2025-03-03 10:58:37,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:37,821 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 490 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:37,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 669 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:58:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139035 states. [2025-03-03 10:58:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139035 to 130050. [2025-03-03 10:58:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130050 states, 130049 states have (on average 1.0741259063891302) internal successors, (139689), 130049 states have internal predecessors, (139689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130050 states to 130050 states and 139689 transitions. [2025-03-03 10:58:39,364 INFO L78 Accepts]: Start accepts. Automaton has 130050 states and 139689 transitions. Word has length 543 [2025-03-03 10:58:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:39,365 INFO L471 AbstractCegarLoop]: Abstraction has 130050 states and 139689 transitions. [2025-03-03 10:58:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 130050 states and 139689 transitions. [2025-03-03 10:58:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-03 10:58:39,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:39,374 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:58:39,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:58:39,374 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:39,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash 118360028, now seen corresponding path program 1 times [2025-03-03 10:58:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:39,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131630613] [2025-03-03 10:58:39,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:39,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-03 10:58:39,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-03 10:58:39,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 10:58:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131630613] [2025-03-03 10:58:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131630613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580549887] [2025-03-03 10:58:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:39,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:39,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:39,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:39,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:39,955 INFO L87 Difference]: Start difference. First operand 130050 states and 139689 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:41,633 INFO L93 Difference]: Finished difference Result 266896 states and 286462 transitions. [2025-03-03 10:58:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 555 [2025-03-03 10:58:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:41,783 INFO L225 Difference]: With dead ends: 266896 [2025-03-03 10:58:41,783 INFO L226 Difference]: Without dead ends: 136423 [2025-03-03 10:58:41,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:41,846 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 347 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:41,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 358 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:58:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136423 states. [2025-03-03 10:58:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136423 to 127868. [2025-03-03 10:58:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127868 states, 127867 states have (on average 1.0685399673097828) internal successors, (136631), 127867 states have internal predecessors, (136631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127868 states to 127868 states and 136631 transitions. [2025-03-03 10:58:43,370 INFO L78 Accepts]: Start accepts. Automaton has 127868 states and 136631 transitions. Word has length 555 [2025-03-03 10:58:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:43,370 INFO L471 AbstractCegarLoop]: Abstraction has 127868 states and 136631 transitions. [2025-03-03 10:58:43,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 127868 states and 136631 transitions. [2025-03-03 10:58:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-03 10:58:43,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:43,384 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:43,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:58:43,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:43,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash 414114881, now seen corresponding path program 1 times [2025-03-03 10:58:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:43,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931732456] [2025-03-03 10:58:43,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:43,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-03 10:58:43,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-03 10:58:43,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:43,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:43,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:43,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931732456] [2025-03-03 10:58:43,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931732456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:43,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:43,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57943244] [2025-03-03 10:58:43,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:43,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:43,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:43,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:43,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:43,952 INFO L87 Difference]: Start difference. First operand 127868 states and 136631 transitions. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:45,533 INFO L93 Difference]: Finished difference Result 266819 states and 285110 transitions. [2025-03-03 10:58:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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 589 [2025-03-03 10:58:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:45,680 INFO L225 Difference]: With dead ends: 266819 [2025-03-03 10:58:45,680 INFO L226 Difference]: Without dead ends: 138527 [2025-03-03 10:58:45,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:45,744 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 457 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:45,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 221 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:58:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138527 states. [2025-03-03 10:58:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138527 to 129572. [2025-03-03 10:58:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129572 states, 129571 states have (on average 1.068448958486081) internal successors, (138440), 129571 states have internal predecessors, (138440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129572 states to 129572 states and 138440 transitions. [2025-03-03 10:58:47,393 INFO L78 Accepts]: Start accepts. Automaton has 129572 states and 138440 transitions. Word has length 589 [2025-03-03 10:58:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:47,393 INFO L471 AbstractCegarLoop]: Abstraction has 129572 states and 138440 transitions. [2025-03-03 10:58:47,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 129572 states and 138440 transitions. [2025-03-03 10:58:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-03 10:58:47,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:47,405 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:47,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:58:47,405 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:47,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash 418244150, now seen corresponding path program 1 times [2025-03-03 10:58:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818804222] [2025-03-03 10:58:47,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:47,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 10:58:47,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 10:58:47,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:47,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 406 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:58:48,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818804222] [2025-03-03 10:58:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818804222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687277478] [2025-03-03 10:58:48,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:48,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:48,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:48,190 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-03 10:58:48,191 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-03 10:58:48,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 10:58:48,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 10:58:48,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:48,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:48,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:58:48,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 289 proven. 25 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:48,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:58:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:48,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687277478] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:48,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:58:48,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-03 10:58:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365154188] [2025-03-03 10:58:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:48,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:48,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:48,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:58:48,769 INFO L87 Difference]: Start difference. First operand 129572 states and 138440 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:51,213 INFO L93 Difference]: Finished difference Result 273201 states and 291727 transitions. [2025-03-03 10:58:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:51,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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 594 [2025-03-03 10:58:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:51,379 INFO L225 Difference]: With dead ends: 273201 [2025-03-03 10:58:51,379 INFO L226 Difference]: Without dead ends: 141928 [2025-03-03 10:58:51,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1191 GetRequests, 1184 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:58:51,469 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 999 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:51,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 193 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:58:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141928 states. [2025-03-03 10:58:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141928 to 138935. [2025-03-03 10:58:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138935 states, 138934 states have (on average 1.0681258727165417) internal successors, (148399), 138934 states have internal predecessors, (148399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138935 states to 138935 states and 148399 transitions. [2025-03-03 10:58:53,257 INFO L78 Accepts]: Start accepts. Automaton has 138935 states and 148399 transitions. Word has length 594 [2025-03-03 10:58:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:53,258 INFO L471 AbstractCegarLoop]: Abstraction has 138935 states and 148399 transitions. [2025-03-03 10:58:53,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 138935 states and 148399 transitions. [2025-03-03 10:58:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-03 10:58:53,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:53,270 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:53,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:58:53,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:53,471 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:53,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1374364404, now seen corresponding path program 1 times [2025-03-03 10:58:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176186706] [2025-03-03 10:58:53,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:53,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-03 10:58:53,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-03 10:58:53,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:53,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2025-03-03 10:58:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176186706] [2025-03-03 10:58:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176186706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:53,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:53,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:58:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512737827] [2025-03-03 10:58:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:53,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:53,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:53,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:53,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:53,817 INFO L87 Difference]: Start difference. First operand 138935 states and 148399 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:55,120 INFO L93 Difference]: Finished difference Result 270610 states and 288853 transitions. [2025-03-03 10:58:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:55,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 603 [2025-03-03 10:58:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:55,268 INFO L225 Difference]: With dead ends: 270610 [2025-03-03 10:58:55,268 INFO L226 Difference]: Without dead ends: 131675 [2025-03-03 10:58:55,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:55,340 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 539 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:55,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 98 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:58:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131675 states. [2025-03-03 10:58:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131675 to 130801. [2025-03-03 10:58:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130801 states, 130800 states have (on average 1.0663914373088685) internal successors, (139484), 130800 states have internal predecessors, (139484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130801 states to 130801 states and 139484 transitions. [2025-03-03 10:58:56,921 INFO L78 Accepts]: Start accepts. Automaton has 130801 states and 139484 transitions. Word has length 603 [2025-03-03 10:58:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:56,922 INFO L471 AbstractCegarLoop]: Abstraction has 130801 states and 139484 transitions. [2025-03-03 10:58:56,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:58:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 130801 states and 139484 transitions. [2025-03-03 10:58:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-03 10:58:56,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:56,929 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:56,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:58:56,929 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:56,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash 316297978, now seen corresponding path program 1 times [2025-03-03 10:58:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:56,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204877498] [2025-03-03 10:58:56,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:56,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-03 10:58:56,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-03 10:58:56,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:56,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 427 proven. 89 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:58:57,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204877498] [2025-03-03 10:58:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204877498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471734074] [2025-03-03 10:58:57,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:57,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:58:57,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:57,629 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-03 10:58:57,631 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-03 10:58:57,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-03 10:58:57,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-03 10:58:57,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:57,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:57,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:58:57,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:58:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 327 proven. 25 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:58,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:58:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:58:58,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471734074] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:58:58,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:58:58,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-03 10:58:58,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383327762] [2025-03-03 10:58:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:58,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:58,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:58,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:58:58,253 INFO L87 Difference]: Start difference. First operand 130801 states and 139484 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:00,433 INFO L93 Difference]: Finished difference Result 133793 states and 142554 transitions. [2025-03-03 10:59:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:00,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 611 [2025-03-03 10:59:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:00,561 INFO L225 Difference]: With dead ends: 133793 [2025-03-03 10:59:00,562 INFO L226 Difference]: Without dead ends: 133366 [2025-03-03 10:59:00,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1218 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:59:00,589 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 974 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:00,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 168 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 2162 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:59:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133366 states.