./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label32.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_label32.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 945da3531442ca75d7daec1419723c023475934380c17b86b02d54eed69aad3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:21:54,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:21:54,328 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:54,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:21:54,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:21:54,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:21:54,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:21:54,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:21:54,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:21:54,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:21:54,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:21:54,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:21:54,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:21:54,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:21:54,360 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:21:54,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:21:54,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:21:54,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:21:54,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:21:54,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:21:54,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:21:54,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:21:54,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:21:54,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:21:54,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:21:54,364 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 -> 945da3531442ca75d7daec1419723c023475934380c17b86b02d54eed69aad3f [2025-03-08 02:21:54,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:21:54,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:21:54,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:21:54,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:21:54,628 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:21:54,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label32.c [2025-03-08 02:21:55,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2b2896/7c11277ac0ae48b2b91e13476fef8616/FLAG845b140e8 [2025-03-08 02:21:56,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:21:56,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label32.c [2025-03-08 02:21:56,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2b2896/7c11277ac0ae48b2b91e13476fef8616/FLAG845b140e8 [2025-03-08 02:21:56,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2b2896/7c11277ac0ae48b2b91e13476fef8616 [2025-03-08 02:21:56,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:21:56,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:21:56,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:21:56,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:21:56,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:21:56,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:21:56" (1/1) ... [2025-03-08 02:21:56,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72645251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:56, skipping insertion in model container [2025-03-08 02:21:56,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:21:56" (1/1) ... [2025-03-08 02:21:56,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:21:56,677 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_label32.c[2877,2890] [2025-03-08 02:21:57,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:21:57,375 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:21:57,384 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_label32.c[2877,2890] [2025-03-08 02:21:57,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:21:57,911 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:21:57,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:57 WrapperNode [2025-03-08 02:21:57,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:21:57,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:21:57,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:21:57,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:21:57,920 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:57" (1/1) ... [2025-03-08 02:21:58,003 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:57" (1/1) ... [2025-03-08 02:21:58,463 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:21:58,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:21:58,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:21:58,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:21:58,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:21:58,470 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:57" (1/1) ... [2025-03-08 02:21:58,470 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:57" (1/1) ... [2025-03-08 02:21:58,604 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:57" (1/1) ... [2025-03-08 02:21:58,921 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:58,922 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:57" (1/1) ... [2025-03-08 02:21:58,922 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:57" (1/1) ... [2025-03-08 02:21:59,140 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:57" (1/1) ... [2025-03-08 02:21:59,162 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:57" (1/1) ... [2025-03-08 02:21:59,192 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:57" (1/1) ... [2025-03-08 02:21:59,218 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:57" (1/1) ... [2025-03-08 02:21:59,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:21:59,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:21:59,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:21:59,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:21:59,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:57" (1/1) ... [2025-03-08 02:21:59,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:21:59,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:21:59,333 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:59,336 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:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:21:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:21:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:21:59,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:21:59,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:21:59,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:22:05,472 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:22:05,473 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:22:05,473 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:22:05,473 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:22:05,473 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:22:05,766 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:22:05,767 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:22:05,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:22:05,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:22:05,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:05 BoogieIcfgContainer [2025-03-08 02:22:05,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:22:05,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:22:05,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:22:05,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:22:05,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:21:56" (1/3) ... [2025-03-08 02:22:05,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245f097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:05, skipping insertion in model container [2025-03-08 02:22:05,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:57" (2/3) ... [2025-03-08 02:22:05,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7245f097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:22:05, skipping insertion in model container [2025-03-08 02:22:05,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:22:05" (3/3) ... [2025-03-08 02:22:05,818 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label32.c [2025-03-08 02:22:05,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:22:05,833 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label32.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:22:05,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:22:06,011 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;@5e872140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:22:06,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:22:06,024 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:22:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 02:22:06,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:06,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:22:06,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:06,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1437365075, now seen corresponding path program 1 times [2025-03-08 02:22:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14422523] [2025-03-08 02:22:06,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:06,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 02:22:06,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 02:22:06,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:06,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:06,240 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:22:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14422523] [2025-03-08 02:22:06,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14422523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:06,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:06,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017417636] [2025-03-08 02:22:06,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:06,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:06,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:06,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:06,267 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 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:11,552 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-03-08 02:22:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-08 02:22:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:11,574 INFO L225 Difference]: With dead ends: 4919 [2025-03-08 02:22:11,574 INFO L226 Difference]: Without dead ends: 3107 [2025-03-08 02:22:11,580 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:11,582 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1534 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 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, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:11,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1458 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 02:22:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-03-08 02:22:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-03-08 02:22:11,718 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:22:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-03-08 02:22:11,746 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 19 [2025-03-08 02:22:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:11,746 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-03-08 02:22:11,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-03-08 02:22:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 02:22:11,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:11,748 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:22:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:22:11,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:11,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1116142870, now seen corresponding path program 1 times [2025-03-08 02:22:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480241120] [2025-03-08 02:22:11,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:11,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 02:22:11,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 02:22:11,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:11,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480241120] [2025-03-08 02:22:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480241120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:12,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:12,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197866098] [2025-03-08 02:22:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:12,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:12,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:12,011 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:17,258 INFO L93 Difference]: Finished difference Result 9097 states and 15084 transitions. [2025-03-08 02:22:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-08 02:22:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:17,278 INFO L225 Difference]: With dead ends: 9097 [2025-03-08 02:22:17,278 INFO L226 Difference]: Without dead ends: 5993 [2025-03-08 02:22:17,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:17,285 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:17,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 02:22:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2025-03-08 02:22:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5991. [2025-03-08 02:22:17,372 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:22:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 9621 transitions. [2025-03-08 02:22:17,382 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 9621 transitions. Word has length 88 [2025-03-08 02:22:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:17,383 INFO L471 AbstractCegarLoop]: Abstraction has 5991 states and 9621 transitions. [2025-03-08 02:22:17,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 9621 transitions. [2025-03-08 02:22:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 02:22:17,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:17,387 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:22:17,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:22:17,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:17,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1064839554, now seen corresponding path program 1 times [2025-03-08 02:22:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:17,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292891247] [2025-03-08 02:22:17,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:17,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:17,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 02:22:17,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 02:22:17,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:17,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:17,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:17,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292891247] [2025-03-08 02:22:17,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292891247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:17,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090993069] [2025-03-08 02:22:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:17,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:17,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:17,555 INFO L87 Difference]: Start difference. First operand 5991 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:22,182 INFO L93 Difference]: Finished difference Result 17559 states and 28308 transitions. [2025-03-08 02:22:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:22,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 02:22:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:22,239 INFO L225 Difference]: With dead ends: 17559 [2025-03-08 02:22:22,240 INFO L226 Difference]: Without dead ends: 11570 [2025-03-08 02:22:22,249 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:22,250 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1445 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1732 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:22,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1732 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 02:22:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11570 states. [2025-03-08 02:22:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11570 to 11517. [2025-03-08 02:22:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.4296630774574506) internal successors, (16464), 11516 states have internal predecessors, (16464), 0 states have call successors, (0), 0 states 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:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 16464 transitions. [2025-03-08 02:22:22,550 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 16464 transitions. Word has length 93 [2025-03-08 02:22:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:22,552 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 16464 transitions. [2025-03-08 02:22:22,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 16464 transitions. [2025-03-08 02:22:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 02:22:22,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:22,555 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:22:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:22:22,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:22,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:22,561 INFO L85 PathProgramCache]: Analyzing trace with hash 444928676, now seen corresponding path program 1 times [2025-03-08 02:22:22,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:22,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215684463] [2025-03-08 02:22:22,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:22,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 02:22:22,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 02:22:22,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:22,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215684463] [2025-03-08 02:22:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215684463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113002258] [2025-03-08 02:22:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:22,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:22,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:22,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:22,754 INFO L87 Difference]: Start difference. First operand 11517 states and 16464 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:27,502 INFO L93 Difference]: Finished difference Result 34168 states and 48911 transitions. [2025-03-08 02:22:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:27,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-08 02:22:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:27,549 INFO L225 Difference]: With dead ends: 34168 [2025-03-08 02:22:27,549 INFO L226 Difference]: Without dead ends: 22653 [2025-03-08 02:22:27,562 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:27,563 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:27,563 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.6s Time] [2025-03-08 02:22:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2025-03-08 02:22:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 21271. [2025-03-08 02:22:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21271 states, 21270 states have (on average 1.2866478608368594) internal successors, (27367), 21270 states have internal predecessors, (27367), 0 states have call successors, (0), 0 states 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:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 27367 transitions. [2025-03-08 02:22:27,843 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 27367 transitions. Word has length 116 [2025-03-08 02:22:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:27,844 INFO L471 AbstractCegarLoop]: Abstraction has 21271 states and 27367 transitions. [2025-03-08 02:22:27,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 27367 transitions. [2025-03-08 02:22:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 02:22:27,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:27,848 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:22:27,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:22:27,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:27,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash -741667436, now seen corresponding path program 1 times [2025-03-08 02:22:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:27,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726761945] [2025-03-08 02:22:27,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:27,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 02:22:27,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 02:22:27,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:27,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:27,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:27,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726761945] [2025-03-08 02:22:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726761945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:27,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:27,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825544249] [2025-03-08 02:22:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:27,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:27,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:27,994 INFO L87 Difference]: Start difference. First operand 21271 states and 27367 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:33,188 INFO L93 Difference]: Finished difference Result 63157 states and 81268 transitions. [2025-03-08 02:22:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:33,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-03-08 02:22:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:33,334 INFO L225 Difference]: With dead ends: 63157 [2025-03-08 02:22:33,334 INFO L226 Difference]: Without dead ends: 41888 [2025-03-08 02:22:33,362 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:33,363 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 1467 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:33,363 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.9s Time] [2025-03-08 02:22:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41888 states. [2025-03-08 02:22:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41888 to 40473. [2025-03-08 02:22:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40473 states, 40472 states have (on average 1.1933188377149635) internal successors, (48296), 40472 states have internal predecessors, (48296), 0 states have call successors, (0), 0 states 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,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40473 states to 40473 states and 48296 transitions. [2025-03-08 02:22:33,775 INFO L78 Accepts]: Start accepts. Automaton has 40473 states and 48296 transitions. Word has length 157 [2025-03-08 02:22:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:33,775 INFO L471 AbstractCegarLoop]: Abstraction has 40473 states and 48296 transitions. [2025-03-08 02:22:33,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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,776 INFO L276 IsEmpty]: Start isEmpty. Operand 40473 states and 48296 transitions. [2025-03-08 02:22:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-08 02:22:33,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:33,779 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:22:33,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:33,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash -613448964, now seen corresponding path program 1 times [2025-03-08 02:22:33,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:33,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369863584] [2025-03-08 02:22:33,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:33,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-08 02:22:33,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-08 02:22:33,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:33,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 02:22:34,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369863584] [2025-03-08 02:22:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369863584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:22:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233863011] [2025-03-08 02:22:34,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:34,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:22:34,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:34,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:22:34,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:22:34,679 INFO L87 Difference]: Start difference. First operand 40473 states and 48296 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:22:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:41,428 INFO L93 Difference]: Finished difference Result 100135 states and 117552 transitions. [2025-03-08 02:22:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:22:41,429 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 386 [2025-03-08 02:22:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:41,523 INFO L225 Difference]: With dead ends: 100135 [2025-03-08 02:22:41,524 INFO L226 Difference]: Without dead ends: 59664 [2025-03-08 02:22:41,546 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:22:41,548 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9446 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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:22:41,548 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:22:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59664 states. [2025-03-08 02:22:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59664 to 56892. [2025-03-08 02:22:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56892 states, 56891 states have (on average 1.154470830184036) internal successors, (65679), 56891 states have internal predecessors, (65679), 0 states have call successors, (0), 0 states 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:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56892 states to 56892 states and 65679 transitions. [2025-03-08 02:22:42,049 INFO L78 Accepts]: Start accepts. Automaton has 56892 states and 65679 transitions. Word has length 386 [2025-03-08 02:22:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:42,050 INFO L471 AbstractCegarLoop]: Abstraction has 56892 states and 65679 transitions. [2025-03-08 02:22:42,050 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:22:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 56892 states and 65679 transitions. [2025-03-08 02:22:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-08 02:22:42,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:42,055 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:22:42,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:42,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1200073814, now seen corresponding path program 1 times [2025-03-08 02:22:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:42,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552017319] [2025-03-08 02:22:42,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:42,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-08 02:22:42,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-08 02:22:42,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:42,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:42,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552017319] [2025-03-08 02:22:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552017319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:22:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254877821] [2025-03-08 02:22:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:42,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:22:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:42,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:22:42,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:22:42,758 INFO L87 Difference]: Start difference. First operand 56892 states and 65679 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:47,836 INFO L93 Difference]: Finished difference Result 116543 states and 134135 transitions. [2025-03-08 02:22:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:22:47,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 414 [2025-03-08 02:22:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:47,915 INFO L225 Difference]: With dead ends: 116543 [2025-03-08 02:22:47,915 INFO L226 Difference]: Without dead ends: 59622 [2025-03-08 02:22:47,948 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:47,949 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:47,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2114 Invalid, 7327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7319 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 02:22:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59622 states. [2025-03-08 02:22:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59622 to 59622. [2025-03-08 02:22:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59622 states, 59621 states have (on average 1.1474815920564903) internal successors, (68414), 59621 states have internal predecessors, (68414), 0 states have call successors, (0), 0 states 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:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59622 states to 59622 states and 68414 transitions. [2025-03-08 02:22:48,564 INFO L78 Accepts]: Start accepts. Automaton has 59622 states and 68414 transitions. Word has length 414 [2025-03-08 02:22:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 59622 states and 68414 transitions. [2025-03-08 02:22:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 59622 states and 68414 transitions. [2025-03-08 02:22:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-08 02:22:48,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:48,570 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:22:48,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 738614859, now seen corresponding path program 1 times [2025-03-08 02:22:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504995038] [2025-03-08 02:22:48,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:48,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-08 02:22:48,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 02:22:48,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:48,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:49,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:49,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504995038] [2025-03-08 02:22:49,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504995038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:49,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:49,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:22:49,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077714184] [2025-03-08 02:22:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:49,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:49,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:49,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:49,126 INFO L87 Difference]: Start difference. First operand 59622 states and 68414 transitions. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:54,437 INFO L93 Difference]: Finished difference Result 135757 states and 158848 transitions. [2025-03-08 02:22:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 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 580 [2025-03-08 02:22:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:54,549 INFO L225 Difference]: With dead ends: 135757 [2025-03-08 02:22:54,550 INFO L226 Difference]: Without dead ends: 78867 [2025-03-08 02:22:54,590 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:54,591 INFO L435 NwaCegarLoop]: 2831 mSDtfsCounter, 1453 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:54,591 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.8s Time] [2025-03-08 02:22:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78867 states. [2025-03-08 02:22:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78867 to 77397. [2025-03-08 02:22:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77397 states, 77396 states have (on average 1.14014936172412) internal successors, (88243), 77396 states have internal predecessors, (88243), 0 states have call successors, (0), 0 states 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:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77397 states to 77397 states and 88243 transitions. [2025-03-08 02:22:55,523 INFO L78 Accepts]: Start accepts. Automaton has 77397 states and 88243 transitions. Word has length 580 [2025-03-08 02:22:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:55,526 INFO L471 AbstractCegarLoop]: Abstraction has 77397 states and 88243 transitions. [2025-03-08 02:22:55,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 77397 states and 88243 transitions. [2025-03-08 02:22:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-08 02:22:55,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:55,534 INFO L218 NwaCegarLoop]: trace histogram [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, 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:55,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:22:55,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:55,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1096028014, now seen corresponding path program 1 times [2025-03-08 02:22:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188572991] [2025-03-08 02:22:55,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:55,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-08 02:22:55,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-08 02:22:55,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:55,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 33 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-08 02:22:56,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188572991] [2025-03-08 02:22:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188572991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:22:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666850682] [2025-03-08 02:22:56,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:56,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:22:56,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:22:56,881 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:56,958 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:57,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-08 02:22:57,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-08 02:22:57,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:57,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:57,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:22:57,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:22:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-08 02:22:57,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:22:57,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666850682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:57,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:22:57,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:22:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966656374] [2025-03-08 02:22:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:57,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:57,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:57,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:57,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:22:57,388 INFO L87 Difference]: Start difference. First operand 77397 states and 88243 transitions. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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:23:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:02,813 INFO L93 Difference]: Finished difference Result 180888 states and 208797 transitions. [2025-03-08 02:23:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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 725 [2025-03-08 02:23:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:02,936 INFO L225 Difference]: With dead ends: 180888 [2025-03-08 02:23:02,936 INFO L226 Difference]: Without dead ends: 106223 [2025-03-08 02:23:02,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 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:23:02,983 INFO L435 NwaCegarLoop]: 3058 mSDtfsCounter, 1467 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 4990 mSolverCounterSat, 1009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 3233 SdHoareTripleChecker+Invalid, 5999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1009 IncrementalHoareTripleChecker+Valid, 4990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:02,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 3233 Invalid, 5999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1009 Valid, 4990 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 02:23:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106223 states. [2025-03-08 02:23:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106223 to 104729. [2025-03-08 02:23:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104729 states, 104728 states have (on average 1.1266137040714994) internal successors, (117988), 104728 states have internal predecessors, (117988), 0 states have call successors, (0), 0 states 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:23:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104729 states to 104729 states and 117988 transitions. [2025-03-08 02:23:04,252 INFO L78 Accepts]: Start accepts. Automaton has 104729 states and 117988 transitions. Word has length 725 [2025-03-08 02:23:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:04,254 INFO L471 AbstractCegarLoop]: Abstraction has 104729 states and 117988 transitions. [2025-03-08 02:23:04,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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:23:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 104729 states and 117988 transitions. [2025-03-08 02:23:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2025-03-08 02:23:04,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:04,278 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23:04,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:23:04,487 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:23:04,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:04,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash -296983159, now seen corresponding path program 1 times [2025-03-08 02:23:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935275620] [2025-03-08 02:23:04,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:04,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 878 statements into 1 equivalence classes. [2025-03-08 02:23:04,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 878 of 878 statements. [2025-03-08 02:23:04,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:04,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 02:23:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935275620] [2025-03-08 02:23:05,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935275620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:05,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:23:05,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:23:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879194909] [2025-03-08 02:23:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:05,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:05,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:05,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:23:05,823 INFO L87 Difference]: Start difference. First operand 104729 states and 117988 transitions. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:23:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:23:10,360 INFO L93 Difference]: Finished difference Result 206841 states and 233430 transitions. [2025-03-08 02:23:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:23:10,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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 878 [2025-03-08 02:23:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:23:10,472 INFO L225 Difference]: With dead ends: 206841 [2025-03-08 02:23:10,472 INFO L226 Difference]: Without dead ends: 104844 [2025-03-08 02:23:10,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:23:10,514 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1599 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4248 mSolverCounterSat, 1555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 5803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1555 IncrementalHoareTripleChecker+Valid, 4248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:23:10,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 723 Invalid, 5803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1555 Valid, 4248 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 02:23:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104844 states. [2025-03-08 02:23:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104844 to 104721. [2025-03-08 02:23:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104721 states, 104720 states have (on average 1.1232620320855615) internal successors, (117628), 104720 states have internal predecessors, (117628), 0 states have call successors, (0), 0 states 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:23:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104721 states to 104721 states and 117628 transitions. [2025-03-08 02:23:11,377 INFO L78 Accepts]: Start accepts. Automaton has 104721 states and 117628 transitions. Word has length 878 [2025-03-08 02:23:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:23:11,378 INFO L471 AbstractCegarLoop]: Abstraction has 104721 states and 117628 transitions. [2025-03-08 02:23:11,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:23:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 104721 states and 117628 transitions. [2025-03-08 02:23:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2025-03-08 02:23:11,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:23:11,385 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:23:11,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:23:11,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:23:11,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:23:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1527744809, now seen corresponding path program 1 times [2025-03-08 02:23:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:23:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032129980] [2025-03-08 02:23:11,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:23:11,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 885 statements into 1 equivalence classes. [2025-03-08 02:23:11,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 885 of 885 statements. [2025-03-08 02:23:11,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:11,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 352 proven. 37 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-03-08 02:23:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:23:12,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032129980] [2025-03-08 02:23:12,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032129980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:23:12,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823478987] [2025-03-08 02:23:12,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:23:12,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:23:12,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:23:12,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:23:12,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:23:12,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 885 statements into 1 equivalence classes. [2025-03-08 02:23:13,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 885 of 885 statements. [2025-03-08 02:23:13,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:23:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:23:13,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:23:13,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:23:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-03-08 02:23:13,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:23:13,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823478987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:23:13,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:23:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:23:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561290031] [2025-03-08 02:23:13,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:23:13,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:23:13,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:23:13,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:23:13,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:23:13,091 INFO L87 Difference]: Start difference. First operand 104721 states and 117628 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)