./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label11.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 2521d3888c3910ac16b8a52868332f768d7d80524e896b9e06e11f157c249614 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:31:45,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:31:45,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:31:45,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:31:45,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:31:45,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:31:45,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:31:45,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:31:45,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:31:45,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:31:45,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:31:45,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:31:45,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:31:45,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:31:45,605 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:31:45,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:31:45,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:31:45,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:31:45,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:31:45,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:31:45,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:31:45,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:31:45,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:31:45,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:31:45,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:31:45,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:31:45,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:31:45,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:31:45,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:31:45,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:31:45,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:31:45,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:31:45,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:45,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:31:45,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:31:45,608 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:31:45,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:31:45,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:31:45,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:31:45,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:31:45,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:31:45,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:31:45,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:31:45,609 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 -> 2521d3888c3910ac16b8a52868332f768d7d80524e896b9e06e11f157c249614 [2025-03-03 10:31:45,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:31:45,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:31:45,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:31:45,867 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:31:45,867 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:31:45,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label11.c [2025-03-03 10:31:47,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/895e6cfd2/8b1ea725b2104a669f50c803cdc33fdc/FLAG427a9d5e3 [2025-03-03 10:31:47,323 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:31:47,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label11.c [2025-03-03 10:31:47,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/895e6cfd2/8b1ea725b2104a669f50c803cdc33fdc/FLAG427a9d5e3 [2025-03-03 10:31:47,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/895e6cfd2/8b1ea725b2104a669f50c803cdc33fdc [2025-03-03 10:31:47,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:31:47,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:31:47,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:47,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:31:47,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:31:47,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:47" (1/1) ... [2025-03-03 10:31:47,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2226ab6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:47, skipping insertion in model container [2025-03-03 10:31:47,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:47" (1/1) ... [2025-03-03 10:31:47,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:31:47,795 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_label11.c[8791,8804] [2025-03-03 10:31:47,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:47,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:31:47,981 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_label11.c[8791,8804] [2025-03-03 10:31:48,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:48,066 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:31:48,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48 WrapperNode [2025-03-03 10:31:48,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:48,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:48,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:31:48,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:31:48,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,157 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:31:48,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:48,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:31:48,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:31:48,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:31:48,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,237 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:31:48,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:31:48,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:31:48,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:31:48,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:31:48,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (1/1) ... [2025-03-03 10:31:48,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:48,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:48,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:31:48,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:31:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:31:48,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:31:48,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:31:48,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:31:48,376 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:31:48,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:31:49,590 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:31:49,591 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:31:49,605 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:31:49,606 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:31:49,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:49 BoogieIcfgContainer [2025-03-03 10:31:49,606 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:31:49,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:31:49,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:31:49,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:31:49,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:31:47" (1/3) ... [2025-03-03 10:31:49,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375728f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:49, skipping insertion in model container [2025-03-03 10:31:49,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:48" (2/3) ... [2025-03-03 10:31:49,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375728f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:49, skipping insertion in model container [2025-03-03 10:31:49,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:49" (3/3) ... [2025-03-03 10:31:49,614 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label11.c [2025-03-03 10:31:49,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:31:49,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label11.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:31:49,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:31:49,689 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;@4ea15616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:31:49,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:31:49,694 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-03 10:31:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 10:31:49,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:49,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:49,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:49,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash -992681053, now seen corresponding path program 1 times [2025-03-03 10:31:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445499130] [2025-03-03 10:31:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:49,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 10:31:49,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 10:31:49,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:49,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445499130] [2025-03-03 10:31:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445499130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:50,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:50,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:50,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38972557] [2025-03-03 10:31:50,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:50,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:50,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:50,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:50,066 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 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:50,912 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-03-03 10:31:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:50,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 10:31:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:50,922 INFO L225 Difference]: With dead ends: 769 [2025-03-03 10:31:50,922 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 10:31:50,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:50,929 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 179 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 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-03 10:31:50,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:31:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 10:31:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-03-03 10:31:50,970 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-03 10:31:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-03-03 10:31:50,976 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 61 [2025-03-03 10:31:50,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:50,976 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-03-03 10:31:50,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-03-03 10:31:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 10:31:50,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:50,980 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:50,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:31:50,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:50,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:50,981 INFO L85 PathProgramCache]: Analyzing trace with hash 58010216, now seen corresponding path program 1 times [2025-03-03 10:31:50,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:50,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274368229] [2025-03-03 10:31:50,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:50,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:51,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 10:31:51,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 10:31:51,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:51,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:51,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274368229] [2025-03-03 10:31:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274368229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402591621] [2025-03-03 10:31:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:51,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:51,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:51,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:51,230 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:51,789 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-03-03 10:31:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-03 10:31:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:51,793 INFO L225 Difference]: With dead ends: 1199 [2025-03-03 10:31:51,793 INFO L226 Difference]: Without dead ends: 789 [2025-03-03 10:31:51,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:51,794 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:51,794 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.5s Time] [2025-03-03 10:31:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-03 10:31:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-03-03 10:31:51,810 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-03 10:31:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-03-03 10:31:51,813 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 127 [2025-03-03 10:31:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:51,813 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-03-03 10:31:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-03-03 10:31:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 10:31:51,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:51,815 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, 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] [2025-03-03 10:31:51,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:31:51,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash 504198450, now seen corresponding path program 1 times [2025-03-03 10:31:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:51,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259675153] [2025-03-03 10:31:51,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:51,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 10:31:51,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 10:31:51,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:51,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259675153] [2025-03-03 10:31:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259675153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:52,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:52,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:52,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646526178] [2025-03-03 10:31:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:52,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:52,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:52,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:52,058 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:52,674 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-03-03 10:31:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-03 10:31:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:52,679 INFO L225 Difference]: With dead ends: 2314 [2025-03-03 10:31:52,680 INFO L226 Difference]: Without dead ends: 1527 [2025-03-03 10:31:52,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:52,681 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:52,681 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.6s Time] [2025-03-03 10:31:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-03 10:31:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-03-03 10:31:52,698 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-03 10:31:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-03-03 10:31:52,702 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 131 [2025-03-03 10:31:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:52,702 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-03-03 10:31:52,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-03-03 10:31:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 10:31:52,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:52,705 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, 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] [2025-03-03 10:31:52,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:31:52,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:52,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1870350207, now seen corresponding path program 1 times [2025-03-03 10:31:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869061610] [2025-03-03 10:31:52,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:52,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 10:31:52,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 10:31:52,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:52,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:52,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869061610] [2025-03-03 10:31:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869061610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:52,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43237537] [2025-03-03 10:31:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:52,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:52,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:52,898 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:53,476 INFO L93 Difference]: Finished difference Result 3257 states and 4123 transitions. [2025-03-03 10:31:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 188 [2025-03-03 10:31:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:53,483 INFO L225 Difference]: With dead ends: 3257 [2025-03-03 10:31:53,483 INFO L226 Difference]: Without dead ends: 1917 [2025-03-03 10:31:53,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:53,485 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 174 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:53,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:31:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-03-03 10:31:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-03-03 10:31:53,507 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-03 10:31:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2384 transitions. [2025-03-03 10:31:53,511 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2384 transitions. Word has length 188 [2025-03-03 10:31:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:53,511 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2384 transitions. [2025-03-03 10:31:53,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2384 transitions. [2025-03-03 10:31:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 10:31:53,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:53,514 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:53,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:31:53,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1135044460, now seen corresponding path program 1 times [2025-03-03 10:31:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693117679] [2025-03-03 10:31:53,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:53,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 10:31:53,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 10:31:53,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:53,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:31:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693117679] [2025-03-03 10:31:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693117679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743728849] [2025-03-03 10:31:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:53,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:53,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:53,779 INFO L87 Difference]: Start difference. First operand 1914 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:54,404 INFO L93 Difference]: Finished difference Result 4579 states and 5864 transitions. [2025-03-03 10:31:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 243 [2025-03-03 10:31:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:54,412 INFO L225 Difference]: With dead ends: 4579 [2025-03-03 10:31:54,412 INFO L226 Difference]: Without dead ends: 2851 [2025-03-03 10:31:54,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:54,415 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 182 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:54,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 157 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-03-03 10:31:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2481. [2025-03-03 10:31:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.2483870967741935) internal successors, (3096), 2480 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3096 transitions. [2025-03-03 10:31:54,451 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3096 transitions. Word has length 243 [2025-03-03 10:31:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:54,452 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3096 transitions. [2025-03-03 10:31:54,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3096 transitions. [2025-03-03 10:31:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-03 10:31:54,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:54,454 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:54,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:31:54,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:54,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash -970656445, now seen corresponding path program 1 times [2025-03-03 10:31:54,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114371151] [2025-03-03 10:31:54,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:54,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-03 10:31:54,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-03 10:31:54,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:54,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:31:54,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114371151] [2025-03-03 10:31:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114371151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:54,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:54,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:54,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128868725] [2025-03-03 10:31:54,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:54,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:54,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:54,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:54,640 INFO L87 Difference]: Start difference. First operand 2481 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:55,294 INFO L93 Difference]: Finished difference Result 5891 states and 7462 transitions. [2025-03-03 10:31:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:55,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 249 [2025-03-03 10:31:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:55,305 INFO L225 Difference]: With dead ends: 5891 [2025-03-03 10:31:55,305 INFO L226 Difference]: Without dead ends: 3596 [2025-03-03 10:31:55,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:55,309 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 135 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:55,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 389 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2025-03-03 10:31:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3585. [2025-03-03 10:31:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 3584 states have (on average 1.2151227678571428) internal successors, (4355), 3584 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4355 transitions. [2025-03-03 10:31:55,357 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4355 transitions. Word has length 249 [2025-03-03 10:31:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:55,357 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 4355 transitions. [2025-03-03 10:31:55,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4355 transitions. [2025-03-03 10:31:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 10:31:55,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:55,361 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:55,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:31:55,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:55,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1321405112, now seen corresponding path program 1 times [2025-03-03 10:31:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:55,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085628995] [2025-03-03 10:31:55,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:55,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:55,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 10:31:55,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 10:31:55,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:55,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 10:31:55,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:55,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085628995] [2025-03-03 10:31:55,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085628995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:55,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:55,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636605909] [2025-03-03 10:31:55,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:55,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:55,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:55,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:55,485 INFO L87 Difference]: Start difference. First operand 3585 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:56,146 INFO L93 Difference]: Finished difference Result 9193 states and 11382 transitions. [2025-03-03 10:31:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:56,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 274 [2025-03-03 10:31:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:56,163 INFO L225 Difference]: With dead ends: 9193 [2025-03-03 10:31:56,163 INFO L226 Difference]: Without dead ends: 5794 [2025-03-03 10:31:56,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:56,168 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 151 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:56,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 144 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2025-03-03 10:31:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 5794. [2025-03-03 10:31:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5794 states, 5793 states have (on average 1.2190574831693424) internal successors, (7062), 5793 states have internal predecessors, (7062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5794 states to 5794 states and 7062 transitions. [2025-03-03 10:31:56,254 INFO L78 Accepts]: Start accepts. Automaton has 5794 states and 7062 transitions. Word has length 274 [2025-03-03 10:31:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:56,254 INFO L471 AbstractCegarLoop]: Abstraction has 5794 states and 7062 transitions. [2025-03-03 10:31:56,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5794 states and 7062 transitions. [2025-03-03 10:31:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 10:31:56,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:56,259 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:56,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:31:56,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:56,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1912036605, now seen corresponding path program 1 times [2025-03-03 10:31:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386206173] [2025-03-03 10:31:56,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:56,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 10:31:56,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 10:31:56,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 117 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386206173] [2025-03-03 10:31:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386206173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539179378] [2025-03-03 10:31:56,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:56,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:56,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:31:56,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:31:56,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 10:31:56,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 10:31:56,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:56,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:56,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:31:56,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:56,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:31:56,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539179378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:56,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:31:56,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:31:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365180772] [2025-03-03 10:31:56,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:56,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:56,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:56,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:56,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:31:56,827 INFO L87 Difference]: Start difference. First operand 5794 states and 7062 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:57,456 INFO L93 Difference]: Finished difference Result 13265 states and 16391 transitions. [2025-03-03 10:31:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 290 [2025-03-03 10:31:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:57,473 INFO L225 Difference]: With dead ends: 13265 [2025-03-03 10:31:57,474 INFO L226 Difference]: Without dead ends: 7657 [2025-03-03 10:31:57,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:31:57,480 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 108 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:57,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 302 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7657 states. [2025-03-03 10:31:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7657 to 7451. [2025-03-03 10:31:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7451 states, 7450 states have (on average 1.2242953020134228) internal successors, (9121), 7450 states have internal predecessors, (9121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9121 transitions. [2025-03-03 10:31:57,556 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9121 transitions. Word has length 290 [2025-03-03 10:31:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 7451 states and 9121 transitions. [2025-03-03 10:31:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9121 transitions. [2025-03-03 10:31:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 10:31:57,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:57,561 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:57,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:31:57,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:57,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:57,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash -899815808, now seen corresponding path program 1 times [2025-03-03 10:31:57,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:57,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4661316] [2025-03-03 10:31:57,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:57,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 10:31:57,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 10:31:57,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:57,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:57,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:57,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4661316] [2025-03-03 10:31:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4661316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:57,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260012863] [2025-03-03 10:31:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:57,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:57,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:57,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:57,951 INFO L87 Difference]: Start difference. First operand 7451 states and 9121 transitions. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:59,010 INFO L93 Difference]: Finished difference Result 21750 states and 27058 transitions. [2025-03-03 10:31:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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-03 10:31:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:59,042 INFO L225 Difference]: With dead ends: 21750 [2025-03-03 10:31:59,042 INFO L226 Difference]: Without dead ends: 14485 [2025-03-03 10:31:59,050 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-03 10:31:59,050 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 247 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:59,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 98 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:31:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14485 states. [2025-03-03 10:31:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14485 to 14481. [2025-03-03 10:31:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14481 states, 14480 states have (on average 1.2234116022099448) internal successors, (17715), 14480 states have internal predecessors, (17715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14481 states to 14481 states and 17715 transitions. [2025-03-03 10:31:59,272 INFO L78 Accepts]: Start accepts. Automaton has 14481 states and 17715 transitions. Word has length 298 [2025-03-03 10:31:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:59,272 INFO L471 AbstractCegarLoop]: Abstraction has 14481 states and 17715 transitions. [2025-03-03 10:31:59,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 14481 states and 17715 transitions. [2025-03-03 10:31:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 10:31:59,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:59,282 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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-03 10:31:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:31:59,282 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1463782133, now seen corresponding path program 1 times [2025-03-03 10:31:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730757051] [2025-03-03 10:31:59,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:59,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 10:31:59,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 10:31:59,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:59,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 10:31:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730757051] [2025-03-03 10:31:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730757051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:59,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:59,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449363180] [2025-03-03 10:31:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:59,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:59,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:59,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:59,437 INFO L87 Difference]: Start difference. First operand 14481 states and 17715 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:00,044 INFO L93 Difference]: Finished difference Result 28800 states and 35288 transitions. [2025-03-03 10:32:00,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:00,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 339 [2025-03-03 10:32:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:00,133 INFO L225 Difference]: With dead ends: 28800 [2025-03-03 10:32:00,134 INFO L226 Difference]: Without dead ends: 14689 [2025-03-03 10:32:00,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:00,143 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 135 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:00,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 346 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14689 states. [2025-03-03 10:32:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14689 to 14481. [2025-03-03 10:32:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14481 states, 14480 states have (on average 1.2035220994475138) internal successors, (17427), 14480 states have internal predecessors, (17427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14481 states to 14481 states and 17427 transitions. [2025-03-03 10:32:00,278 INFO L78 Accepts]: Start accepts. Automaton has 14481 states and 17427 transitions. Word has length 339 [2025-03-03 10:32:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:00,278 INFO L471 AbstractCegarLoop]: Abstraction has 14481 states and 17427 transitions. [2025-03-03 10:32:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14481 states and 17427 transitions. [2025-03-03 10:32:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 10:32:00,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:00,287 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, 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, 2, 2, 2, 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-03 10:32:00,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:32:00,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:00,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1728058213, now seen corresponding path program 1 times [2025-03-03 10:32:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:00,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383792332] [2025-03-03 10:32:00,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:00,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 10:32:00,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 10:32:00,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:00,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:32:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383792332] [2025-03-03 10:32:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383792332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:00,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:00,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173898237] [2025-03-03 10:32:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:00,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:00,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:00,402 INFO L87 Difference]: Start difference. First operand 14481 states and 17427 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:00,986 INFO L93 Difference]: Finished difference Result 26893 states and 32412 transitions. [2025-03-03 10:32:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 340 [2025-03-03 10:32:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:01,007 INFO L225 Difference]: With dead ends: 26893 [2025-03-03 10:32:01,007 INFO L226 Difference]: Without dead ends: 12782 [2025-03-03 10:32:01,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:01,017 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 144 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 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-03 10:32:01,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 149 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2025-03-03 10:32:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 11486. [2025-03-03 10:32:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11486 states, 11485 states have (on average 1.151501959077057) internal successors, (13225), 11485 states have internal predecessors, (13225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11486 states to 11486 states and 13225 transitions. [2025-03-03 10:32:01,166 INFO L78 Accepts]: Start accepts. Automaton has 11486 states and 13225 transitions. Word has length 340 [2025-03-03 10:32:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:01,167 INFO L471 AbstractCegarLoop]: Abstraction has 11486 states and 13225 transitions. [2025-03-03 10:32:01,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 11486 states and 13225 transitions. [2025-03-03 10:32:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-03 10:32:01,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:01,182 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, 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, 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] [2025-03-03 10:32:01,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:32:01,183 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 794062843, now seen corresponding path program 1 times [2025-03-03 10:32:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114886815] [2025-03-03 10:32:01,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:01,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-03 10:32:01,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-03 10:32:01,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:01,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-03 10:32:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114886815] [2025-03-03 10:32:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114886815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:01,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278565189] [2025-03-03 10:32:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:01,420 INFO L87 Difference]: Start difference. First operand 11486 states and 13225 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:01,983 INFO L93 Difference]: Finished difference Result 22975 states and 26510 transitions. [2025-03-03 10:32:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 388 [2025-03-03 10:32:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:02,001 INFO L225 Difference]: With dead ends: 22975 [2025-03-03 10:32:02,001 INFO L226 Difference]: Without dead ends: 13151 [2025-03-03 10:32:02,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:02,011 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 102 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:02,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 362 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-03-03 10:32:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 12963. [2025-03-03 10:32:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12963 states, 12962 states have (on average 1.1463508717790465) internal successors, (14859), 12962 states have internal predecessors, (14859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12963 states to 12963 states and 14859 transitions. [2025-03-03 10:32:02,159 INFO L78 Accepts]: Start accepts. Automaton has 12963 states and 14859 transitions. Word has length 388 [2025-03-03 10:32:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:02,159 INFO L471 AbstractCegarLoop]: Abstraction has 12963 states and 14859 transitions. [2025-03-03 10:32:02,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12963 states and 14859 transitions. [2025-03-03 10:32:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-03 10:32:02,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:02,170 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, 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, 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] [2025-03-03 10:32:02,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:32:02,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash 246650063, now seen corresponding path program 1 times [2025-03-03 10:32:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424876938] [2025-03-03 10:32:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:02,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-03 10:32:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-03 10:32:02,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:02,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 10:32:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424876938] [2025-03-03 10:32:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424876938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:02,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906558378] [2025-03-03 10:32:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:02,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:02,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:02,369 INFO L87 Difference]: Start difference. First operand 12963 states and 14859 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 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-03 10:32:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:02,960 INFO L93 Difference]: Finished difference Result 28133 states and 32408 transitions. [2025-03-03 10:32:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:02,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 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 401 [2025-03-03 10:32:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:02,977 INFO L225 Difference]: With dead ends: 28133 [2025-03-03 10:32:02,977 INFO L226 Difference]: Without dead ends: 15540 [2025-03-03 10:32:02,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:02,987 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:02,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 77 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15540 states. [2025-03-03 10:32:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15540 to 14799. [2025-03-03 10:32:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14799 states, 14798 states have (on average 1.1483984322205703) internal successors, (16994), 14798 states have internal predecessors, (16994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14799 states to 14799 states and 16994 transitions. [2025-03-03 10:32:03,179 INFO L78 Accepts]: Start accepts. Automaton has 14799 states and 16994 transitions. Word has length 401 [2025-03-03 10:32:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 14799 states and 16994 transitions. [2025-03-03 10:32:03,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 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-03 10:32:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 14799 states and 16994 transitions. [2025-03-03 10:32:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-03 10:32:03,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:03,188 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, 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, 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] [2025-03-03 10:32:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:32:03,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:03,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash 534602392, now seen corresponding path program 1 times [2025-03-03 10:32:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540812165] [2025-03-03 10:32:03,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:03,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-03 10:32:03,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-03 10:32:03,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:03,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:03,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540812165] [2025-03-03 10:32:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540812165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:03,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:03,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522337071] [2025-03-03 10:32:03,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:03,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:03,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:03,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:03,567 INFO L87 Difference]: Start difference. First operand 14799 states and 16994 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:04,314 INFO L93 Difference]: Finished difference Result 32390 states and 37197 transitions. [2025-03-03 10:32:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:04,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 402 [2025-03-03 10:32:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:04,333 INFO L225 Difference]: With dead ends: 32390 [2025-03-03 10:32:04,333 INFO L226 Difference]: Without dead ends: 19253 [2025-03-03 10:32:04,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:04,343 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 208 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:04,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 155 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:32:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19253 states. [2025-03-03 10:32:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19253 to 17589. [2025-03-03 10:32:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17589 states, 17588 states have (on average 1.1447009324539459) internal successors, (20133), 17588 states have internal predecessors, (20133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17589 states to 17589 states and 20133 transitions. [2025-03-03 10:32:04,504 INFO L78 Accepts]: Start accepts. Automaton has 17589 states and 20133 transitions. Word has length 402 [2025-03-03 10:32:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:04,505 INFO L471 AbstractCegarLoop]: Abstraction has 17589 states and 20133 transitions. [2025-03-03 10:32:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17589 states and 20133 transitions. [2025-03-03 10:32:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-03 10:32:04,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:04,514 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, 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, 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] [2025-03-03 10:32:04,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:32:04,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:04,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1193096511, now seen corresponding path program 1 times [2025-03-03 10:32:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714988398] [2025-03-03 10:32:04,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:04,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-03 10:32:04,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-03 10:32:04,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:04,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 176 proven. 203 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-03 10:32:04,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714988398] [2025-03-03 10:32:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714988398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718776805] [2025-03-03 10:32:04,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:04,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:04,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:32:04,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-03 10:32:05,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-03 10:32:05,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:05,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:32:05,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 10:32:05,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:05,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718776805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:05,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:05,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:32:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866179746] [2025-03-03 10:32:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:05,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:05,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:05,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:05,371 INFO L87 Difference]: Start difference. First operand 17589 states and 20133 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:06,458 INFO L93 Difference]: Finished difference Result 41447 states and 47684 transitions. [2025-03-03 10:32:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 412 [2025-03-03 10:32:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:06,485 INFO L225 Difference]: With dead ends: 41447 [2025-03-03 10:32:06,485 INFO L226 Difference]: Without dead ends: 24228 [2025-03-03 10:32:06,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:06,499 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 191 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:06,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 117 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:32:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24228 states. [2025-03-03 10:32:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24228 to 24216. [2025-03-03 10:32:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24216 states, 24215 states have (on average 1.134668593846789) internal successors, (27476), 24215 states have internal predecessors, (27476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24216 states to 24216 states and 27476 transitions. [2025-03-03 10:32:06,721 INFO L78 Accepts]: Start accepts. Automaton has 24216 states and 27476 transitions. Word has length 412 [2025-03-03 10:32:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:06,721 INFO L471 AbstractCegarLoop]: Abstraction has 24216 states and 27476 transitions. [2025-03-03 10:32:06,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 24216 states and 27476 transitions. [2025-03-03 10:32:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-03 10:32:06,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:06,737 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:06,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:32:06,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:32:06,937 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:06,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1635015383, now seen corresponding path program 1 times [2025-03-03 10:32:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786953373] [2025-03-03 10:32:06,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:07,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-03 10:32:07,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-03 10:32:07,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:07,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-03 10:32:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786953373] [2025-03-03 10:32:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786953373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:07,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903564912] [2025-03-03 10:32:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:07,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:07,145 INFO L87 Difference]: Start difference. First operand 24216 states and 27476 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:07,721 INFO L93 Difference]: Finished difference Result 48609 states and 55200 transitions. [2025-03-03 10:32:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:07,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 500 [2025-03-03 10:32:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:07,744 INFO L225 Difference]: With dead ends: 48609 [2025-03-03 10:32:07,745 INFO L226 Difference]: Without dead ends: 24211 [2025-03-03 10:32:07,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:07,761 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 196 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:07,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 360 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24211 states. [2025-03-03 10:32:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24211 to 23467. [2025-03-03 10:32:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23467 states, 23466 states have (on average 1.1130998039717037) internal successors, (26120), 23466 states have internal predecessors, (26120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23467 states to 23467 states and 26120 transitions. [2025-03-03 10:32:07,967 INFO L78 Accepts]: Start accepts. Automaton has 23467 states and 26120 transitions. Word has length 500 [2025-03-03 10:32:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:07,967 INFO L471 AbstractCegarLoop]: Abstraction has 23467 states and 26120 transitions. [2025-03-03 10:32:07,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 23467 states and 26120 transitions. [2025-03-03 10:32:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 10:32:07,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:07,980 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:07,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:32:07,980 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:07,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash 757525604, now seen corresponding path program 1 times [2025-03-03 10:32:07,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:07,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128126746] [2025-03-03 10:32:07,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:08,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 10:32:08,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 10:32:08,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:08,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 447 proven. 85 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:32:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128126746] [2025-03-03 10:32:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128126746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:08,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015077291] [2025-03-03 10:32:08,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:08,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:08,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:32:08,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 10:32:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 10:32:08,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:08,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:08,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:32:08,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:32:08,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015077291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:32:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128384660] [2025-03-03 10:32:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:08,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:08,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:08,805 INFO L87 Difference]: Start difference. First operand 23467 states and 26120 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:09,276 INFO L93 Difference]: Finished difference Result 46198 states and 51438 transitions. [2025-03-03 10:32:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 507 [2025-03-03 10:32:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:09,299 INFO L225 Difference]: With dead ends: 46198 [2025-03-03 10:32:09,300 INFO L226 Difference]: Without dead ends: 24577 [2025-03-03 10:32:09,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:32:09,313 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:09,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 162 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24577 states. [2025-03-03 10:32:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24577 to 24019. [2025-03-03 10:32:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24019 states, 24018 states have (on average 1.1088766758264634) internal successors, (26633), 24018 states have internal predecessors, (26633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24019 states to 24019 states and 26633 transitions. [2025-03-03 10:32:09,579 INFO L78 Accepts]: Start accepts. Automaton has 24019 states and 26633 transitions. Word has length 507 [2025-03-03 10:32:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:09,579 INFO L471 AbstractCegarLoop]: Abstraction has 24019 states and 26633 transitions. [2025-03-03 10:32:09,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 24019 states and 26633 transitions. [2025-03-03 10:32:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-03 10:32:09,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:09,592 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:09,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:32:09,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:09,792 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:09,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -543747851, now seen corresponding path program 1 times [2025-03-03 10:32:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:09,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253815571] [2025-03-03 10:32:09,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:09,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-03 10:32:09,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-03 10:32:09,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:09,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 508 proven. 24 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:32:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253815571] [2025-03-03 10:32:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253815571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873940832] [2025-03-03 10:32:10,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:10,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:10,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:10,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:10,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:32:10,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-03 10:32:10,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-03 10:32:10,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:10,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:10,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:32:10,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:32:10,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:10,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873940832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:10,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-03 10:32:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597503454] [2025-03-03 10:32:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:10,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:10,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:32:10,525 INFO L87 Difference]: Start difference. First operand 24019 states and 26633 transitions. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:11,309 INFO L93 Difference]: Finished difference Result 50426 states and 55779 transitions. [2025-03-03 10:32:11,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:11,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 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 508 [2025-03-03 10:32:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:11,331 INFO L225 Difference]: With dead ends: 50426 [2025-03-03 10:32:11,331 INFO L226 Difference]: Without dead ends: 26593 [2025-03-03 10:32:11,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:32:11,346 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 276 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:11,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 160 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:32:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26593 states. [2025-03-03 10:32:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26593 to 23641. [2025-03-03 10:32:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23641 states, 23640 states have (on average 1.1033840947546532) internal successors, (26084), 23640 states have internal predecessors, (26084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23641 states to 23641 states and 26084 transitions. [2025-03-03 10:32:11,634 INFO L78 Accepts]: Start accepts. Automaton has 23641 states and 26084 transitions. Word has length 508 [2025-03-03 10:32:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:11,634 INFO L471 AbstractCegarLoop]: Abstraction has 23641 states and 26084 transitions. [2025-03-03 10:32:11,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 23641 states and 26084 transitions. [2025-03-03 10:32:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-03 10:32:11,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:11,653 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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] [2025-03-03 10:32:11,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:32:11,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:32:11,854 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:11,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1306608176, now seen corresponding path program 1 times [2025-03-03 10:32:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267253154] [2025-03-03 10:32:11,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:11,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 10:32:11,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 10:32:11,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:11,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 572 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:13,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:13,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267253154] [2025-03-03 10:32:13,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267253154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994533980] [2025-03-03 10:32:13,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:13,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:13,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:13,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:13,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:32:13,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 10:32:13,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 10:32:13,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:13,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:13,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:32:13,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-03 10:32:13,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994533980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:13,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:13,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-03 10:32:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867837787] [2025-03-03 10:32:13,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:13,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:13,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:13,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:32:13,589 INFO L87 Difference]: Start difference. First operand 23641 states and 26084 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:14,138 INFO L93 Difference]: Finished difference Result 49871 states and 55017 transitions. [2025-03-03 10:32:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:14,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 535 [2025-03-03 10:32:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:14,166 INFO L225 Difference]: With dead ends: 49871 [2025-03-03 10:32:14,166 INFO L226 Difference]: Without dead ends: 26600 [2025-03-03 10:32:14,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:32:14,181 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 91 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:14,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 342 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26600 states. [2025-03-03 10:32:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26600 to 24743. [2025-03-03 10:32:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24743 states, 24742 states have (on average 1.1020936060140651) internal successors, (27268), 24742 states have internal predecessors, (27268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 27268 transitions. [2025-03-03 10:32:14,399 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 27268 transitions. Word has length 535 [2025-03-03 10:32:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:14,399 INFO L471 AbstractCegarLoop]: Abstraction has 24743 states and 27268 transitions. [2025-03-03 10:32:14,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 27268 transitions. [2025-03-03 10:32:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 10:32:14,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:14,412 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:14,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:32:14,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:14,617 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:14,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1202968318, now seen corresponding path program 1 times [2025-03-03 10:32:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083507215] [2025-03-03 10:32:14,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:14,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 10:32:14,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 10:32:14,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:14,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-03 10:32:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083507215] [2025-03-03 10:32:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083507215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:14,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670420902] [2025-03-03 10:32:14,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:14,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:14,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:14,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:14,824 INFO L87 Difference]: Start difference. First operand 24743 states and 27268 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:15,661 INFO L93 Difference]: Finished difference Result 52256 states and 57642 transitions. [2025-03-03 10:32:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 540 [2025-03-03 10:32:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:15,693 INFO L225 Difference]: With dead ends: 52256 [2025-03-03 10:32:15,693 INFO L226 Difference]: Without dead ends: 29543 [2025-03-03 10:32:15,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:15,708 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 325 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:15,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 332 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:32:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29543 states. [2025-03-03 10:32:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29543 to 24368. [2025-03-03 10:32:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24368 states, 24367 states have (on average 1.1009972503796117) internal successors, (26828), 24367 states have internal predecessors, (26828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24368 states to 24368 states and 26828 transitions. [2025-03-03 10:32:15,917 INFO L78 Accepts]: Start accepts. Automaton has 24368 states and 26828 transitions. Word has length 540 [2025-03-03 10:32:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:15,917 INFO L471 AbstractCegarLoop]: Abstraction has 24368 states and 26828 transitions. [2025-03-03 10:32:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24368 states and 26828 transitions. [2025-03-03 10:32:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-03 10:32:15,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:15,932 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, 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, 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, 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] [2025-03-03 10:32:15,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:32:15,932 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:15,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash -664150411, now seen corresponding path program 1 times [2025-03-03 10:32:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870944345] [2025-03-03 10:32:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:15,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-03 10:32:15,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-03 10:32:15,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:15,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-03 10:32:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870944345] [2025-03-03 10:32:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870944345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983378397] [2025-03-03 10:32:16,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:16,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:16,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:16,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:16,161 INFO L87 Difference]: Start difference. First operand 24368 states and 26828 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:16,457 INFO L93 Difference]: Finished difference Result 46147 states and 50858 transitions. [2025-03-03 10:32:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:16,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 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 631 [2025-03-03 10:32:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:16,478 INFO L225 Difference]: With dead ends: 46147 [2025-03-03 10:32:16,479 INFO L226 Difference]: Without dead ends: 23993 [2025-03-03 10:32:16,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:16,492 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:16,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 34 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 10:32:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2025-03-03 10:32:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 23990. [2025-03-03 10:32:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23990 states, 23989 states have (on average 1.1003793405310767) internal successors, (26397), 23989 states have internal predecessors, (26397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23990 states to 23990 states and 26397 transitions. [2025-03-03 10:32:16,685 INFO L78 Accepts]: Start accepts. Automaton has 23990 states and 26397 transitions. Word has length 631 [2025-03-03 10:32:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:16,685 INFO L471 AbstractCegarLoop]: Abstraction has 23990 states and 26397 transitions. [2025-03-03 10:32:16,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23990 states and 26397 transitions. [2025-03-03 10:32:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-03 10:32:16,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:16,740 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, 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, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:16,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:32:16,740 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:16,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 130100083, now seen corresponding path program 1 times [2025-03-03 10:32:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:16,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365317135] [2025-03-03 10:32:16,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:16,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 10:32:16,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 10:32:16,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:16,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 914 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-03 10:32:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365317135] [2025-03-03 10:32:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365317135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:17,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:17,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562040340] [2025-03-03 10:32:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:17,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:17,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:17,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:17,228 INFO L87 Difference]: Start difference. First operand 23990 states and 26397 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:17,788 INFO L93 Difference]: Finished difference Result 51662 states and 56912 transitions. [2025-03-03 10:32:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 651 [2025-03-03 10:32:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:17,816 INFO L225 Difference]: With dead ends: 51662 [2025-03-03 10:32:17,816 INFO L226 Difference]: Without dead ends: 28042 [2025-03-03 10:32:17,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:17,831 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:17,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 72 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28042 states. [2025-03-03 10:32:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28042 to 24910. [2025-03-03 10:32:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24910 states, 24909 states have (on average 1.0977156850937413) internal successors, (27343), 24909 states have internal predecessors, (27343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24910 states to 24910 states and 27343 transitions. [2025-03-03 10:32:18,048 INFO L78 Accepts]: Start accepts. Automaton has 24910 states and 27343 transitions. Word has length 651 [2025-03-03 10:32:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:18,048 INFO L471 AbstractCegarLoop]: Abstraction has 24910 states and 27343 transitions. [2025-03-03 10:32:18,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 24910 states and 27343 transitions. [2025-03-03 10:32:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-03-03 10:32:18,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:18,063 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, 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:32:18,063 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:18,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 462724436, now seen corresponding path program 1 times [2025-03-03 10:32:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:18,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883235323] [2025-03-03 10:32:18,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:18,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-03-03 10:32:18,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-03-03 10:32:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 698 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-03-03 10:32:18,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:18,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883235323] [2025-03-03 10:32:18,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883235323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:18,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:18,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473066778] [2025-03-03 10:32:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:18,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:18,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:18,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:18,241 INFO L87 Difference]: Start difference. First operand 24910 states and 27343 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:18,705 INFO L93 Difference]: Finished difference Result 47788 states and 52498 transitions. [2025-03-03 10:32:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:18,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 652 [2025-03-03 10:32:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:18,728 INFO L225 Difference]: With dead ends: 47788 [2025-03-03 10:32:18,729 INFO L226 Difference]: Without dead ends: 25460 [2025-03-03 10:32:18,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:18,742 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 87 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:18,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 336 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25460 states. [2025-03-03 10:32:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25460 to 23802. [2025-03-03 10:32:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23802 states, 23801 states have (on average 1.0967606403092307) internal successors, (26104), 23801 states have internal predecessors, (26104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23802 states to 23802 states and 26104 transitions. [2025-03-03 10:32:18,990 INFO L78 Accepts]: Start accepts. Automaton has 23802 states and 26104 transitions. Word has length 652 [2025-03-03 10:32:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:18,990 INFO L471 AbstractCegarLoop]: Abstraction has 23802 states and 26104 transitions. [2025-03-03 10:32:18,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 23802 states and 26104 transitions. [2025-03-03 10:32:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2025-03-03 10:32:19,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:19,005 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-03 10:32:19,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:32:19,005 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1404816795, now seen corresponding path program 1 times [2025-03-03 10:32:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95041604] [2025-03-03 10:32:19,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:19,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes. [2025-03-03 10:32:19,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-03-03 10:32:19,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:19,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 1284 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2025-03-03 10:32:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95041604] [2025-03-03 10:32:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95041604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:19,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512327752] [2025-03-03 10:32:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:19,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:19,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:19,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:19,254 INFO L87 Difference]: Start difference. First operand 23802 states and 26104 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:19,702 INFO L93 Difference]: Finished difference Result 46697 states and 51229 transitions. [2025-03-03 10:32:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:19,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 708 [2025-03-03 10:32:19,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:19,726 INFO L225 Difference]: With dead ends: 46697 [2025-03-03 10:32:19,726 INFO L226 Difference]: Without dead ends: 25293 [2025-03-03 10:32:19,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:19,738 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 100 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:19,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 154 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25293 states. [2025-03-03 10:32:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25293 to 25090. [2025-03-03 10:32:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25090 states, 25089 states have (on average 1.08832556100283) internal successors, (27305), 25089 states have internal predecessors, (27305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25090 states to 25090 states and 27305 transitions. [2025-03-03 10:32:19,942 INFO L78 Accepts]: Start accepts. Automaton has 25090 states and 27305 transitions. Word has length 708 [2025-03-03 10:32:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:19,942 INFO L471 AbstractCegarLoop]: Abstraction has 25090 states and 27305 transitions. [2025-03-03 10:32:19,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25090 states and 27305 transitions. [2025-03-03 10:32:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-03 10:32:19,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:19,959 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-03 10:32:19,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:32:19,959 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:19,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash -14567180, now seen corresponding path program 1 times [2025-03-03 10:32:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:19,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700228199] [2025-03-03 10:32:19,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:19,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 10:32:20,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 10:32:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 1236 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-03 10:32:20,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:20,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700228199] [2025-03-03 10:32:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700228199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:20,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:20,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408520229] [2025-03-03 10:32:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:20,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:20,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:20,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:20,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:20,368 INFO L87 Difference]: Start difference. First operand 25090 states and 27305 transitions. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:21,124 INFO L93 Difference]: Finished difference Result 52211 states and 56835 transitions. [2025-03-03 10:32:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:21,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 709 [2025-03-03 10:32:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:21,151 INFO L225 Difference]: With dead ends: 52211 [2025-03-03 10:32:21,151 INFO L226 Difference]: Without dead ends: 28967 [2025-03-03 10:32:21,164 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-03 10:32:21,164 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 189 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:21,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 78 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28967 states. [2025-03-03 10:32:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28967 to 23618. [2025-03-03 10:32:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23618 states, 23617 states have (on average 1.0877757547529323) internal successors, (25690), 23617 states have internal predecessors, (25690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23618 states to 23618 states and 25690 transitions. [2025-03-03 10:32:21,374 INFO L78 Accepts]: Start accepts. Automaton has 23618 states and 25690 transitions. Word has length 709 [2025-03-03 10:32:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:21,375 INFO L471 AbstractCegarLoop]: Abstraction has 23618 states and 25690 transitions. [2025-03-03 10:32:21,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23618 states and 25690 transitions. [2025-03-03 10:32:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-03-03 10:32:21,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:21,389 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-03 10:32:21,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 10:32:21,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:21,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:21,390 INFO L85 PathProgramCache]: Analyzing trace with hash -456387137, now seen corresponding path program 1 times [2025-03-03 10:32:21,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:21,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001902689] [2025-03-03 10:32:21,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:21,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-03-03 10:32:21,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-03-03 10:32:21,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:21,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 1095 proven. 0 refuted. 0 times theorem prover too weak. 1233 trivial. 0 not checked. [2025-03-03 10:32:21,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001902689] [2025-03-03 10:32:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001902689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:21,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255493758] [2025-03-03 10:32:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:21,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:21,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:21,847 INFO L87 Difference]: Start difference. First operand 23618 states and 25690 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:22,643 INFO L93 Difference]: Finished difference Result 46318 states and 50486 transitions. [2025-03-03 10:32:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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 794 [2025-03-03 10:32:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:22,670 INFO L225 Difference]: With dead ends: 46318 [2025-03-03 10:32:22,670 INFO L226 Difference]: Without dead ends: 25650 [2025-03-03 10:32:22,684 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-03 10:32:22,684 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 244 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:22,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 100 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:32:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states. [2025-03-03 10:32:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 23806. [2025-03-03 10:32:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23806 states, 23805 states have (on average 1.0872085696282294) internal successors, (25881), 23805 states have internal predecessors, (25881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 25881 transitions. [2025-03-03 10:32:22,901 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 25881 transitions. Word has length 794 [2025-03-03 10:32:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:22,901 INFO L471 AbstractCegarLoop]: Abstraction has 23806 states and 25881 transitions. [2025-03-03 10:32:22,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 25881 transitions. [2025-03-03 10:32:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2025-03-03 10:32:22,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:22,917 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-03 10:32:22,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 10:32:22,917 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:22,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1301005582, now seen corresponding path program 1 times [2025-03-03 10:32:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439268567] [2025-03-03 10:32:22,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:22,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 860 statements into 1 equivalence classes. [2025-03-03 10:32:22,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 860 of 860 statements. [2025-03-03 10:32:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:22,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1886 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-03 10:32:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439268567] [2025-03-03 10:32:23,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439268567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814684156] [2025-03-03 10:32:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:23,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:23,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:23,489 INFO L87 Difference]: Start difference. First operand 23806 states and 25881 transitions. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:24,310 INFO L93 Difference]: Finished difference Result 54989 states and 59805 transitions. [2025-03-03 10:32:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 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 860 [2025-03-03 10:32:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:24,342 INFO L225 Difference]: With dead ends: 54989 [2025-03-03 10:32:24,342 INFO L226 Difference]: Without dead ends: 33581 [2025-03-03 10:32:24,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:24,352 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 226 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:24,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 87 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:32:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33581 states. [2025-03-03 10:32:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33581 to 23991. [2025-03-03 10:32:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23991 states, 23990 states have (on average 1.0866194247603167) internal successors, (26068), 23990 states have internal predecessors, (26068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23991 states to 23991 states and 26068 transitions. [2025-03-03 10:32:24,688 INFO L78 Accepts]: Start accepts. Automaton has 23991 states and 26068 transitions. Word has length 860 [2025-03-03 10:32:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:24,688 INFO L471 AbstractCegarLoop]: Abstraction has 23991 states and 26068 transitions. [2025-03-03 10:32:24,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23991 states and 26068 transitions. [2025-03-03 10:32:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2025-03-03 10:32:24,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:24,717 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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-03 10:32:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 10:32:24,717 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2119816687, now seen corresponding path program 1 times [2025-03-03 10:32:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760855337] [2025-03-03 10:32:24,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:24,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes. [2025-03-03 10:32:24,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements. [2025-03-03 10:32:24,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:24,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 2290 proven. 830 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2025-03-03 10:32:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760855337] [2025-03-03 10:32:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760855337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3498122] [2025-03-03 10:32:26,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:26,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:26,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:26,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:26,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:32:26,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes. [2025-03-03 10:32:26,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements. [2025-03-03 10:32:26,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:26,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:26,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:32:26,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 2335 proven. 0 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2025-03-03 10:32:26,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3498122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:32:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449125387] [2025-03-03 10:32:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:26,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:26,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:26,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:32:26,616 INFO L87 Difference]: Start difference. First operand 23991 states and 26068 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:27,041 INFO L93 Difference]: Finished difference Result 48176 states and 52373 transitions. [2025-03-03 10:32:27,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:27,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 1067 [2025-03-03 10:32:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:27,062 INFO L225 Difference]: With dead ends: 48176 [2025-03-03 10:32:27,062 INFO L226 Difference]: Without dead ends: 24555 [2025-03-03 10:32:27,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 1068 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:32:27,075 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 104 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:27,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 326 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:32:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24555 states. [2025-03-03 10:32:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24555 to 24547. [2025-03-03 10:32:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24547 states, 24546 states have (on average 1.0855943941986474) internal successors, (26647), 24546 states have internal predecessors, (26647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24547 states to 24547 states and 26647 transitions. [2025-03-03 10:32:27,267 INFO L78 Accepts]: Start accepts. Automaton has 24547 states and 26647 transitions. Word has length 1067 [2025-03-03 10:32:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:27,268 INFO L471 AbstractCegarLoop]: Abstraction has 24547 states and 26647 transitions. [2025-03-03 10:32:27,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 24547 states and 26647 transitions. [2025-03-03 10:32:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1133 [2025-03-03 10:32:27,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:27,286 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 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-03 10:32:27,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:32:27,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 10:32:27,486 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:27,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2068351367, now seen corresponding path program 1 times [2025-03-03 10:32:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095028914] [2025-03-03 10:32:27,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:27,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1132 statements into 1 equivalence classes. [2025-03-03 10:32:27,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1132 of 1132 statements. [2025-03-03 10:32:27,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:27,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4049 backedges. 2161 proven. 0 refuted. 0 times theorem prover too weak. 1888 trivial. 0 not checked. [2025-03-03 10:32:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:27,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095028914] [2025-03-03 10:32:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095028914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:27,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:27,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:27,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569690893] [2025-03-03 10:32:27,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:27,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:27,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:27,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:27,847 INFO L87 Difference]: Start difference. First operand 24547 states and 26647 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:28,115 INFO L93 Difference]: Finished difference Result 48350 states and 52505 transitions. [2025-03-03 10:32:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 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 1132 [2025-03-03 10:32:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:28,136 INFO L225 Difference]: With dead ends: 48350 [2025-03-03 10:32:28,136 INFO L226 Difference]: Without dead ends: 24173 [2025-03-03 10:32:28,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:28,150 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:28,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 34 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 10:32:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24173 states. [2025-03-03 10:32:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24173 to 24173. [2025-03-03 10:32:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24173 states, 24172 states have (on average 1.085346682111534) internal successors, (26235), 24172 states have internal predecessors, (26235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24173 states to 24173 states and 26235 transitions. [2025-03-03 10:32:28,336 INFO L78 Accepts]: Start accepts. Automaton has 24173 states and 26235 transitions. Word has length 1132 [2025-03-03 10:32:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:28,336 INFO L471 AbstractCegarLoop]: Abstraction has 24173 states and 26235 transitions. [2025-03-03 10:32:28,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 24173 states and 26235 transitions. [2025-03-03 10:32:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2025-03-03 10:32:28,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:28,353 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:28,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 10:32:28,354 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:28,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash -834053972, now seen corresponding path program 1 times [2025-03-03 10:32:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360060865] [2025-03-03 10:32:28,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:28,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1156 statements into 1 equivalence classes. [2025-03-03 10:32:28,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1156 of 1156 statements. [2025-03-03 10:32:28,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:28,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4066 backedges. 1501 proven. 0 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2025-03-03 10:32:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360060865] [2025-03-03 10:32:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360060865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110459731] [2025-03-03 10:32:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:29,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:29,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:29,505 INFO L87 Difference]: Start difference. First operand 24173 states and 26235 transitions. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:30,201 INFO L93 Difference]: Finished difference Result 48897 states and 53075 transitions. [2025-03-03 10:32:30,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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 1156 [2025-03-03 10:32:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:30,223 INFO L225 Difference]: With dead ends: 48897 [2025-03-03 10:32:30,223 INFO L226 Difference]: Without dead ends: 24910 [2025-03-03 10:32:30,237 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-03 10:32:30,237 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 206 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:30,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 84 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24910 states. [2025-03-03 10:32:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24910 to 24909. [2025-03-03 10:32:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24909 states, 24908 states have (on average 1.0837080456078367) internal successors, (26993), 24908 states have internal predecessors, (26993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24909 states to 24909 states and 26993 transitions. [2025-03-03 10:32:30,447 INFO L78 Accepts]: Start accepts. Automaton has 24909 states and 26993 transitions. Word has length 1156 [2025-03-03 10:32:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:30,447 INFO L471 AbstractCegarLoop]: Abstraction has 24909 states and 26993 transitions. [2025-03-03 10:32:30,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 24909 states and 26993 transitions. [2025-03-03 10:32:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1195 [2025-03-03 10:32:30,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:30,466 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:32:30,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 10:32:30,466 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:30,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1431198814, now seen corresponding path program 1 times [2025-03-03 10:32:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128346881] [2025-03-03 10:32:30,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:30,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1194 statements into 1 equivalence classes. [2025-03-03 10:32:30,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1194 of 1194 statements. [2025-03-03 10:32:30,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:30,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4127 backedges. 2240 proven. 73 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2025-03-03 10:32:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128346881] [2025-03-03 10:32:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128346881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339886564] [2025-03-03 10:32:31,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:31,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:31,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:31,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:31,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:32:31,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1194 statements into 1 equivalence classes. [2025-03-03 10:32:31,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1194 of 1194 statements. [2025-03-03 10:32:31,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:31,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:31,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:32:31,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4127 backedges. 2598 proven. 0 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2025-03-03 10:32:32,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339886564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:32:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419768970] [2025-03-03 10:32:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:32,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:32,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:32,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:32,102 INFO L87 Difference]: Start difference. First operand 24909 states and 26993 transitions. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:32,642 INFO L93 Difference]: Finished difference Result 55899 states and 60591 transitions. [2025-03-03 10:32:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 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 1194 [2025-03-03 10:32:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:32,669 INFO L225 Difference]: With dead ends: 55899 [2025-03-03 10:32:32,669 INFO L226 Difference]: Without dead ends: 31360 [2025-03-03 10:32:32,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:32,684 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 77 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:32,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 315 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31360 states. [2025-03-03 10:32:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31360 to 19765. [2025-03-03 10:32:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19765 states, 19764 states have (on average 1.0829791540174054) internal successors, (21404), 19764 states have internal predecessors, (21404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19765 states to 19765 states and 21404 transitions. [2025-03-03 10:32:32,920 INFO L78 Accepts]: Start accepts. Automaton has 19765 states and 21404 transitions. Word has length 1194 [2025-03-03 10:32:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:32,920 INFO L471 AbstractCegarLoop]: Abstraction has 19765 states and 21404 transitions. [2025-03-03 10:32:32,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 19765 states and 21404 transitions. [2025-03-03 10:32:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2025-03-03 10:32:32,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:32,937 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:32,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:32:33,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:33,138 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:33,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1894305421, now seen corresponding path program 1 times [2025-03-03 10:32:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064990959] [2025-03-03 10:32:33,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:33,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:33,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-03-03 10:32:33,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-03-03 10:32:33,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:33,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6001 backedges. 3683 proven. 811 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2025-03-03 10:32:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064990959] [2025-03-03 10:32:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064990959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284341565] [2025-03-03 10:32:35,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:35,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:35,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:35,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:32:35,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-03-03 10:32:35,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-03-03 10:32:35,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:35,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:35,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:32:35,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6001 backedges. 3704 proven. 0 refuted. 0 times theorem prover too weak. 2297 trivial. 0 not checked. [2025-03-03 10:32:36,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284341565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:36,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:32:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357880180] [2025-03-03 10:32:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:36,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:36,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:36,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:36,120 INFO L87 Difference]: Start difference. First operand 19765 states and 21404 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:36,575 INFO L93 Difference]: Finished difference Result 39902 states and 43206 transitions. [2025-03-03 10:32:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 1355 [2025-03-03 10:32:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:36,591 INFO L225 Difference]: With dead ends: 39902 [2025-03-03 10:32:36,592 INFO L226 Difference]: Without dead ends: 20139 [2025-03-03 10:32:36,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1362 GetRequests, 1357 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:36,602 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 98 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:36,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 338 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20139 states. [2025-03-03 10:32:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20139 to 19401. [2025-03-03 10:32:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19401 states, 19400 states have (on average 1.0816494845360825) internal successors, (20984), 19400 states have internal predecessors, (20984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19401 states to 19401 states and 20984 transitions. [2025-03-03 10:32:36,767 INFO L78 Accepts]: Start accepts. Automaton has 19401 states and 20984 transitions. Word has length 1355 [2025-03-03 10:32:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:36,767 INFO L471 AbstractCegarLoop]: Abstraction has 19401 states and 20984 transitions. [2025-03-03 10:32:36,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 19401 states and 20984 transitions. [2025-03-03 10:32:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2025-03-03 10:32:36,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:36,785 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 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] [2025-03-03 10:32:36,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 10:32:36,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-03 10:32:36,985 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:36,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 184915383, now seen corresponding path program 1 times [2025-03-03 10:32:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:36,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116743091] [2025-03-03 10:32:36,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:37,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1441 statements into 1 equivalence classes. [2025-03-03 10:32:37,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1441 of 1441 statements. [2025-03-03 10:32:37,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:37,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6354 backedges. 3845 proven. 206 refuted. 0 times theorem prover too weak. 2303 trivial. 0 not checked. [2025-03-03 10:32:38,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116743091] [2025-03-03 10:32:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116743091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618033249] [2025-03-03 10:32:38,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:38,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:38,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 10:32:38,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1441 statements into 1 equivalence classes. [2025-03-03 10:32:38,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1441 of 1441 statements. [2025-03-03 10:32:38,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:38,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:38,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 10:32:38,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6354 backedges. 4220 proven. 282 refuted. 0 times theorem prover too weak. 1852 trivial. 0 not checked. [2025-03-03 10:32:40,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:32:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6354 backedges. 3750 proven. 323 refuted. 0 times theorem prover too weak. 2281 trivial. 0 not checked. [2025-03-03 10:32:43,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618033249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:32:43,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:32:43,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 12 [2025-03-03 10:32:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849392227] [2025-03-03 10:32:43,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:32:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 10:32:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:43,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 10:32:43,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 10:32:43,343 INFO L87 Difference]: Start difference. First operand 19401 states and 20984 transitions. Second operand has 13 states, 13 states have (on average 62.30769230769231) internal successors, (810), 12 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:46,650 INFO L93 Difference]: Finished difference Result 30327 states and 32736 transitions. [2025-03-03 10:32:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 10:32:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 62.30769230769231) internal successors, (810), 12 states have internal predecessors, (810), 0 states have call successors, (0), 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 1441 [2025-03-03 10:32:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:46,651 INFO L225 Difference]: With dead ends: 30327 [2025-03-03 10:32:46,651 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:32:46,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2902 GetRequests, 2874 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-03-03 10:32:46,662 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1724 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6902 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 6902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:46,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 134 Invalid, 7255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 6902 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 10:32:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:32:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:32:46,662 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-03 10:32:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:32:46,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1441 [2025-03-03 10:32:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:46,663 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:32:46,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.30769230769231) internal successors, (810), 12 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:32:46,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:32:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:32:46,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 10:32:46,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:46,872 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-03 10:32:46,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:33:05,446 WARN L286 SmtUtils]: Spent 18.57s on a formula simplification. DAG size of input: 704 DAG size of output: 691 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 10:33:07,615 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:33:07,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:33:07 BoogieIcfgContainer [2025-03-03 10:33:07,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:33:07,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:33:07,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:33:07,633 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:33:07,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:49" (3/4) ... [2025-03-03 10:33:07,636 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:33:07,661 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:33:07,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:33:07,666 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:33:07,667 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:33:07,787 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:33:07,787 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:33:07,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:33:07,788 INFO L158 Benchmark]: Toolchain (without parser) took 80193.59ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 110.0MB in the beginning and 955.1MB in the end (delta: -845.1MB). Peak memory consumption was 394.2MB. Max. memory is 16.1GB. [2025-03-03 10:33:07,788 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:33:07,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.26ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 67.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:33:07,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.86ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 50.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:33:07,788 INFO L158 Benchmark]: Boogie Preprocessor took 133.18ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 88.3MB in the end (delta: -38.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-03-03 10:33:07,788 INFO L158 Benchmark]: IcfgBuilder took 1313.46ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 88.3MB in the beginning and 258.7MB in the end (delta: -170.4MB). Peak memory consumption was 118.3MB. Max. memory is 16.1GB. [2025-03-03 10:33:07,789 INFO L158 Benchmark]: TraceAbstraction took 78023.62ms. Allocated memory was 419.4MB in the beginning and 1.4GB in the end (delta: 964.7MB). Free memory was 257.8MB in the beginning and 971.9MB in the end (delta: -714.1MB). Peak memory consumption was 854.0MB. Max. memory is 16.1GB. [2025-03-03 10:33:07,789 INFO L158 Benchmark]: Witness Printer took 154.31ms. Allocated memory is still 1.4GB. Free memory was 971.9MB in the beginning and 955.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:33:07,790 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.26ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 67.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.86ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 50.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.18ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 88.3MB in the end (delta: -38.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1313.46ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 88.3MB in the beginning and 258.7MB in the end (delta: -170.4MB). Peak memory consumption was 118.3MB. Max. memory is 16.1GB. * TraceAbstraction took 78023.62ms. Allocated memory was 419.4MB in the beginning and 1.4GB in the end (delta: 964.7MB). Free memory was 257.8MB in the beginning and 971.9MB in the end (delta: -714.1MB). Peak memory consumption was 854.0MB. Max. memory is 16.1GB. * Witness Printer took 154.31ms. Allocated memory is still 1.4GB. Free memory was 971.9MB in the beginning and 955.1MB 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: 199]: 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, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.2s, OverallIterations: 33, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6813 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6813 mSDsluCounter, 6599 SdHoareTripleChecker+Invalid, 16.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 855 mSDsCounter, 3435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27954 IncrementalHoareTripleChecker+Invalid, 31389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3435 mSolverCounterUnsat, 5744 mSDtfsCounter, 27954 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8879 GetRequests, 8779 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25090occurred in iteration=24, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 50121 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 26392 NumberOfCodeBlocks, 26392 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 27790 ConstructedInterpolants, 0 QuantifiedInterpolants, 86203 SizeOfPredicates, 14 NumberOfNonLiveVariables, 9316 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 43 InterpolantComputations, 32 PerfectInterpolantSequences, 75332/78580 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))) || ((((a23 <= 138) && (0 <= ((long long) 41 + a23))) && (a4 == 1)) && (130 <= a29))) || ((((((a29 <= 140) && (a23 <= 312)) || (a23 < 139)) && (a4 == 1)) && (a25 <= 9)) && (a8 == 15))) || ((((((a25 == 13) && (a23 <= 600000)) && (a29 <= 140)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a25 == 12) && (a23 <= 138)) && (a4 == 1)) && (a29 <= 130))) || (((((a29 <= 245) && (a23 <= 138)) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) && (130 <= a29))) || (((((((a4 == 0) && (a29 <= 274)) && (247 <= a29)) || (((a29 <= 275) && (261 <= a29)) && (a4 == 0))) && (a25 == 12)) && (a3 == 1)) && (a8 == 15))) || ((((((((a25 == 13) && (((long long) 284336 + a23) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (247 <= a29)) || ((((((long long) a23 + 43) <= 0) && (261 <= a29)) && (a4 == 0)) && (a25 <= 9))) && (a3 == 1)) && (a8 == 15))) || ((((((a23 <= 600000) && (141 <= a29)) && (a3 == 1)) && (0 <= ((long long) 41 + a23))) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (a23 <= 306)) && (a3 == 1)) && (0 <= ((long long) 41 + a23))) && (a4 == 1)) && (a8 == 15))) || ((((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a4 == 0)) && (a29 <= 274)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a29 <= 245)) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 245) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((((a29 <= 234) && (141 <= a29)) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a8 <= 15) && (a23 <= 138)) && (a4 == 1)) && (a25 == 10))) || (((((0 <= ((long long) 41 + a23)) && (a4 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (a29 <= 130))) || (((((a23 <= 600000) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:33:07,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE