./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label15.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:51:27,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:51:27,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:51:27,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:51:27,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:51:27,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:51:27,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:51:27,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:51:27,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:51:27,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:51:27,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:51:27,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:51:27,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:51:27,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:51:27,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:51:27,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:51:27,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:51:27,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:51:27,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:51:27,246 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 -> 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac [2025-03-08 01:51:27,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:51:27,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:51:27,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:51:27,515 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:51:27,515 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:51:27,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2025-03-08 01:51:28,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55dc0884/7a3d8227861e48fab5707a151e5e4d52/FLAG2b745832a [2025-03-08 01:51:29,246 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:51:29,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2025-03-08 01:51:29,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55dc0884/7a3d8227861e48fab5707a151e5e4d52/FLAG2b745832a [2025-03-08 01:51:29,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55dc0884/7a3d8227861e48fab5707a151e5e4d52 [2025-03-08 01:51:29,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:51:29,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:51:29,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:51:29,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:51:29,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:51:29,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:29" (1/1) ... [2025-03-08 01:51:29,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:29, skipping insertion in model container [2025-03-08 01:51:29,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:51:29" (1/1) ... [2025-03-08 01:51:29,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:51:29,590 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/Problem13_label15.c[5297,5310] [2025-03-08 01:51:30,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:51:30,086 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:51:30,103 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/Problem13_label15.c[5297,5310] [2025-03-08 01:51:30,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:51:30,421 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:51:30,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30 WrapperNode [2025-03-08 01:51:30,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:51:30,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:51:30,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:51:30,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:51:30,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:30,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:30,816 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:51:30,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:51:30,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:51:30,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:51:30,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:51:30,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:30,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:30,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:51:31,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:51:31,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:51:31,394 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:51:31,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:51:31,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (1/1) ... [2025-03-08 01:51:31,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:51:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:51:31,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:51:31,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:51:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:51:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:51:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:51:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:51:31,507 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:51:31,509 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:51:35,593 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:51:35,594 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:51:35,594 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:51:35,813 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:51:35,813 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:51:35,854 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:51:35,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:51:35,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:35 BoogieIcfgContainer [2025-03-08 01:51:35,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:51:35,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:51:35,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:51:35,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:51:35,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:51:29" (1/3) ... [2025-03-08 01:51:35,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fec719e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:35, skipping insertion in model container [2025-03-08 01:51:35,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:51:30" (2/3) ... [2025-03-08 01:51:35,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fec719e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:51:35, skipping insertion in model container [2025-03-08 01:51:35,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:51:35" (3/3) ... [2025-03-08 01:51:35,862 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label15.c [2025-03-08 01:51:35,874 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:51:35,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label15.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:51:35,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:51:35,954 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;@2239cdb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:51:35,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:51:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 01:51:35,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:35,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:35,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1457068655, now seen corresponding path program 1 times [2025-03-08 01:51:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024707220] [2025-03-08 01:51:35,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:36,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 01:51:36,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 01:51:36,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:36,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:51:36,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:36,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024707220] [2025-03-08 01:51:36,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024707220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:36,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:36,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:51:36,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601983657] [2025-03-08 01:51:36,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:36,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:36,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:36,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:36,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:36,282 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:40,269 INFO L93 Difference]: Finished difference Result 3160 states and 5840 transitions. [2025-03-08 01:51:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-08 01:51:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:40,290 INFO L225 Difference]: With dead ends: 3160 [2025-03-08 01:51:40,290 INFO L226 Difference]: Without dead ends: 1983 [2025-03-08 01:51:40,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:40,301 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1067 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:40,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 349 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 01:51:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-03-08 01:51:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2025-03-08 01:51:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2025-03-08 01:51:40,402 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 36 [2025-03-08 01:51:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:40,402 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2025-03-08 01:51:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2025-03-08 01:51:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 01:51:40,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:40,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:40,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:51:40,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:40,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1832686922, now seen corresponding path program 1 times [2025-03-08 01:51:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553596413] [2025-03-08 01:51:40,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:40,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 01:51:40,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 01:51:40,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:40,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:51:40,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:40,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553596413] [2025-03-08 01:51:40,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553596413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:40,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:40,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:51:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114917093] [2025-03-08 01:51:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:40,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:40,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:40,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:40,735 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:44,072 INFO L93 Difference]: Finished difference Result 4718 states and 8523 transitions. [2025-03-08 01:51:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-08 01:51:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:44,082 INFO L225 Difference]: With dead ends: 4718 [2025-03-08 01:51:44,082 INFO L226 Difference]: Without dead ends: 2790 [2025-03-08 01:51:44,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:44,085 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:44,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 737 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 01:51:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2025-03-08 01:51:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2729. [2025-03-08 01:51:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2728 states have (on average 1.7001466275659824) internal successors, (4638), 2728 states have internal predecessors, (4638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4638 transitions. [2025-03-08 01:51:44,137 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4638 transitions. Word has length 101 [2025-03-08 01:51:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4638 transitions. [2025-03-08 01:51:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4638 transitions. [2025-03-08 01:51:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 01:51:44,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:44,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:44,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:51:44,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:44,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1444850169, now seen corresponding path program 1 times [2025-03-08 01:51:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293013589] [2025-03-08 01:51:44,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:44,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:44,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 01:51:44,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 01:51:44,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:44,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:51:44,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293013589] [2025-03-08 01:51:44,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293013589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:44,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:44,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:51:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200759767] [2025-03-08 01:51:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:44,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:44,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:44,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:44,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:44,295 INFO L87 Difference]: Start difference. First operand 2729 states and 4638 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:47,171 INFO L93 Difference]: Finished difference Result 7862 states and 13450 transitions. [2025-03-08 01:51:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:47,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 01:51:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:47,188 INFO L225 Difference]: With dead ends: 7862 [2025-03-08 01:51:47,188 INFO L226 Difference]: Without dead ends: 5135 [2025-03-08 01:51:47,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:47,193 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 937 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:47,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1015 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:51:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2025-03-08 01:51:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 5127. [2025-03-08 01:51:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 5126 states have (on average 1.533164260632072) internal successors, (7859), 5126 states have internal predecessors, (7859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 7859 transitions. [2025-03-08 01:51:47,265 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 7859 transitions. Word has length 107 [2025-03-08 01:51:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:47,265 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 7859 transitions. [2025-03-08 01:51:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 7859 transitions. [2025-03-08 01:51:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 01:51:47,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:47,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:47,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:51:47,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:47,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -333032145, now seen corresponding path program 1 times [2025-03-08 01:51:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:47,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364627692] [2025-03-08 01:51:47,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:47,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 01:51:47,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 01:51:47,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:47,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:51:47,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:47,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364627692] [2025-03-08 01:51:47,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364627692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:47,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:47,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:51:47,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760796346] [2025-03-08 01:51:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:47,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:47,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:47,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:47,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:47,571 INFO L87 Difference]: Start difference. First operand 5127 states and 7859 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:50,208 INFO L93 Difference]: Finished difference Result 11046 states and 16686 transitions. [2025-03-08 01:51:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:50,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-08 01:51:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:50,224 INFO L225 Difference]: With dead ends: 11046 [2025-03-08 01:51:50,225 INFO L226 Difference]: Without dead ends: 5921 [2025-03-08 01:51:50,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:50,231 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 685 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:50,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1177 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:51:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5921 states. [2025-03-08 01:51:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5921 to 5915. [2025-03-08 01:51:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5914 states have (on average 1.4680419343929658) internal successors, (8682), 5914 states have internal predecessors, (8682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 8682 transitions. [2025-03-08 01:51:50,317 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 8682 transitions. Word has length 147 [2025-03-08 01:51:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:50,318 INFO L471 AbstractCegarLoop]: Abstraction has 5915 states and 8682 transitions. [2025-03-08 01:51:50,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 8682 transitions. [2025-03-08 01:51:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 01:51:50,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:50,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:51:50,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1807754117, now seen corresponding path program 1 times [2025-03-08 01:51:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100800926] [2025-03-08 01:51:50,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:50,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 01:51:50,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 01:51:50,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:50,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:51:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100800926] [2025-03-08 01:51:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100800926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:51:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803449947] [2025-03-08 01:51:51,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:51,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:51:51,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:51:51,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:51:51,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:51:51,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 01:51:51,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 01:51:51,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:51,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:51,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:51:51,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:51:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 01:51:51,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:51:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803449947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:51,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:51:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 01:51:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974811760] [2025-03-08 01:51:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:51,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:51,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:51,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:51:51,257 INFO L87 Difference]: Start difference. First operand 5915 states and 8682 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:54,095 INFO L93 Difference]: Finished difference Result 15807 states and 23906 transitions. [2025-03-08 01:51:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:54,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-03-08 01:51:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:54,121 INFO L225 Difference]: With dead ends: 15807 [2025-03-08 01:51:54,122 INFO L226 Difference]: Without dead ends: 10682 [2025-03-08 01:51:54,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:51:54,127 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 755 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:54,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1136 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:51:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10682 states. [2025-03-08 01:51:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10682 to 10659. [2025-03-08 01:51:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10659 states, 10658 states have (on average 1.3172264965284293) internal successors, (14039), 10658 states have internal predecessors, (14039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 14039 transitions. [2025-03-08 01:51:54,261 INFO L78 Accepts]: Start accepts. Automaton has 10659 states and 14039 transitions. Word has length 161 [2025-03-08 01:51:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:54,261 INFO L471 AbstractCegarLoop]: Abstraction has 10659 states and 14039 transitions. [2025-03-08 01:51:54,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 10659 states and 14039 transitions. [2025-03-08 01:51:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 01:51:54,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:54,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:51:54,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:51:54,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:51:54,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:54,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1940949417, now seen corresponding path program 1 times [2025-03-08 01:51:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464174016] [2025-03-08 01:51:54,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:54,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 01:51:54,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 01:51:54,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:54,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 01:51:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464174016] [2025-03-08 01:51:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464174016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:54,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:51:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401155985] [2025-03-08 01:51:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:54,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:54,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:54,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:54,610 INFO L87 Difference]: Start difference. First operand 10659 states and 14039 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:51:57,356 INFO L93 Difference]: Finished difference Result 23671 states and 32238 transitions. [2025-03-08 01:51:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:51:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 197 [2025-03-08 01:51:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:51:57,386 INFO L225 Difference]: With dead ends: 23671 [2025-03-08 01:51:57,386 INFO L226 Difference]: Without dead ends: 13801 [2025-03-08 01:51:57,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:57,398 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 880 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:51:57,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1019 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:51:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2025-03-08 01:51:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 13798. [2025-03-08 01:51:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13798 states, 13797 states have (on average 1.247155178662028) internal successors, (17207), 13797 states have internal predecessors, (17207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17207 transitions. [2025-03-08 01:51:57,666 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17207 transitions. Word has length 197 [2025-03-08 01:51:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:51:57,666 INFO L471 AbstractCegarLoop]: Abstraction has 13798 states and 17207 transitions. [2025-03-08 01:51:57,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:51:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17207 transitions. [2025-03-08 01:51:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-08 01:51:57,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:51:57,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:51:57,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:51:57,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:51:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:51:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1388179058, now seen corresponding path program 1 times [2025-03-08 01:51:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:51:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690546217] [2025-03-08 01:51:57,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:51:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:51:57,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-08 01:51:57,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-08 01:51:57,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:51:57,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:51:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:51:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:51:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690546217] [2025-03-08 01:51:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690546217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:51:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:51:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:51:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36200653] [2025-03-08 01:51:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:51:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:51:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:51:57,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:51:57,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:51:57,986 INFO L87 Difference]: Start difference. First operand 13798 states and 17207 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:00,700 INFO L93 Difference]: Finished difference Result 33140 states and 42604 transitions. [2025-03-08 01:52:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:00,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2025-03-08 01:52:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:00,733 INFO L225 Difference]: With dead ends: 33140 [2025-03-08 01:52:00,733 INFO L226 Difference]: Without dead ends: 20131 [2025-03-08 01:52:00,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:00,746 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 772 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:00,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1943 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:52:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2025-03-08 01:52:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20100. [2025-03-08 01:52:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20100 states, 20099 states have (on average 1.2067267028210358) internal successors, (24254), 20099 states have internal predecessors, (24254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20100 states to 20100 states and 24254 transitions. [2025-03-08 01:52:00,968 INFO L78 Accepts]: Start accepts. Automaton has 20100 states and 24254 transitions. Word has length 248 [2025-03-08 01:52:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:00,968 INFO L471 AbstractCegarLoop]: Abstraction has 20100 states and 24254 transitions. [2025-03-08 01:52:00,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20100 states and 24254 transitions. [2025-03-08 01:52:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 01:52:00,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:00,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:52:00,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:52:00,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:00,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:00,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1619850828, now seen corresponding path program 1 times [2025-03-08 01:52:00,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:00,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382308180] [2025-03-08 01:52:00,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:00,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:00,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 01:52:01,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 01:52:01,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:01,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:52:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382308180] [2025-03-08 01:52:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382308180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:01,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:01,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950487923] [2025-03-08 01:52:01,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:01,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:01,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:01,111 INFO L87 Difference]: Start difference. First operand 20100 states and 24254 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:03,998 INFO L93 Difference]: Finished difference Result 57506 states and 69724 transitions. [2025-03-08 01:52:04,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:04,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-08 01:52:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:04,042 INFO L225 Difference]: With dead ends: 57506 [2025-03-08 01:52:04,043 INFO L226 Difference]: Without dead ends: 36616 [2025-03-08 01:52:04,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:04,059 INFO L435 NwaCegarLoop]: 1695 mSDtfsCounter, 938 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:04,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1831 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:52:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36616 states. [2025-03-08 01:52:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36616 to 35823. [2025-03-08 01:52:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35823 states, 35822 states have (on average 1.1638378649991625) internal successors, (41691), 35822 states have internal predecessors, (41691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35823 states to 35823 states and 41691 transitions. [2025-03-08 01:52:04,385 INFO L78 Accepts]: Start accepts. Automaton has 35823 states and 41691 transitions. Word has length 250 [2025-03-08 01:52:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:04,386 INFO L471 AbstractCegarLoop]: Abstraction has 35823 states and 41691 transitions. [2025-03-08 01:52:04,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 35823 states and 41691 transitions. [2025-03-08 01:52:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 01:52:04,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:04,391 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:04,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:52:04,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:04,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1253189949, now seen corresponding path program 1 times [2025-03-08 01:52:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:04,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696844994] [2025-03-08 01:52:04,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:04,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 01:52:04,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 01:52:04,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 01:52:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696844994] [2025-03-08 01:52:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696844994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048298635] [2025-03-08 01:52:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:04,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:52:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:04,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:52:04,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:52:04,709 INFO L87 Difference]: Start difference. First operand 35823 states and 41691 transitions. Second operand has 4 states, 4 states have (on average 72.75) 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-08 01:52:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:10,409 INFO L93 Difference]: Finished difference Result 106482 states and 124495 transitions. [2025-03-08 01:52:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:52:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) 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 324 [2025-03-08 01:52:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:10,478 INFO L225 Difference]: With dead ends: 106482 [2025-03-08 01:52:10,478 INFO L226 Difference]: Without dead ends: 71448 [2025-03-08 01:52:10,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:52:10,496 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 1697 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6236 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 7219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 6236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:10,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1062 Invalid, 7219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 6236 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-08 01:52:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71448 states. [2025-03-08 01:52:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71448 to 49217. [2025-03-08 01:52:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49217 states, 49216 states have (on average 1.1442823472041612) internal successors, (56317), 49216 states have internal predecessors, (56317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49217 states to 49217 states and 56317 transitions. [2025-03-08 01:52:11,124 INFO L78 Accepts]: Start accepts. Automaton has 49217 states and 56317 transitions. Word has length 324 [2025-03-08 01:52:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:11,124 INFO L471 AbstractCegarLoop]: Abstraction has 49217 states and 56317 transitions. [2025-03-08 01:52:11,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) 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-08 01:52:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 49217 states and 56317 transitions. [2025-03-08 01:52:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 01:52:11,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:11,128 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:52:11,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:11,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash 417040008, now seen corresponding path program 1 times [2025-03-08 01:52:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833271501] [2025-03-08 01:52:11,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:11,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 01:52:11,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 01:52:11,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:11,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 196 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 01:52:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833271501] [2025-03-08 01:52:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833271501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:52:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131717957] [2025-03-08 01:52:12,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:12,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:12,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:52:12,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:52:12,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:52:12,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 01:52:12,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 01:52:12,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:12,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:52:12,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:52:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 01:52:12,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:52:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131717957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:12,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:52:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:52:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388758807] [2025-03-08 01:52:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:12,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:12,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:12,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:12,462 INFO L87 Difference]: Start difference. First operand 49217 states and 56317 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:15,069 INFO L93 Difference]: Finished difference Result 97634 states and 111830 transitions. [2025-03-08 01:52:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:15,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 342 [2025-03-08 01:52:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:15,126 INFO L225 Difference]: With dead ends: 97634 [2025-03-08 01:52:15,126 INFO L226 Difference]: Without dead ends: 49206 [2025-03-08 01:52:15,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:15,155 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 1073 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:15,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 801 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:52:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49206 states. [2025-03-08 01:52:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49206 to 49203. [2025-03-08 01:52:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49203 states, 49202 states have (on average 1.1063371407666356) internal successors, (54434), 49202 states have internal predecessors, (54434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49203 states to 49203 states and 54434 transitions. [2025-03-08 01:52:15,574 INFO L78 Accepts]: Start accepts. Automaton has 49203 states and 54434 transitions. Word has length 342 [2025-03-08 01:52:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:15,575 INFO L471 AbstractCegarLoop]: Abstraction has 49203 states and 54434 transitions. [2025-03-08 01:52:15,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 49203 states and 54434 transitions. [2025-03-08 01:52:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 01:52:15,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:15,580 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:15,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 01:52:15,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 01:52:15,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:15,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash 57726, now seen corresponding path program 1 times [2025-03-08 01:52:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:15,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432698400] [2025-03-08 01:52:15,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:15,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 01:52:15,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 01:52:15,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:15,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 01:52:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432698400] [2025-03-08 01:52:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432698400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:52:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422258048] [2025-03-08 01:52:16,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:16,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:52:16,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:52:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 01:52:16,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 01:52:16,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 01:52:16,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:16,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:52:16,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:52:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-08 01:52:16,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:52:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422258048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:52:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:52:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404113077] [2025-03-08 01:52:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:16,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:16,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:16,867 INFO L87 Difference]: Start difference. First operand 49203 states and 54434 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:18,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 01:52:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:20,551 INFO L93 Difference]: Finished difference Result 97615 states and 108073 transitions. [2025-03-08 01:52:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 391 [2025-03-08 01:52:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:20,601 INFO L225 Difference]: With dead ends: 97615 [2025-03-08 01:52:20,601 INFO L226 Difference]: Without dead ends: 49201 [2025-03-08 01:52:20,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:20,625 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1084 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:20,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1422 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 01:52:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49201 states. [2025-03-08 01:52:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49201 to 49200. [2025-03-08 01:52:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49200 states, 49199 states have (on average 1.083985446858676) internal successors, (53331), 49199 states have internal predecessors, (53331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49200 states to 49200 states and 53331 transitions. [2025-03-08 01:52:21,015 INFO L78 Accepts]: Start accepts. Automaton has 49200 states and 53331 transitions. Word has length 391 [2025-03-08 01:52:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:21,016 INFO L471 AbstractCegarLoop]: Abstraction has 49200 states and 53331 transitions. [2025-03-08 01:52:21,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 49200 states and 53331 transitions. [2025-03-08 01:52:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-08 01:52:21,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:21,020 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:21,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 01:52:21,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:21,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:21,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1435284094, now seen corresponding path program 1 times [2025-03-08 01:52:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:21,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917816999] [2025-03-08 01:52:21,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:21,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:21,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-08 01:52:21,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-08 01:52:21,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:21,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-08 01:52:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917816999] [2025-03-08 01:52:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917816999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:21,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148480942] [2025-03-08 01:52:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:21,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:21,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:21,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:21,350 INFO L87 Difference]: Start difference. First operand 49200 states and 53331 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:24,289 INFO L93 Difference]: Finished difference Result 114150 states and 124943 transitions. [2025-03-08 01:52:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 392 [2025-03-08 01:52:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:24,369 INFO L225 Difference]: With dead ends: 114150 [2025-03-08 01:52:24,369 INFO L226 Difference]: Without dead ends: 65739 [2025-03-08 01:52:24,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:24,405 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 890 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:24,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 877 Invalid, 3337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:52:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65739 states. [2025-03-08 01:52:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65739 to 64150. [2025-03-08 01:52:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64150 states, 64149 states have (on average 1.090757455299381) internal successors, (69971), 64149 states have internal predecessors, (69971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64150 states to 64150 states and 69971 transitions. [2025-03-08 01:52:25,116 INFO L78 Accepts]: Start accepts. Automaton has 64150 states and 69971 transitions. Word has length 392 [2025-03-08 01:52:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 64150 states and 69971 transitions. [2025-03-08 01:52:25,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 64150 states and 69971 transitions. [2025-03-08 01:52:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 01:52:25,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:25,127 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:25,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:52:25,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:25,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2131737006, now seen corresponding path program 1 times [2025-03-08 01:52:25,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:25,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917679167] [2025-03-08 01:52:25,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:25,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 01:52:25,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 01:52:25,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:25,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 305 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 01:52:26,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917679167] [2025-03-08 01:52:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917679167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:52:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864973647] [2025-03-08 01:52:26,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:26,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:26,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:52:26,331 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:52:26,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:52:26,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 01:52:26,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 01:52:26,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:26,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:26,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:52:26,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:52:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 01:52:26,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:52:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864973647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:26,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:52:26,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 01:52:26,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429315983] [2025-03-08 01:52:26,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:26,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:26,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:26,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:26,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:26,635 INFO L87 Difference]: Start difference. First operand 64150 states and 69971 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:29,455 INFO L93 Difference]: Finished difference Result 138514 states and 151491 transitions. [2025-03-08 01:52:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:29,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 466 [2025-03-08 01:52:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:29,529 INFO L225 Difference]: With dead ends: 138514 [2025-03-08 01:52:29,529 INFO L226 Difference]: Without dead ends: 75153 [2025-03-08 01:52:29,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:52:29,568 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1133 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:29,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 392 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:52:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75153 states. [2025-03-08 01:52:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75153 to 75153. [2025-03-08 01:52:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75153 states, 75152 states have (on average 1.083005109644454) internal successors, (81390), 75152 states have internal predecessors, (81390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75153 states to 75153 states and 81390 transitions. [2025-03-08 01:52:30,128 INFO L78 Accepts]: Start accepts. Automaton has 75153 states and 81390 transitions. Word has length 466 [2025-03-08 01:52:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:30,129 INFO L471 AbstractCegarLoop]: Abstraction has 75153 states and 81390 transitions. [2025-03-08 01:52:30,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 75153 states and 81390 transitions. [2025-03-08 01:52:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 01:52:30,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:30,136 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:30,142 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-08 01:52:30,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:52:30,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:30,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -885521267, now seen corresponding path program 1 times [2025-03-08 01:52:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:30,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692695449] [2025-03-08 01:52:30,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:30,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 01:52:30,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 01:52:30,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:30,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:52:30,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692695449] [2025-03-08 01:52:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692695449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:30,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013128877] [2025-03-08 01:52:30,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:30,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:30,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:30,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:30,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:30,514 INFO L87 Difference]: Start difference. First operand 75153 states and 81390 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:33,385 INFO L93 Difference]: Finished difference Result 164471 states and 179010 transitions. [2025-03-08 01:52:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:33,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 484 [2025-03-08 01:52:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:33,478 INFO L225 Difference]: With dead ends: 164471 [2025-03-08 01:52:33,479 INFO L226 Difference]: Without dead ends: 88533 [2025-03-08 01:52:33,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:33,525 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 725 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:33,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1838 Invalid, 3157 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [670 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:52:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88533 states. [2025-03-08 01:52:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88533 to 88520. [2025-03-08 01:52:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88520 states, 88519 states have (on average 1.071611744371265) internal successors, (94858), 88519 states have internal predecessors, (94858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88520 states to 88520 states and 94858 transitions. [2025-03-08 01:52:34,209 INFO L78 Accepts]: Start accepts. Automaton has 88520 states and 94858 transitions. Word has length 484 [2025-03-08 01:52:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:34,209 INFO L471 AbstractCegarLoop]: Abstraction has 88520 states and 94858 transitions. [2025-03-08 01:52:34,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 88520 states and 94858 transitions. [2025-03-08 01:52:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-08 01:52:34,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:34,225 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:34,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:52:34,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1136340049, now seen corresponding path program 1 times [2025-03-08 01:52:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134500047] [2025-03-08 01:52:34,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:34,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-08 01:52:34,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-08 01:52:34,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:34,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 01:52:34,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134500047] [2025-03-08 01:52:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134500047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966554731] [2025-03-08 01:52:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:34,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:52:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:34,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:52:34,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:52:34,683 INFO L87 Difference]: Start difference. First operand 88520 states and 94858 transitions. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:37,870 INFO L93 Difference]: Finished difference Result 185696 states and 198890 transitions. [2025-03-08 01:52:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:52:37,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 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 597 [2025-03-08 01:52:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:37,978 INFO L225 Difference]: With dead ends: 185696 [2025-03-08 01:52:37,978 INFO L226 Difference]: Without dead ends: 96389 [2025-03-08 01:52:38,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:52:38,036 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 1465 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 4045 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 4045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:38,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 951 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 4045 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:52:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96389 states. [2025-03-08 01:52:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96389 to 94814. [2025-03-08 01:52:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94814 states, 94813 states have (on average 1.0649805406431607) internal successors, (100974), 94813 states have internal predecessors, (100974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94814 states to 94814 states and 100974 transitions. [2025-03-08 01:52:39,144 INFO L78 Accepts]: Start accepts. Automaton has 94814 states and 100974 transitions. Word has length 597 [2025-03-08 01:52:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:39,144 INFO L471 AbstractCegarLoop]: Abstraction has 94814 states and 100974 transitions. [2025-03-08 01:52:39,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 94814 states and 100974 transitions. [2025-03-08 01:52:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-08 01:52:39,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:39,170 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:39,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:52:39,170 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:39,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash 623454209, now seen corresponding path program 1 times [2025-03-08 01:52:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021688944] [2025-03-08 01:52:39,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:39,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-08 01:52:39,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-08 01:52:39,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:39,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-08 01:52:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021688944] [2025-03-08 01:52:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021688944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:39,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:52:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746112319] [2025-03-08 01:52:39,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:39,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:39,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:39,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:39,687 INFO L87 Difference]: Start difference. First operand 94814 states and 100974 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:42,623 INFO L93 Difference]: Finished difference Result 204596 states and 217664 transitions. [2025-03-08 01:52:42,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 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 657 [2025-03-08 01:52:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:42,754 INFO L225 Difference]: With dead ends: 204596 [2025-03-08 01:52:42,754 INFO L226 Difference]: Without dead ends: 110571 [2025-03-08 01:52:42,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:42,815 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 574 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:42,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1074 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:52:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110571 states. [2025-03-08 01:52:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110571 to 109774. [2025-03-08 01:52:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109774 states, 109773 states have (on average 1.0603427072230875) internal successors, (116397), 109773 states have internal predecessors, (116397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109774 states to 109774 states and 116397 transitions. [2025-03-08 01:52:43,878 INFO L78 Accepts]: Start accepts. Automaton has 109774 states and 116397 transitions. Word has length 657 [2025-03-08 01:52:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:43,878 INFO L471 AbstractCegarLoop]: Abstraction has 109774 states and 116397 transitions. [2025-03-08 01:52:43,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 109774 states and 116397 transitions. [2025-03-08 01:52:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-08 01:52:43,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:43,899 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:43,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:52:43,899 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:43,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash 194645500, now seen corresponding path program 1 times [2025-03-08 01:52:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508935936] [2025-03-08 01:52:43,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:43,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-08 01:52:43,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-08 01:52:43,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:43,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-08 01:52:44,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:44,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508935936] [2025-03-08 01:52:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508935936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:44,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:44,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427279204] [2025-03-08 01:52:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:44,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:44,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:44,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:44,421 INFO L87 Difference]: Start difference. First operand 109774 states and 116397 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:47,245 INFO L93 Difference]: Finished difference Result 219550 states and 232804 transitions. [2025-03-08 01:52:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 730 [2025-03-08 01:52:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:47,367 INFO L225 Difference]: With dead ends: 219550 [2025-03-08 01:52:47,367 INFO L226 Difference]: Without dead ends: 108986 [2025-03-08 01:52:47,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:47,409 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 625 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:47,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1720 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 01:52:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108986 states. [2025-03-08 01:52:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108986 to 107396. [2025-03-08 01:52:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107396 states, 107395 states have (on average 1.049006005866195) internal successors, (112658), 107395 states have internal predecessors, (112658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107396 states to 107396 states and 112658 transitions. [2025-03-08 01:52:48,632 INFO L78 Accepts]: Start accepts. Automaton has 107396 states and 112658 transitions. Word has length 730 [2025-03-08 01:52:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:48,633 INFO L471 AbstractCegarLoop]: Abstraction has 107396 states and 112658 transitions. [2025-03-08 01:52:48,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 107396 states and 112658 transitions. [2025-03-08 01:52:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-08 01:52:48,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:48,665 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:52:48,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:52:48,665 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:48,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash 846659008, now seen corresponding path program 1 times [2025-03-08 01:52:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:48,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804491765] [2025-03-08 01:52:48,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:48,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-08 01:52:48,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-08 01:52:48,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:52:48,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:52:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-08 01:52:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:52:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804491765] [2025-03-08 01:52:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804491765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:52:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:52:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:52:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776986157] [2025-03-08 01:52:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:52:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:52:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:52:49,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:52:49,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:49,495 INFO L87 Difference]: Start difference. First operand 107396 states and 112658 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:52:52,389 INFO L93 Difference]: Finished difference Result 202989 states and 213378 transitions. [2025-03-08 01:52:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:52:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 779 [2025-03-08 01:52:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:52:52,516 INFO L225 Difference]: With dead ends: 202989 [2025-03-08 01:52:52,516 INFO L226 Difference]: Without dead ends: 111342 [2025-03-08 01:52:52,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:52:52,557 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 764 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:52:52,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1844 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:52:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111342 states. [2025-03-08 01:52:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111342 to 111332. [2025-03-08 01:52:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111332 states, 111331 states have (on average 1.048512992787274) internal successors, (116732), 111331 states have internal predecessors, (116732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111332 states to 111332 states and 116732 transitions. [2025-03-08 01:52:53,505 INFO L78 Accepts]: Start accepts. Automaton has 111332 states and 116732 transitions. Word has length 779 [2025-03-08 01:52:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:52:53,506 INFO L471 AbstractCegarLoop]: Abstraction has 111332 states and 116732 transitions. [2025-03-08 01:52:53,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:52:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 111332 states and 116732 transitions. [2025-03-08 01:52:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-03-08 01:52:53,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:52:53,530 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:52:53,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 01:52:53,530 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:52:53,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:52:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1313461475, now seen corresponding path program 1 times [2025-03-08 01:52:53,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:52:53,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228830182] [2025-03-08 01:52:53,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:52:53,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:52:53,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes.