./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label25.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/Problem19_label25.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2828fcd63ce72084c4fe1d4b095824858b5148399c7a2397e97473c901021226 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:21:11,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:21:12,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:21:12,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:21:12,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:21:12,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:21:12,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:21:12,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:21:12,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:21:12,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:21:12,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:21:12,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:21:12,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:21:12,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:21:12,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:21:12,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:21:12,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:21:12,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:21:12,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:21:12,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:21:12,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:21:12,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:21:12,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:21:12,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:21:12,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:21:12,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:21:12,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:21:12,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:21:12,070 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 -> 2828fcd63ce72084c4fe1d4b095824858b5148399c7a2397e97473c901021226 [2025-03-08 02:21:12,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:21:12,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:21:12,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:21:12,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:21:12,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:21:12,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label25.c [2025-03-08 02:21:13,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56352fc4/50ad52d1a8f24a5884065998ad52380a/FLAG016e9534c [2025-03-08 02:21:13,983 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:21:13,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label25.c [2025-03-08 02:21:14,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56352fc4/50ad52d1a8f24a5884065998ad52380a/FLAG016e9534c [2025-03-08 02:21:14,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56352fc4/50ad52d1a8f24a5884065998ad52380a [2025-03-08 02:21:14,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:21:14,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:21:14,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:21:14,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:21:14,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:21:14,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:21:14" (1/1) ... [2025-03-08 02:21:14,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e49559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:14, skipping insertion in model container [2025-03-08 02:21:14,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:21:14" (1/1) ... [2025-03-08 02:21:14,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:21:14,890 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/Problem19_label25.c[4945,4958] [2025-03-08 02:21:15,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:21:15,571 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:21:15,583 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/Problem19_label25.c[4945,4958] [2025-03-08 02:21:16,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:21:16,047 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:21:16,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16 WrapperNode [2025-03-08 02:21:16,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:21:16,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:21:16,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:21:16,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:21:16,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:16,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:16,690 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:21:16,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:21:16,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:21:16,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:21:16,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:21:16,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:16,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:16,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,130 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:21:17,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:21:17,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:21:17,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:21:17,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:21:17,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (1/1) ... [2025-03-08 02:21:17,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:21:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:21:17,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:21:17,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:21:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:21:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:21:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:21:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:21:17,659 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:21:17,660 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:21:23,664 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:21:23,664 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:21:23,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:21:23,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:21:23,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:21:23,950 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:21:23,950 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:21:23,993 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:21:23,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:21:23,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:21:23 BoogieIcfgContainer [2025-03-08 02:21:23,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:21:23,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:21:23,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:21:23,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:21:24,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:21:14" (1/3) ... [2025-03-08 02:21:24,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a3e23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:21:24, skipping insertion in model container [2025-03-08 02:21:24,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:16" (2/3) ... [2025-03-08 02:21:24,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a3e23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:21:24, skipping insertion in model container [2025-03-08 02:21:24,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:21:23" (3/3) ... [2025-03-08 02:21:24,002 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label25.c [2025-03-08 02:21:24,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:21:24,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label25.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:21:24,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:21:24,091 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;@672497b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:21:24,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:21:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 02:21:24,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:24,106 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 02:21:24,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:24,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1654648593, now seen corresponding path program 1 times [2025-03-08 02:21:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794248178] [2025-03-08 02:21:24,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:24,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 02:21:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 02:21:24,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:24,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:24,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794248178] [2025-03-08 02:21:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794248178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:24,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:24,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753499554] [2025-03-08 02:21:24,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:24,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:24,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:24,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:24,356 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 02:21:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:29,256 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-03-08 02:21:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:29,260 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 02:21:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:29,284 INFO L225 Difference]: With dead ends: 4919 [2025-03-08 02:21:29,285 INFO L226 Difference]: Without dead ends: 3107 [2025-03-08 02:21:29,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:29,292 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1517 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:29,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1458 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 02:21:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-03-08 02:21:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-03-08 02:21:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 1.652818035426731) internal successors, (5132), 3105 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-03-08 02:21:29,407 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 36 [2025-03-08 02:21:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-03-08 02:21:29,408 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 02:21:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-03-08 02:21:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 02:21:29,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:29,410 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] [2025-03-08 02:21:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:21:29,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:29,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1720218443, now seen corresponding path program 1 times [2025-03-08 02:21:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069487058] [2025-03-08 02:21:29,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 02:21:29,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 02:21:29,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:29,633 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 02:21:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069487058] [2025-03-08 02:21:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069487058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:29,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236364101] [2025-03-08 02:21:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:29,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:29,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:29,634 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:34,534 INFO L93 Difference]: Finished difference Result 9097 states and 15084 transitions. [2025-03-08 02:21:34,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:34,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-08 02:21:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:34,554 INFO L225 Difference]: With dead ends: 9097 [2025-03-08 02:21:34,554 INFO L226 Difference]: Without dead ends: 5993 [2025-03-08 02:21:34,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:34,560 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:34,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 02:21:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2025-03-08 02:21:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5991. [2025-03-08 02:21:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5991 states, 5990 states have (on average 1.606176961602671) internal successors, (9621), 5990 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 9621 transitions. [2025-03-08 02:21:34,654 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 9621 transitions. Word has length 105 [2025-03-08 02:21:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:34,655 INFO L471 AbstractCegarLoop]: Abstraction has 5991 states and 9621 transitions. [2025-03-08 02:21:34,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 9621 transitions. [2025-03-08 02:21:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 02:21:34,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:34,659 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] [2025-03-08 02:21:34,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:21:34,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1584741061, now seen corresponding path program 1 times [2025-03-08 02:21:34,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:34,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8903223] [2025-03-08 02:21:34,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 02:21:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 02:21:34,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:34,838 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 02:21:34,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8903223] [2025-03-08 02:21:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8903223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:34,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590839303] [2025-03-08 02:21:34,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:34,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:34,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:34,839 INFO L87 Difference]: Start difference. First operand 5991 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:39,404 INFO L93 Difference]: Finished difference Result 17559 states and 28308 transitions. [2025-03-08 02:21:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-08 02:21:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:39,433 INFO L225 Difference]: With dead ends: 17559 [2025-03-08 02:21:39,433 INFO L226 Difference]: Without dead ends: 11570 [2025-03-08 02:21:39,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:39,440 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1446 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:39,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1731 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:21:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11570 states. [2025-03-08 02:21:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11570 to 11517. [2025-03-08 02:21:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.4298367488711359) internal successors, (16466), 11516 states have internal predecessors, (16466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 16466 transitions. [2025-03-08 02:21:39,589 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 16466 transitions. Word has length 110 [2025-03-08 02:21:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:39,590 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 16466 transitions. [2025-03-08 02:21:39,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 16466 transitions. [2025-03-08 02:21:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 02:21:39,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:39,595 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] [2025-03-08 02:21:39,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:21:39,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:39,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1330402117, now seen corresponding path program 1 times [2025-03-08 02:21:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520021068] [2025-03-08 02:21:39,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:39,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 02:21:39,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 02:21:39,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:39,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:39,750 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 02:21:39,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:39,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520021068] [2025-03-08 02:21:39,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520021068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:39,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:39,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427740559] [2025-03-08 02:21:39,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:39,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:39,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:39,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:39,753 INFO L87 Difference]: Start difference. First operand 11517 states and 16466 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:44,646 INFO L93 Difference]: Finished difference Result 34168 states and 48917 transitions. [2025-03-08 02:21:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-08 02:21:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:44,692 INFO L225 Difference]: With dead ends: 34168 [2025-03-08 02:21:44,692 INFO L226 Difference]: Without dead ends: 22653 [2025-03-08 02:21:44,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:44,705 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:44,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2076 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 02:21:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2025-03-08 02:21:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 22636. [2025-03-08 02:21:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22636 states, 22635 states have (on average 1.2716589352772256) internal successors, (28784), 22635 states have internal predecessors, (28784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22636 states to 22636 states and 28784 transitions. [2025-03-08 02:21:45,011 INFO L78 Accepts]: Start accepts. Automaton has 22636 states and 28784 transitions. Word has length 133 [2025-03-08 02:21:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:45,011 INFO L471 AbstractCegarLoop]: Abstraction has 22636 states and 28784 transitions. [2025-03-08 02:21:45,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 22636 states and 28784 transitions. [2025-03-08 02:21:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 02:21:45,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:45,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:45,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:21:45,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:45,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1749299351, now seen corresponding path program 1 times [2025-03-08 02:21:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789783393] [2025-03-08 02:21:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:45,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 02:21:45,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 02:21:45,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:45,161 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 02:21:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789783393] [2025-03-08 02:21:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789783393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:45,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:45,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:45,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160973943] [2025-03-08 02:21:45,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:45,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:45,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:45,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:45,165 INFO L87 Difference]: Start difference. First operand 22636 states and 28784 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:49,827 INFO L93 Difference]: Finished difference Result 67252 states and 85519 transitions. [2025-03-08 02:21:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:49,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-08 02:21:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:49,891 INFO L225 Difference]: With dead ends: 67252 [2025-03-08 02:21:49,892 INFO L226 Difference]: Without dead ends: 44618 [2025-03-08 02:21:49,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:49,913 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 1467 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1425 IncrementalHoareTripleChecker+Valid, 4395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:49,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1887 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1425 Valid, 4395 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:21:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44618 states. [2025-03-08 02:21:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44618 to 41838. [2025-03-08 02:21:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41838 states, 41837 states have (on average 1.1882544159476063) internal successors, (49713), 41837 states have internal predecessors, (49713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41838 states to 41838 states and 49713 transitions. [2025-03-08 02:21:50,416 INFO L78 Accepts]: Start accepts. Automaton has 41838 states and 49713 transitions. Word has length 174 [2025-03-08 02:21:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:50,416 INFO L471 AbstractCegarLoop]: Abstraction has 41838 states and 49713 transitions. [2025-03-08 02:21:50,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41838 states and 49713 transitions. [2025-03-08 02:21:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-08 02:21:50,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:50,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:21:50,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:21:50,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:50,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash -486332734, now seen corresponding path program 1 times [2025-03-08 02:21:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:50,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128767476] [2025-03-08 02:21:50,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:50,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-08 02:21:50,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-08 02:21:50,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:50,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 02:21:51,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128767476] [2025-03-08 02:21:51,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128767476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:51,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:51,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:51,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706212904] [2025-03-08 02:21:51,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:51,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:51,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:51,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:51,559 INFO L87 Difference]: Start difference. First operand 41838 states and 49713 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:58,212 INFO L93 Difference]: Finished difference Result 102865 states and 120386 transitions. [2025-03-08 02:21:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2025-03-08 02:21:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:58,290 INFO L225 Difference]: With dead ends: 102865 [2025-03-08 02:21:58,290 INFO L226 Difference]: Without dead ends: 61029 [2025-03-08 02:21:58,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:21:58,320 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9446 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 9690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:58,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2158 Invalid, 9690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9446 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-03-08 02:21:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61029 states. [2025-03-08 02:21:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61029 to 58257. [2025-03-08 02:21:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58257 states, 58256 states have (on average 1.151744026366383) internal successors, (67096), 58256 states have internal predecessors, (67096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58257 states to 58257 states and 67096 transitions. [2025-03-08 02:21:58,897 INFO L78 Accepts]: Start accepts. Automaton has 58257 states and 67096 transitions. Word has length 403 [2025-03-08 02:21:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:58,897 INFO L471 AbstractCegarLoop]: Abstraction has 58257 states and 67096 transitions. [2025-03-08 02:21:58,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 58257 states and 67096 transitions. [2025-03-08 02:21:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-08 02:21:58,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:58,905 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:21:58,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:21:58,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash -87528364, now seen corresponding path program 1 times [2025-03-08 02:21:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943523133] [2025-03-08 02:21:58,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:58,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-08 02:21:58,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-08 02:21:58,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:58,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 02:21:59,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:59,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943523133] [2025-03-08 02:21:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943523133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:59,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257213615] [2025-03-08 02:21:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:59,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:59,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:59,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:59,454 INFO L87 Difference]: Start difference. First operand 58257 states and 67096 transitions. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:04,020 INFO L93 Difference]: Finished difference Result 119273 states and 136969 transitions. [2025-03-08 02:22:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:22:04,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 431 [2025-03-08 02:22:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:04,084 INFO L225 Difference]: With dead ends: 119273 [2025-03-08 02:22:04,085 INFO L226 Difference]: Without dead ends: 60987 [2025-03-08 02:22:04,109 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 02:22:04,110 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5712 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 5720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:04,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1951 Invalid, 5720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5712 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 02:22:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60987 states. [2025-03-08 02:22:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60987 to 60987. [2025-03-08 02:22:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60987 states, 60986 states have (on average 1.1450332863280097) internal successors, (69831), 60986 states have internal predecessors, (69831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60987 states to 60987 states and 69831 transitions. [2025-03-08 02:22:04,575 INFO L78 Accepts]: Start accepts. Automaton has 60987 states and 69831 transitions. Word has length 431 [2025-03-08 02:22:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:04,576 INFO L471 AbstractCegarLoop]: Abstraction has 60987 states and 69831 transitions. [2025-03-08 02:22:04,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 60987 states and 69831 transitions. [2025-03-08 02:22:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-08 02:22:04,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:04,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:22:04,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:22:04,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:04,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2032813997, now seen corresponding path program 1 times [2025-03-08 02:22:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403563033] [2025-03-08 02:22:04,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:04,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:04,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-08 02:22:04,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-08 02:22:04,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:04,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:05,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:05,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403563033] [2025-03-08 02:22:05,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403563033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:05,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:05,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:22:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401425769] [2025-03-08 02:22:05,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:05,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:05,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:05,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:05,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:05,122 INFO L87 Difference]: Start difference. First operand 60987 states and 69831 transitions. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:10,194 INFO L93 Difference]: Finished difference Result 138487 states and 161682 transitions. [2025-03-08 02:22:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 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 02:22:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:10,286 INFO L225 Difference]: With dead ends: 138487 [2025-03-08 02:22:10,286 INFO L226 Difference]: Without dead ends: 80232 [2025-03-08 02:22:10,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:10,318 INFO L435 NwaCegarLoop]: 2831 mSDtfsCounter, 1453 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1789 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:10,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 3010 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1789 Valid, 4116 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 02:22:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80232 states. [2025-03-08 02:22:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80232 to 78762. [2025-03-08 02:22:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78762 states, 78761 states have (on average 1.1383806706364825) internal successors, (89660), 78761 states have internal predecessors, (89660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78762 states to 78762 states and 89660 transitions. [2025-03-08 02:22:11,146 INFO L78 Accepts]: Start accepts. Automaton has 78762 states and 89660 transitions. Word has length 597 [2025-03-08 02:22:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:11,147 INFO L471 AbstractCegarLoop]: Abstraction has 78762 states and 89660 transitions. [2025-03-08 02:22:11,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 78762 states and 89660 transitions. [2025-03-08 02:22:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2025-03-08 02:22:11,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:11,152 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:22:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:22:11,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:11,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -287839572, now seen corresponding path program 1 times [2025-03-08 02:22:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302880592] [2025-03-08 02:22:11,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:11,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes. [2025-03-08 02:22:11,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements. [2025-03-08 02:22:11,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:11,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 67 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-08 02:22:12,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:12,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302880592] [2025-03-08 02:22:12,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302880592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:22:12,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453962769] [2025-03-08 02:22:12,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:12,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:22:12,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:22:12,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:22:12,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:22:12,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes. [2025-03-08 02:22:12,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements. [2025-03-08 02:22:12,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:12,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:12,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:22:12,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:22:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-08 02:22:12,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:22:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453962769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:12,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:22:12,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:22:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606305675] [2025-03-08 02:22:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:12,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:12,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:12,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:22:12,540 INFO L87 Difference]: Start difference. First operand 78762 states and 89660 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:17,456 INFO L93 Difference]: Finished difference Result 191676 states and 220659 transitions. [2025-03-08 02:22:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 742 [2025-03-08 02:22:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:17,604 INFO L225 Difference]: With dead ends: 191676 [2025-03-08 02:22:17,604 INFO L226 Difference]: Without dead ends: 115646 [2025-03-08 02:22:17,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:22:17,664 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 1543 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5060 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 6073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 5060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:17,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 1651 Invalid, 6073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 5060 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:22:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115646 states. [2025-03-08 02:22:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115646 to 108792. [2025-03-08 02:22:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108792 states, 108791 states have (on average 1.140333299629565) internal successors, (124058), 108791 states have internal predecessors, (124058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108792 states to 108792 states and 124058 transitions. [2025-03-08 02:22:18,875 INFO L78 Accepts]: Start accepts. Automaton has 108792 states and 124058 transitions. Word has length 742 [2025-03-08 02:22:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:18,876 INFO L471 AbstractCegarLoop]: Abstraction has 108792 states and 124058 transitions. [2025-03-08 02:22:18,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 108792 states and 124058 transitions. [2025-03-08 02:22:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2025-03-08 02:22:18,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:18,881 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:22:18,888 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 02:22:19,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:22:19,082 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:19,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2093309311, now seen corresponding path program 1 times [2025-03-08 02:22:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:19,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137671518] [2025-03-08 02:22:19,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:19,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-03-08 02:22:19,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-03-08 02:22:19,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:19,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-03-08 02:22:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137671518] [2025-03-08 02:22:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137671518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:19,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:19,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806244534] [2025-03-08 02:22:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:19,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:19,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:19,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:19,596 INFO L87 Difference]: Start difference. First operand 108792 states and 124058 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:24,065 INFO L93 Difference]: Finished difference Result 242179 states and 275888 transitions. [2025-03-08 02:22:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:24,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 0 states have call successors, (0), 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 823 [2025-03-08 02:22:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:24,225 INFO L225 Difference]: With dead ends: 242179 [2025-03-08 02:22:24,225 INFO L226 Difference]: Without dead ends: 136119 [2025-03-08 02:22:24,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:24,285 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 1385 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 1645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 5572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1645 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:24,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 781 Invalid, 5572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1645 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 02:22:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136119 states. [2025-03-08 02:22:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136119 to 136094. [2025-03-08 02:22:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136094 states, 136093 states have (on average 1.107727803781238) internal successors, (150754), 136093 states have internal predecessors, (150754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136094 states to 136094 states and 150754 transitions. [2025-03-08 02:22:25,677 INFO L78 Accepts]: Start accepts. Automaton has 136094 states and 150754 transitions. Word has length 823 [2025-03-08 02:22:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:25,677 INFO L471 AbstractCegarLoop]: Abstraction has 136094 states and 150754 transitions. [2025-03-08 02:22:25,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 2 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 136094 states and 150754 transitions. [2025-03-08 02:22:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-08 02:22:25,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:25,683 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:22:25,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:22:25,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:25,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 831684616, now seen corresponding path program 1 times [2025-03-08 02:22:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857523163] [2025-03-08 02:22:25,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:25,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-08 02:22:25,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-08 02:22:25,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:25,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 02:22:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857523163] [2025-03-08 02:22:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857523163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:22:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128495797] [2025-03-08 02:22:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:26,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:26,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:26,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:26,198 INFO L87 Difference]: Start difference. First operand 136094 states and 150754 transitions. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:31,004 INFO L93 Difference]: Finished difference Result 302234 states and 337150 transitions. [2025-03-08 02:22:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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 829 [2025-03-08 02:22:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:31,402 INFO L225 Difference]: With dead ends: 302234 [2025-03-08 02:22:31,402 INFO L226 Difference]: Without dead ends: 167505 [2025-03-08 02:22:31,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:31,464 INFO L435 NwaCegarLoop]: 2986 mSDtfsCounter, 1517 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 1636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 5337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1636 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:31,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 3175 Invalid, 5337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1636 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 02:22:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167505 states. [2025-03-08 02:22:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167505 to 166126. [2025-03-08 02:22:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166126 states, 166125 states have (on average 1.0949285176824681) internal successors, (181895), 166125 states have internal predecessors, (181895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166126 states to 166126 states and 181895 transitions. [2025-03-08 02:22:33,161 INFO L78 Accepts]: Start accepts. Automaton has 166126 states and 181895 transitions. Word has length 829 [2025-03-08 02:22:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:33,162 INFO L471 AbstractCegarLoop]: Abstraction has 166126 states and 181895 transitions. [2025-03-08 02:22:33,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 166126 states and 181895 transitions. [2025-03-08 02:22:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2025-03-08 02:22:33,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:33,168 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:22:33,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:22:33,169 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:33,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1614198338, now seen corresponding path program 1 times [2025-03-08 02:22:33,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:33,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452777929] [2025-03-08 02:22:33,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:33,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 896 statements into 1 equivalence classes. [2025-03-08 02:22:33,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 896 of 896 statements. [2025-03-08 02:22:33,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:33,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-08 02:22:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452777929] [2025-03-08 02:22:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452777929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:22:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407271568] [2025-03-08 02:22:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:33,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:22:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:33,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:22:33,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:22:33,632 INFO L87 Difference]: Start difference. First operand 166126 states and 181895 transitions. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)