./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label17.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/Problem11_label17.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 a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:41:47,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:41:47,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:41:47,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:41:47,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:41:47,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:41:47,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:41:47,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:41:47,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:41:47,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:41:47,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:41:47,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:41:47,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:41:47,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:41:47,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:41:47,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:41:47,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:41:47,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:41:47,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:41:47,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:41:47,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:41:47,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:41:47,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:41:47,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:41:47,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:41:47,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:41:47,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:41:47,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:41:47,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:41:47,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:41:47,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:41:47,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:41:47,895 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 -> a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd [2025-03-08 01:41:48,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:41:48,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:41:48,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:41:48,118 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:41:48,118 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:41:48,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2025-03-08 01:41:49,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935ed71c1/1860e077f1fa4efa8e33d9b3f14baee5/FLAG33c44a3f9 [2025-03-08 01:41:49,627 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:41:49,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2025-03-08 01:41:49,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935ed71c1/1860e077f1fa4efa8e33d9b3f14baee5/FLAG33c44a3f9 [2025-03-08 01:41:49,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935ed71c1/1860e077f1fa4efa8e33d9b3f14baee5 [2025-03-08 01:41:49,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:41:49,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:41:49,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:41:49,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:41:49,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:41:49,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:49" (1/1) ... [2025-03-08 01:41:49,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db1ee92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:49, skipping insertion in model container [2025-03-08 01:41:49,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:49" (1/1) ... [2025-03-08 01:41:49,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:41:49,858 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/Problem11_label17.c[5541,5554] [2025-03-08 01:41:50,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:41:50,043 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:41:50,059 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/Problem11_label17.c[5541,5554] [2025-03-08 01:41:50,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:41:50,137 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:41:50,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50 WrapperNode [2025-03-08 01:41:50,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:41:50,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:41:50,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:41:50,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:41:50,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,231 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-08 01:41:50,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:41:50,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:41:50,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:41:50,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:41:50,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,327 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:41:50,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:41:50,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:41:50,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:41:50,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:41:50,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (1/1) ... [2025-03-08 01:41:50,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:41:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:50,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:41:50,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:41:50,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:41:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:41:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:41:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:41:50,498 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:41:50,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:41:51,690 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 01:41:51,690 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:41:51,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:41:51,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:41:51,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:51 BoogieIcfgContainer [2025-03-08 01:41:51,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:41:51,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:41:51,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:41:51,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:41:51,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:41:49" (1/3) ... [2025-03-08 01:41:51,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cdb71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:51, skipping insertion in model container [2025-03-08 01:41:51,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:50" (2/3) ... [2025-03-08 01:41:51,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cdb71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:51, skipping insertion in model container [2025-03-08 01:41:51,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:51" (3/3) ... [2025-03-08 01:41:51,727 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label17.c [2025-03-08 01:41:51,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:41:51,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label17.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:41:51,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:41:51,802 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;@53579692, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:41:51,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:41:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 01:41:51,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:51,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:51,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:51,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1524264206, now seen corresponding path program 1 times [2025-03-08 01:41:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:51,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133917402] [2025-03-08 01:41:51,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:51,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 01:41:51,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 01:41:51,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:51,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:52,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133917402] [2025-03-08 01:41:52,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133917402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:52,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:52,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:52,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085839444] [2025-03-08 01:41:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:52,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:52,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:52,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:52,087 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:52,961 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-03-08 01:41:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 01:41:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:52,971 INFO L225 Difference]: With dead ends: 769 [2025-03-08 01:41:52,971 INFO L226 Difference]: Without dead ends: 422 [2025-03-08 01:41:52,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:52,982 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:52,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:41:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-08 01:41:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-03-08 01:41:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-03-08 01:41:53,026 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 38 [2025-03-08 01:41:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:53,027 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-03-08 01:41:53,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-03-08 01:41:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 01:41:53,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:53,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:53,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:41:53,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash -738039096, now seen corresponding path program 1 times [2025-03-08 01:41:53,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:53,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595032236] [2025-03-08 01:41:53,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:53,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:53,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 01:41:53,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 01:41:53,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:53,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:53,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595032236] [2025-03-08 01:41:53,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595032236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:53,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:53,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889603684] [2025-03-08 01:41:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:53,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:53,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:53,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:53,256 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:53,877 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-03-08 01:41:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-08 01:41:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:53,881 INFO L225 Difference]: With dead ends: 1199 [2025-03-08 01:41:53,881 INFO L226 Difference]: Without dead ends: 789 [2025-03-08 01:41:53,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:53,882 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:53,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-08 01:41:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-03-08 01:41:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-03-08 01:41:53,904 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 104 [2025-03-08 01:41:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:53,904 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-03-08 01:41:53,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-03-08 01:41:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 01:41:53,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:53,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:53,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:41:53,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:53,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash -747539522, now seen corresponding path program 1 times [2025-03-08 01:41:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388649019] [2025-03-08 01:41:53,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:53,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 01:41:53,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 01:41:53,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:53,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:54,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388649019] [2025-03-08 01:41:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388649019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:54,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193214415] [2025-03-08 01:41:54,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:54,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:54,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:54,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:54,171 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:54,744 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-03-08 01:41:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:54,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-08 01:41:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:54,749 INFO L225 Difference]: With dead ends: 2314 [2025-03-08 01:41:54,749 INFO L226 Difference]: Without dead ends: 1527 [2025-03-08 01:41:54,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:54,753 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:54,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:41:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-08 01:41:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-03-08 01:41:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-03-08 01:41:54,778 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 108 [2025-03-08 01:41:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:54,779 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-03-08 01:41:54,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-03-08 01:41:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 01:41:54,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:54,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:54,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:41:54,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:54,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -317625487, now seen corresponding path program 1 times [2025-03-08 01:41:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:54,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820378657] [2025-03-08 01:41:54,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:54,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 01:41:54,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 01:41:54,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:54,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820378657] [2025-03-08 01:41:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820378657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136647483] [2025-03-08 01:41:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:54,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:54,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:54,988 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:55,573 INFO L93 Difference]: Finished difference Result 3257 states and 4123 transitions. [2025-03-08 01:41:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-08 01:41:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:55,580 INFO L225 Difference]: With dead ends: 3257 [2025-03-08 01:41:55,580 INFO L226 Difference]: Without dead ends: 1917 [2025-03-08 01:41:55,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:55,583 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 197 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:55,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-03-08 01:41:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-03-08 01:41:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.2462101411395714) internal successors, (2384), 1913 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2384 transitions. [2025-03-08 01:41:55,621 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2384 transitions. Word has length 165 [2025-03-08 01:41:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:55,622 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2384 transitions. [2025-03-08 01:41:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2384 transitions. [2025-03-08 01:41:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 01:41:55,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:55,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:55,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:41:55,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1482582011, now seen corresponding path program 1 times [2025-03-08 01:41:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070990055] [2025-03-08 01:41:55,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:55,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 01:41:55,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 01:41:55,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:55,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 01:41:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:55,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070990055] [2025-03-08 01:41:55,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070990055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:55,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:55,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776421230] [2025-03-08 01:41:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:55,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:55,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:55,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:55,854 INFO L87 Difference]: Start difference. First operand 1914 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:56,529 INFO L93 Difference]: Finished difference Result 4389 states and 5590 transitions. [2025-03-08 01:41:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 220 [2025-03-08 01:41:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:56,537 INFO L225 Difference]: With dead ends: 4389 [2025-03-08 01:41:56,537 INFO L226 Difference]: Without dead ends: 2661 [2025-03-08 01:41:56,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:56,541 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:56,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-03-08 01:41:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2467. [2025-03-08 01:41:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.2347931873479319) internal successors, (3045), 2466 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3045 transitions. [2025-03-08 01:41:56,571 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3045 transitions. Word has length 220 [2025-03-08 01:41:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:56,571 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3045 transitions. [2025-03-08 01:41:56,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3045 transitions. [2025-03-08 01:41:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 01:41:56,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:56,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:56,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:41:56,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:56,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1186717100, now seen corresponding path program 1 times [2025-03-08 01:41:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:56,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221600559] [2025-03-08 01:41:56,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:56,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 01:41:56,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 01:41:56,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:56,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-08 01:41:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:56,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221600559] [2025-03-08 01:41:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221600559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:56,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:56,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159681061] [2025-03-08 01:41:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:56,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:56,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:56,760 INFO L87 Difference]: Start difference. First operand 2467 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:57,391 INFO L93 Difference]: Finished difference Result 5862 states and 7297 transitions. [2025-03-08 01:41:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 226 [2025-03-08 01:41:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:57,399 INFO L225 Difference]: With dead ends: 5862 [2025-03-08 01:41:57,399 INFO L226 Difference]: Without dead ends: 3397 [2025-03-08 01:41:57,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:57,402 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 158 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:57,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 390 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2025-03-08 01:41:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3388. [2025-03-08 01:41:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 3387 states have (on average 1.2078535577206968) internal successors, (4091), 3387 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4091 transitions. [2025-03-08 01:41:57,442 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4091 transitions. Word has length 226 [2025-03-08 01:41:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:57,442 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4091 transitions. [2025-03-08 01:41:57,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4091 transitions. [2025-03-08 01:41:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 01:41:57,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:57,447 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:57,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:41:57,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:57,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash -928871216, now seen corresponding path program 1 times [2025-03-08 01:41:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569443382] [2025-03-08 01:41:57,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:57,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 01:41:57,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 01:41:57,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:57,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 01:41:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569443382] [2025-03-08 01:41:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569443382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:57,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636568751] [2025-03-08 01:41:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:57,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:57,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:57,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:57,662 INFO L87 Difference]: Start difference. First operand 3388 states and 4091 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:58,249 INFO L93 Difference]: Finished difference Result 6788 states and 8205 transitions. [2025-03-08 01:41:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:58,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 297 [2025-03-08 01:41:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:58,257 INFO L225 Difference]: With dead ends: 6788 [2025-03-08 01:41:58,257 INFO L226 Difference]: Without dead ends: 3402 [2025-03-08 01:41:58,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:58,260 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 137 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:58,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 336 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2025-03-08 01:41:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3020. [2025-03-08 01:41:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 3019 states have (on average 1.181517058628685) internal successors, (3567), 3019 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 3567 transitions. [2025-03-08 01:41:58,301 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 3567 transitions. Word has length 297 [2025-03-08 01:41:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:58,302 INFO L471 AbstractCegarLoop]: Abstraction has 3020 states and 3567 transitions. [2025-03-08 01:41:58,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 3567 transitions. [2025-03-08 01:41:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 01:41:58,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:58,307 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:58,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:41:58,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:58,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:58,307 INFO L85 PathProgramCache]: Analyzing trace with hash 135396914, now seen corresponding path program 1 times [2025-03-08 01:41:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:58,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106712840] [2025-03-08 01:41:58,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:58,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 01:41:58,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 01:41:58,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:58,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 01:41:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106712840] [2025-03-08 01:41:58,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106712840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:58,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137582862] [2025-03-08 01:41:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:58,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:58,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:58,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:58,470 INFO L87 Difference]: Start difference. First operand 3020 states and 3567 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:59,016 INFO L93 Difference]: Finished difference Result 6015 states and 7099 transitions. [2025-03-08 01:41:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 298 [2025-03-08 01:41:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:59,022 INFO L225 Difference]: With dead ends: 6015 [2025-03-08 01:41:59,022 INFO L226 Difference]: Without dead ends: 2997 [2025-03-08 01:41:59,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:59,025 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 161 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:59,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 149 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:41:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2025-03-08 01:41:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2995. [2025-03-08 01:41:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2994 states have (on average 1.1329325317301269) internal successors, (3392), 2994 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3392 transitions. [2025-03-08 01:41:59,054 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3392 transitions. Word has length 298 [2025-03-08 01:41:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:59,054 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 3392 transitions. [2025-03-08 01:41:59,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3392 transitions. [2025-03-08 01:41:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-08 01:41:59,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:59,060 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 01:41:59,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:41:59,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:59,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1590516331, now seen corresponding path program 1 times [2025-03-08 01:41:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447304514] [2025-03-08 01:41:59,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:59,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-08 01:41:59,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-08 01:41:59,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:59,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-08 01:41:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:59,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447304514] [2025-03-08 01:41:59,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447304514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:59,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:59,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:59,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048447487] [2025-03-08 01:41:59,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:59,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:59,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:59,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:59,187 INFO L87 Difference]: Start difference. First operand 2995 states and 3392 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:59,751 INFO L93 Difference]: Finished difference Result 8015 states and 9148 transitions. [2025-03-08 01:41:59,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:59,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 303 [2025-03-08 01:41:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:59,762 INFO L225 Difference]: With dead ends: 8015 [2025-03-08 01:41:59,762 INFO L226 Difference]: Without dead ends: 5022 [2025-03-08 01:41:59,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:59,766 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 195 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:59,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 71 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:41:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2025-03-08 01:41:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 5019. [2025-03-08 01:41:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5019 states, 5018 states have (on average 1.1367078517337585) internal successors, (5704), 5018 states have internal predecessors, (5704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 5704 transitions. [2025-03-08 01:41:59,816 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 5704 transitions. Word has length 303 [2025-03-08 01:41:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:59,817 INFO L471 AbstractCegarLoop]: Abstraction has 5019 states and 5704 transitions. [2025-03-08 01:41:59,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 5704 transitions. [2025-03-08 01:41:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 01:41:59,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:59,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:59,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:41:59,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:59,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash -967794566, now seen corresponding path program 1 times [2025-03-08 01:41:59,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:59,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360708477] [2025-03-08 01:41:59,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:59,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 01:41:59,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 01:41:59,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:59,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:00,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360708477] [2025-03-08 01:42:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360708477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:00,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:00,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:42:00,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011341232] [2025-03-08 01:42:00,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:00,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:42:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:00,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:42:00,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:00,102 INFO L87 Difference]: Start difference. First operand 5019 states and 5704 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:01,029 INFO L93 Difference]: Finished difference Result 12616 states and 14338 transitions. [2025-03-08 01:42:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:42:01,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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 343 [2025-03-08 01:42:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:01,054 INFO L225 Difference]: With dead ends: 12616 [2025-03-08 01:42:01,054 INFO L226 Difference]: Without dead ends: 7599 [2025-03-08 01:42:01,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:01,062 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 246 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:01,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 64 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:42:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2025-03-08 01:42:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 6309. [2025-03-08 01:42:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6309 states, 6308 states have (on average 1.126981610653139) internal successors, (7109), 6308 states have internal predecessors, (7109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6309 states to 6309 states and 7109 transitions. [2025-03-08 01:42:01,148 INFO L78 Accepts]: Start accepts. Automaton has 6309 states and 7109 transitions. Word has length 343 [2025-03-08 01:42:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:01,149 INFO L471 AbstractCegarLoop]: Abstraction has 6309 states and 7109 transitions. [2025-03-08 01:42:01,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6309 states and 7109 transitions. [2025-03-08 01:42:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-08 01:42:01,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:01,167 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 01:42:01,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:42:01,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:01,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash 311355250, now seen corresponding path program 1 times [2025-03-08 01:42:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:01,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892485415] [2025-03-08 01:42:01,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:01,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-08 01:42:01,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-08 01:42:01,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:01,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 01:42:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892485415] [2025-03-08 01:42:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892485415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:42:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578752838] [2025-03-08 01:42:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:42:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:01,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:42:01,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:01,509 INFO L87 Difference]: Start difference. First operand 6309 states and 7109 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:02,376 INFO L93 Difference]: Finished difference Result 13906 states and 15652 transitions. [2025-03-08 01:42:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:42:02,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 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 417 [2025-03-08 01:42:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:02,391 INFO L225 Difference]: With dead ends: 13906 [2025-03-08 01:42:02,391 INFO L226 Difference]: Without dead ends: 7599 [2025-03-08 01:42:02,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:02,395 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 246 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:02,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 64 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:42:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2025-03-08 01:42:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 5941. [2025-03-08 01:42:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5941 states, 5940 states have (on average 1.1257575757575757) internal successors, (6687), 5940 states have internal predecessors, (6687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 6687 transitions. [2025-03-08 01:42:02,462 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 6687 transitions. Word has length 417 [2025-03-08 01:42:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:02,463 INFO L471 AbstractCegarLoop]: Abstraction has 5941 states and 6687 transitions. [2025-03-08 01:42:02,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 6687 transitions. [2025-03-08 01:42:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-03-08 01:42:02,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:02,471 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:42:02,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:42:02,471 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:02,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash -824544976, now seen corresponding path program 1 times [2025-03-08 01:42:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117957427] [2025-03-08 01:42:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:02,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-03-08 01:42:02,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-03-08 01:42:02,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:02,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-08 01:42:02,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117957427] [2025-03-08 01:42:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117957427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:02,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:02,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:42:02,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064595401] [2025-03-08 01:42:02,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:02,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:42:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:02,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:42:02,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:02,759 INFO L87 Difference]: Start difference. First operand 5941 states and 6687 transitions. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:03,565 INFO L93 Difference]: Finished difference Result 17604 states and 19842 transitions. [2025-03-08 01:42:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:42:03,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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 668 [2025-03-08 01:42:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:03,580 INFO L225 Difference]: With dead ends: 17604 [2025-03-08 01:42:03,580 INFO L226 Difference]: Without dead ends: 11665 [2025-03-08 01:42:03,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:42:03,586 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 209 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:03,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 77 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:42:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11665 states. [2025-03-08 01:42:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11665 to 11479. [2025-03-08 01:42:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11479 states, 11478 states have (on average 1.11787767903816) internal successors, (12831), 11478 states have internal predecessors, (12831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11479 states to 11479 states and 12831 transitions. [2025-03-08 01:42:03,717 INFO L78 Accepts]: Start accepts. Automaton has 11479 states and 12831 transitions. Word has length 668 [2025-03-08 01:42:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:03,718 INFO L471 AbstractCegarLoop]: Abstraction has 11479 states and 12831 transitions. [2025-03-08 01:42:03,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 11479 states and 12831 transitions. [2025-03-08 01:42:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-03-08 01:42:03,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:03,739 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:42:03,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:42:03,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:03,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1851050400, now seen corresponding path program 1 times [2025-03-08 01:42:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028046460] [2025-03-08 01:42:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:03,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-03-08 01:42:03,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-03-08 01:42:03,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:03,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1619 backedges. 961 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-03-08 01:42:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028046460] [2025-03-08 01:42:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028046460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:42:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016125693] [2025-03-08 01:42:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:04,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:04,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:04,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:04,003 INFO L87 Difference]: Start difference. First operand 11479 states and 12831 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:04,470 INFO L93 Difference]: Finished difference Result 23320 states and 26089 transitions. [2025-03-08 01:42:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:04,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 736 [2025-03-08 01:42:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:04,483 INFO L225 Difference]: With dead ends: 23320 [2025-03-08 01:42:04,483 INFO L226 Difference]: Without dead ends: 12029 [2025-03-08 01:42:04,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:04,492 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 196 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:04,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 349 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:42:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12029 states. [2025-03-08 01:42:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12029 to 12029. [2025-03-08 01:42:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12029 states, 12028 states have (on average 1.0999334885267709) internal successors, (13230), 12028 states have internal predecessors, (13230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12029 states to 12029 states and 13230 transitions. [2025-03-08 01:42:04,637 INFO L78 Accepts]: Start accepts. Automaton has 12029 states and 13230 transitions. Word has length 736 [2025-03-08 01:42:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:04,638 INFO L471 AbstractCegarLoop]: Abstraction has 12029 states and 13230 transitions. [2025-03-08 01:42:04,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 12029 states and 13230 transitions. [2025-03-08 01:42:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-08 01:42:04,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:42:04,650 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-08 01:42:04,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:42:04,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:04,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash -660134726, now seen corresponding path program 1 times [2025-03-08 01:42:04,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:04,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554244357] [2025-03-08 01:42:04,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:04,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:04,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-08 01:42:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-08 01:42:04,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:04,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 1445 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2025-03-08 01:42:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554244357] [2025-03-08 01:42:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554244357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:42:04,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:42:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:42:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242672727] [2025-03-08 01:42:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:42:04,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:42:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:04,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:42:04,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:04,945 INFO L87 Difference]: Start difference. First operand 12029 states and 13230 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:05,390 INFO L93 Difference]: Finished difference Result 23497 states and 25801 transitions. [2025-03-08 01:42:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:42:05,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 836 [2025-03-08 01:42:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:05,391 INFO L225 Difference]: With dead ends: 23497 [2025-03-08 01:42:05,391 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:42:05,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:42:05,401 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 61 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:05,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 316 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:42:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:42:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:42:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:42:05,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 836 [2025-03-08 01:42:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:05,402 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:42:05,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:42:05,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:42:05,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:42:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:42:05,407 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:42:05,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:42:06,428 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:42:06,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:42:06 BoogieIcfgContainer [2025-03-08 01:42:06,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:42:06,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:42:06,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:42:06,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:42:06,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:51" (3/4) ... [2025-03-08 01:42:06,448 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:42:06,466 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:42:06,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:42:06,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:42:06,469 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:42:06,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:42:06,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:42:06,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:42:06,588 INFO L158 Benchmark]: Toolchain (without parser) took 16918.22ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 111.6MB in the beginning and 450.7MB in the end (delta: -339.1MB). Peak memory consumption was 186.3MB. Max. memory is 16.1GB. [2025-03-08 01:42:06,588 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:42:06,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.94ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 68.6MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 01:42:06,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.62ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 51.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:42:06,589 INFO L158 Benchmark]: Boogie Preprocessor took 167.03ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 89.6MB in the end (delta: -38.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-08 01:42:06,589 INFO L158 Benchmark]: IcfgBuilder took 1318.45ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 99.3MB in the end (delta: -9.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-03-08 01:42:06,589 INFO L158 Benchmark]: TraceAbstraction took 14721.16ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 98.3MB in the beginning and 467.5MB in the end (delta: -369.2MB). Peak memory consumption was 418.2MB. Max. memory is 16.1GB. [2025-03-08 01:42:06,589 INFO L158 Benchmark]: Witness Printer took 143.26ms. Allocated memory is still 671.1MB. Free memory was 467.5MB in the beginning and 450.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:42:06,590 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.94ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 68.6MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.62ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 51.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 167.03ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 89.6MB in the end (delta: -38.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1318.45ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 99.3MB in the end (delta: -9.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14721.16ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 98.3MB in the beginning and 467.5MB in the end (delta: -369.2MB). Peak memory consumption was 418.2MB. Max. memory is 16.1GB. * Witness Printer took 143.26ms. Allocated memory is still 671.1MB. Free memory was 467.5MB in the beginning and 450.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 130]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 481 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2442 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2442 mSDsluCounter, 3063 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 1758 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9166 IncrementalHoareTripleChecker+Invalid, 10924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1758 mSolverCounterUnsat, 2719 mSDtfsCounter, 9166 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12029occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 3738 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4759 NumberOfCodeBlocks, 4759 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4745 ConstructedInterpolants, 0 QuantifiedInterpolants, 8237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6845/6845 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) || ((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312))) || (((a25 == 13) && (a29 <= 599998)) && (a4 == 1))) || ((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((((a29 <= 277) && (a4 == 0)) && (a25 <= 10)) && (a23 <= 138))) || (((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 277)) && (a4 == 0))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 12) && (a29 <= 277)) && (a4 == 1))) || (((a25 == 12) && (a29 <= 277)) && (a4 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:42:06,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE