./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label26.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 f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:50:58,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:50:58,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:50:58,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:50:58,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:50:58,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:50:58,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:50:58,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:50:58,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:50:58,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:50:58,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:50:58,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:50:58,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:50:58,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:50:58,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:50:58,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:50:58,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:50:58,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:50:58,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:50:58,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:50:58,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:50:58,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:50:58,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:50:58,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:50:58,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:50:58,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:50:58,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:50:58,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:50:58,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:50:58,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:50:58,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:50:58,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:50:58,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:50:58,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:50:58,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:50:58,666 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 -> f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 [2025-03-16 14:50:58,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:50:58,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:50:58,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:50:58,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:50:58,916 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:50:58,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2025-03-16 14:51:00,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912f97c2d/98098ef929e7426ebdfa6aba09eb1a0a/FLAG698056501 [2025-03-16 14:51:00,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:51:00,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2025-03-16 14:51:00,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912f97c2d/98098ef929e7426ebdfa6aba09eb1a0a/FLAG698056501 [2025-03-16 14:51:00,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912f97c2d/98098ef929e7426ebdfa6aba09eb1a0a [2025-03-16 14:51:00,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:51:00,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:51:00,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:51:00,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:51:00,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:51:00,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:51:00" (1/1) ... [2025-03-16 14:51:00,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c7fe49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:00, skipping insertion in model container [2025-03-16 14:51:00,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:51:00" (1/1) ... [2025-03-16 14:51:00,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:51:00,857 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_label26.c[5699,5712] [2025-03-16 14:51:01,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:51:01,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:51:01,063 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_label26.c[5699,5712] [2025-03-16 14:51:01,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:51:01,152 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:51:01,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01 WrapperNode [2025-03-16 14:51:01,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:51:01,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:51:01,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:51:01,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:51:01,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,265 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:51:01,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:51:01,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:51:01,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:51:01,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:51:01,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,361 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-16 14:51:01,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:51:01,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:51:01,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:51:01,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:51:01,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (1/1) ... [2025-03-16 14:51:01,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:51:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:01,463 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-16 14:51:01,468 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-16 14:51:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:51:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:51:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:51:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:51:01,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:51:01,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:51:02,638 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:51:02,639 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:51:02,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:51:02,654 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:51:02,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:02 BoogieIcfgContainer [2025-03-16 14:51:02,655 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:51:02,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:51:02,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:51:02,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:51:02,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:51:00" (1/3) ... [2025-03-16 14:51:02,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff14b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:51:02, skipping insertion in model container [2025-03-16 14:51:02,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:51:01" (2/3) ... [2025-03-16 14:51:02,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff14b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:51:02, skipping insertion in model container [2025-03-16 14:51:02,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:02" (3/3) ... [2025-03-16 14:51:02,663 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label26.c [2025-03-16 14:51:02,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:51:02,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label26.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:51:02,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:51:02,761 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;@185a91b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:51:02,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:51:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 14:51:02,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:02,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:02,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:02,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1159109412, now seen corresponding path program 1 times [2025-03-16 14:51:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939808642] [2025-03-16 14:51:02,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:02,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 14:51:02,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 14:51:02,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:02,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:02,894 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-16 14:51:02,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:02,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939808642] [2025-03-16 14:51:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939808642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:02,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:02,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487863762] [2025-03-16 14:51:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:02,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:51:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:02,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:51:02,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:51:02,916 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 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 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:02,950 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:51:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:51:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 14:51:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:02,957 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:51:02,957 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:51:02,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:51:02,961 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:02,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:51:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:51:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:51:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:51:02,996 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 38 [2025-03-16 14:51:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:02,996 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:51:03,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:51:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 14:51:03,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:03,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:03,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:51:03,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:03,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash -646586471, now seen corresponding path program 1 times [2025-03-16 14:51:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:03,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460384829] [2025-03-16 14:51:03,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:03,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 14:51:03,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 14:51:03,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:03,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:03,178 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-16 14:51:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460384829] [2025-03-16 14:51:03,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460384829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:03,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:03,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423915806] [2025-03-16 14:51:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:03,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:03,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:03,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:03,181 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:03,945 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2025-03-16 14:51:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:03,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 14:51:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:03,948 INFO L225 Difference]: With dead ends: 639 [2025-03-16 14:51:03,948 INFO L226 Difference]: Without dead ends: 421 [2025-03-16 14:51:03,948 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-16 14:51:03,949 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:03,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:51:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-16 14:51:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2025-03-16 14:51:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2025-03-16 14:51:03,977 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 38 [2025-03-16 14:51:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:03,977 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2025-03-16 14:51:03,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2025-03-16 14:51:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 14:51:03,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:03,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:03,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:51:03,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1384748545, now seen corresponding path program 1 times [2025-03-16 14:51:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526250918] [2025-03-16 14:51:03,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:04,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 14:51:04,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 14:51:04,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:04,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526250918] [2025-03-16 14:51:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526250918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:04,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:04,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209397357] [2025-03-16 14:51:04,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:04,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:04,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:04,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:04,236 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:04,884 INFO L93 Difference]: Finished difference Result 1198 states and 1828 transitions. [2025-03-16 14:51:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:04,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-16 14:51:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:04,888 INFO L225 Difference]: With dead ends: 1198 [2025-03-16 14:51:04,888 INFO L226 Difference]: Without dead ends: 788 [2025-03-16 14:51:04,891 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-16 14:51:04,892 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:04,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 175 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-16 14:51:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2025-03-16 14:51:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2025-03-16 14:51:04,909 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 104 [2025-03-16 14:51:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:04,909 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2025-03-16 14:51:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2025-03-16 14:51:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 14:51:04,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:04,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:04,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:51:04,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:04,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -955193527, now seen corresponding path program 1 times [2025-03-16 14:51:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677596350] [2025-03-16 14:51:04,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:04,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 14:51:04,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 14:51:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677596350] [2025-03-16 14:51:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677596350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:05,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:05,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254091661] [2025-03-16 14:51:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:05,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:05,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:05,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:05,193 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:05,813 INFO L93 Difference]: Finished difference Result 2313 states and 3180 transitions. [2025-03-16 14:51:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:05,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 14:51:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:05,820 INFO L225 Difference]: With dead ends: 2313 [2025-03-16 14:51:05,820 INFO L226 Difference]: Without dead ends: 1526 [2025-03-16 14:51:05,821 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-16 14:51:05,823 INFO L435 NwaCegarLoop]: 168 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, 192 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-16 14:51:05,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 192 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-03-16 14:51:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1525. [2025-03-16 14:51:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2171916010498687) internal successors, (1855), 1524 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1855 transitions. [2025-03-16 14:51:05,852 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1855 transitions. Word has length 108 [2025-03-16 14:51:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1855 transitions. [2025-03-16 14:51:05,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1855 transitions. [2025-03-16 14:51:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 14:51:05,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:05,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:51:05,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:05,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1270526124, now seen corresponding path program 1 times [2025-03-16 14:51:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236581233] [2025-03-16 14:51:05,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:05,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:05,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 14:51:05,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 14:51:05,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:05,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:51:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236581233] [2025-03-16 14:51:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236581233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:06,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462918171] [2025-03-16 14:51:06,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:06,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:06,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:06,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:06,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:06,037 INFO L87 Difference]: Start difference. First operand 1525 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:06,643 INFO L93 Difference]: Finished difference Result 3613 states and 4468 transitions. [2025-03-16 14:51:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-03-16 14:51:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:06,649 INFO L225 Difference]: With dead ends: 3613 [2025-03-16 14:51:06,649 INFO L226 Difference]: Without dead ends: 2273 [2025-03-16 14:51:06,651 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-16 14:51:06,651 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 166 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:06,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 334 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2025-03-16 14:51:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1896. [2025-03-16 14:51:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1895 states have (on average 1.2158311345646438) internal successors, (2304), 1895 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2304 transitions. [2025-03-16 14:51:06,677 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2304 transitions. Word has length 165 [2025-03-16 14:51:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:06,677 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2304 transitions. [2025-03-16 14:51:06,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2304 transitions. [2025-03-16 14:51:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 14:51:06,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:06,680 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 14:51:06,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:51:06,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:06,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1569967668, now seen corresponding path program 1 times [2025-03-16 14:51:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:06,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079719724] [2025-03-16 14:51:06,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:06,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 14:51:06,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 14:51:06,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:06,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:51:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079719724] [2025-03-16 14:51:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079719724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526962643] [2025-03-16 14:51:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:06,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:06,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:06,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:06,905 INFO L87 Difference]: Start difference. First operand 1896 states and 2304 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:07,518 INFO L93 Difference]: Finished difference Result 4896 states and 6067 transitions. [2025-03-16 14:51:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2025-03-16 14:51:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:07,528 INFO L225 Difference]: With dead ends: 4896 [2025-03-16 14:51:07,528 INFO L226 Difference]: Without dead ends: 3001 [2025-03-16 14:51:07,530 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-16 14:51:07,532 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 173 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:07,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 336 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2025-03-16 14:51:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 3001. [2025-03-16 14:51:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 3000 states have (on average 1.192) internal successors, (3576), 3000 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 3576 transitions. [2025-03-16 14:51:07,581 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 3576 transitions. Word has length 220 [2025-03-16 14:51:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:07,582 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 3576 transitions. [2025-03-16 14:51:07,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 3576 transitions. [2025-03-16 14:51:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 14:51:07,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:07,589 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:51:07,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:51:07,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:07,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1931604006, now seen corresponding path program 1 times [2025-03-16 14:51:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925719304] [2025-03-16 14:51:07,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:07,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 14:51:07,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 14:51:07,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:07,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-16 14:51:07,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:07,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925719304] [2025-03-16 14:51:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925719304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:07,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:07,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662816544] [2025-03-16 14:51:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:07,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:07,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:07,816 INFO L87 Difference]: Start difference. First operand 3001 states and 3576 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:08,427 INFO L93 Difference]: Finished difference Result 6557 states and 7935 transitions. [2025-03-16 14:51:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:08,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 268 [2025-03-16 14:51:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:08,436 INFO L225 Difference]: With dead ends: 6557 [2025-03-16 14:51:08,436 INFO L226 Difference]: Without dead ends: 3557 [2025-03-16 14:51:08,439 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-16 14:51:08,440 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:08,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 381 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2025-03-16 14:51:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3552. [2025-03-16 14:51:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3552 states, 3551 states have (on average 1.1906505209800056) internal successors, (4228), 3551 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 4228 transitions. [2025-03-16 14:51:08,494 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 4228 transitions. Word has length 268 [2025-03-16 14:51:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:08,494 INFO L471 AbstractCegarLoop]: Abstraction has 3552 states and 4228 transitions. [2025-03-16 14:51:08,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 4228 transitions. [2025-03-16 14:51:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 14:51:08,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:08,499 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:51:08,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:51:08,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:08,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash -104499494, now seen corresponding path program 1 times [2025-03-16 14:51:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376250987] [2025-03-16 14:51:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:08,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 14:51:08,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 14:51:08,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:51:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376250987] [2025-03-16 14:51:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376250987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152650000] [2025-03-16 14:51:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:08,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:08,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:08,626 INFO L87 Difference]: Start difference. First operand 3552 states and 4228 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:09,188 INFO L93 Difference]: Finished difference Result 8573 states and 10382 transitions. [2025-03-16 14:51:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2025-03-16 14:51:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:09,199 INFO L225 Difference]: With dead ends: 8573 [2025-03-16 14:51:09,199 INFO L226 Difference]: Without dead ends: 5022 [2025-03-16 14:51:09,203 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-16 14:51:09,203 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 158 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:09,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 151 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2025-03-16 14:51:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 5020. [2025-03-16 14:51:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5020 states, 5019 states have (on average 1.1741382745566846) internal successors, (5893), 5019 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 5893 transitions. [2025-03-16 14:51:09,258 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 5893 transitions. Word has length 300 [2025-03-16 14:51:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:09,259 INFO L471 AbstractCegarLoop]: Abstraction has 5020 states and 5893 transitions. [2025-03-16 14:51:09,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 5893 transitions. [2025-03-16 14:51:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-16 14:51:09,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:09,266 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:51:09,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:09,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1645403513, now seen corresponding path program 1 times [2025-03-16 14:51:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:09,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514854452] [2025-03-16 14:51:09,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:09,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 14:51:09,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 14:51:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 14:51:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514854452] [2025-03-16 14:51:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514854452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995138438] [2025-03-16 14:51:09,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:09,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:09,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:09,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:09,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:09,466 INFO L87 Difference]: Start difference. First operand 5020 states and 5893 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:10,051 INFO L93 Difference]: Finished difference Result 11144 states and 13223 transitions. [2025-03-16 14:51:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:10,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 358 [2025-03-16 14:51:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:10,065 INFO L225 Difference]: With dead ends: 11144 [2025-03-16 14:51:10,065 INFO L226 Difference]: Without dead ends: 6125 [2025-03-16 14:51:10,069 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-16 14:51:10,070 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 167 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:10,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 156 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2025-03-16 14:51:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 6123. [2025-03-16 14:51:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6123 states, 6122 states have (on average 1.1661221822933683) internal successors, (7139), 6122 states have internal predecessors, (7139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 7139 transitions. [2025-03-16 14:51:10,155 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 7139 transitions. Word has length 358 [2025-03-16 14:51:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:10,156 INFO L471 AbstractCegarLoop]: Abstraction has 6123 states and 7139 transitions. [2025-03-16 14:51:10,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 7139 transitions. [2025-03-16 14:51:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-16 14:51:10,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:10,164 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:51:10,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:51:10,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:10,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -797156569, now seen corresponding path program 1 times [2025-03-16 14:51:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138911091] [2025-03-16 14:51:10,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-16 14:51:10,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-16 14:51:10,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:10,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 14:51:10,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138911091] [2025-03-16 14:51:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138911091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075079163] [2025-03-16 14:51:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:10,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:10,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:10,382 INFO L87 Difference]: Start difference. First operand 6123 states and 7139 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:10,693 INFO L93 Difference]: Finished difference Result 12241 states and 14273 transitions. [2025-03-16 14:51:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:10,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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 378 [2025-03-16 14:51:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:10,707 INFO L225 Difference]: With dead ends: 12241 [2025-03-16 14:51:10,707 INFO L226 Difference]: Without dead ends: 6119 [2025-03-16 14:51:10,712 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-16 14:51:10,712 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:10,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:51:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2025-03-16 14:51:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 6119. [2025-03-16 14:51:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6119 states, 6118 states have (on average 1.1655769859431186) internal successors, (7131), 6118 states have internal predecessors, (7131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6119 states to 6119 states and 7131 transitions. [2025-03-16 14:51:10,781 INFO L78 Accepts]: Start accepts. Automaton has 6119 states and 7131 transitions. Word has length 378 [2025-03-16 14:51:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:10,782 INFO L471 AbstractCegarLoop]: Abstraction has 6119 states and 7131 transitions. [2025-03-16 14:51:10,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6119 states and 7131 transitions. [2025-03-16 14:51:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-16 14:51:10,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:10,791 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:51:10,792 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash 217376334, now seen corresponding path program 1 times [2025-03-16 14:51:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67445772] [2025-03-16 14:51:10,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:10,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-16 14:51:10,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-16 14:51:10,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:10,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 14:51:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67445772] [2025-03-16 14:51:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67445772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113640161] [2025-03-16 14:51:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:11,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:11,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:11,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:11,059 INFO L87 Difference]: Start difference. First operand 6119 states and 7131 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:12,018 INFO L93 Difference]: Finished difference Result 16663 states and 19273 transitions. [2025-03-16 14:51:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 410 [2025-03-16 14:51:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:12,044 INFO L225 Difference]: With dead ends: 16663 [2025-03-16 14:51:12,044 INFO L226 Difference]: Without dead ends: 10545 [2025-03-16 14:51:12,051 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-16 14:51:12,052 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 188 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:12,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 69 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:51:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10545 states. [2025-03-16 14:51:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10545 to 10545. [2025-03-16 14:51:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10545 states, 10544 states have (on average 1.1465288315629742) internal successors, (12089), 10544 states have internal predecessors, (12089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 12089 transitions. [2025-03-16 14:51:12,160 INFO L78 Accepts]: Start accepts. Automaton has 10545 states and 12089 transitions. Word has length 410 [2025-03-16 14:51:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:12,161 INFO L471 AbstractCegarLoop]: Abstraction has 10545 states and 12089 transitions. [2025-03-16 14:51:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 10545 states and 12089 transitions. [2025-03-16 14:51:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-16 14:51:12,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:12,200 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:12,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:51:12,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:12,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash 547652481, now seen corresponding path program 1 times [2025-03-16 14:51:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:12,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932650280] [2025-03-16 14:51:12,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:12,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:12,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-16 14:51:12,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-16 14:51:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-16 14:51:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932650280] [2025-03-16 14:51:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932650280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:12,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108402836] [2025-03-16 14:51:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:12,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:12,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:12,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:12,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:12,354 INFO L87 Difference]: Start difference. First operand 10545 states and 12089 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:12,910 INFO L93 Difference]: Finished difference Result 19427 states and 22358 transitions. [2025-03-16 14:51:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2025-03-16 14:51:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:12,926 INFO L225 Difference]: With dead ends: 19427 [2025-03-16 14:51:12,927 INFO L226 Difference]: Without dead ends: 10543 [2025-03-16 14:51:12,934 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-16 14:51:12,935 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:12,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 292 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10543 states. [2025-03-16 14:51:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10543 to 10543. [2025-03-16 14:51:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10543 states, 10542 states have (on average 1.126351735913489) internal successors, (11874), 10542 states have internal predecessors, (11874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10543 states to 10543 states and 11874 transitions. [2025-03-16 14:51:13,035 INFO L78 Accepts]: Start accepts. Automaton has 10543 states and 11874 transitions. Word has length 439 [2025-03-16 14:51:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:13,036 INFO L471 AbstractCegarLoop]: Abstraction has 10543 states and 11874 transitions. [2025-03-16 14:51:13,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10543 states and 11874 transitions. [2025-03-16 14:51:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 14:51:13,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:13,048 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-16 14:51:13,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:51:13,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:13,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1779667509, now seen corresponding path program 1 times [2025-03-16 14:51:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109833509] [2025-03-16 14:51:13,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:13,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 14:51:13,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 14:51:13,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:13,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-16 14:51:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109833509] [2025-03-16 14:51:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109833509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:13,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250719194] [2025-03-16 14:51:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:13,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:13,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:13,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:13,229 INFO L87 Difference]: Start difference. First operand 10543 states and 11874 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:13,804 INFO L93 Difference]: Finished difference Result 21264 states and 24015 transitions. [2025-03-16 14:51:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 475 [2025-03-16 14:51:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:13,823 INFO L225 Difference]: With dead ends: 21264 [2025-03-16 14:51:13,824 INFO L226 Difference]: Without dead ends: 12198 [2025-03-16 14:51:13,832 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-16 14:51:13,833 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 62 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:13,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 348 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2025-03-16 14:51:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 11646. [2025-03-16 14:51:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11646 states, 11645 states have (on average 1.1196221554315158) internal successors, (13038), 11645 states have internal predecessors, (13038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11646 states to 11646 states and 13038 transitions. [2025-03-16 14:51:13,991 INFO L78 Accepts]: Start accepts. Automaton has 11646 states and 13038 transitions. Word has length 475 [2025-03-16 14:51:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:13,991 INFO L471 AbstractCegarLoop]: Abstraction has 11646 states and 13038 transitions. [2025-03-16 14:51:13,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 11646 states and 13038 transitions. [2025-03-16 14:51:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-16 14:51:14,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:14,010 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:51:14,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:51:14,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:14,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1713190417, now seen corresponding path program 1 times [2025-03-16 14:51:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:14,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139172227] [2025-03-16 14:51:14,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:14,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:14,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-16 14:51:14,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-16 14:51:14,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:14,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 448 proven. 24 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-16 14:51:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139172227] [2025-03-16 14:51:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139172227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714051333] [2025-03-16 14:51:14,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:14,580 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-16 14:51:14,582 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-16 14:51:14,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-16 14:51:14,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-16 14:51:14,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:14,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:14,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:51:14,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-16 14:51:14,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:51:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714051333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:14,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:51:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:51:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794935658] [2025-03-16 14:51:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:14,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:14,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:14,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:51:14,885 INFO L87 Difference]: Start difference. First operand 11646 states and 13038 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-16 14:51:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:15,390 INFO L93 Difference]: Finished difference Result 23668 states and 26542 transitions. [2025-03-16 14:51:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:15,390 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 497 [2025-03-16 14:51:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:15,408 INFO L225 Difference]: With dead ends: 23668 [2025-03-16 14:51:15,408 INFO L226 Difference]: Without dead ends: 13683 [2025-03-16 14:51:15,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:51:15,418 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:15,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 77 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2025-03-16 14:51:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 11830. [2025-03-16 14:51:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11829 states have (on average 1.1186913517626174) internal successors, (13233), 11829 states have internal predecessors, (13233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 13233 transitions. [2025-03-16 14:51:15,532 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 13233 transitions. Word has length 497 [2025-03-16 14:51:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:15,532 INFO L471 AbstractCegarLoop]: Abstraction has 11830 states and 13233 transitions. [2025-03-16 14:51:15,533 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-16 14:51:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 13233 transitions. [2025-03-16 14:51:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-16 14:51:15,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:15,545 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:51:15,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:51:15,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:51:15,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:15,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1703626838, now seen corresponding path program 1 times [2025-03-16 14:51:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:15,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528354858] [2025-03-16 14:51:15,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:15,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-16 14:51:15,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-16 14:51:15,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:15,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-16 14:51:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:15,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528354858] [2025-03-16 14:51:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528354858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:15,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494163293] [2025-03-16 14:51:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:15,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:15,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:15,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:15,994 INFO L87 Difference]: Start difference. First operand 11830 states and 13233 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:16,554 INFO L93 Difference]: Finished difference Result 25331 states and 28401 transitions. [2025-03-16 14:51:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 498 [2025-03-16 14:51:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:16,575 INFO L225 Difference]: With dead ends: 25331 [2025-03-16 14:51:16,575 INFO L226 Difference]: Without dead ends: 13870 [2025-03-16 14:51:16,586 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-16 14:51:16,586 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 133 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:16,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 131 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2025-03-16 14:51:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13684. [2025-03-16 14:51:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13684 states, 13683 states have (on average 1.1156910034349192) internal successors, (15266), 13683 states have internal predecessors, (15266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13684 states to 13684 states and 15266 transitions. [2025-03-16 14:51:16,767 INFO L78 Accepts]: Start accepts. Automaton has 13684 states and 15266 transitions. Word has length 498 [2025-03-16 14:51:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:16,767 INFO L471 AbstractCegarLoop]: Abstraction has 13684 states and 15266 transitions. [2025-03-16 14:51:16,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 13684 states and 15266 transitions. [2025-03-16 14:51:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-16 14:51:16,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:16,780 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:51:16,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:51:16,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:16,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1086976346, now seen corresponding path program 1 times [2025-03-16 14:51:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:16,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294156375] [2025-03-16 14:51:16,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:16,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-16 14:51:16,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-16 14:51:16,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-16 14:51:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294156375] [2025-03-16 14:51:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294156375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710306536] [2025-03-16 14:51:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:17,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:17,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:17,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:17,016 INFO L87 Difference]: Start difference. First operand 13684 states and 15266 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:17,507 INFO L93 Difference]: Finished difference Result 31050 states and 34701 transitions. [2025-03-16 14:51:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:17,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 502 [2025-03-16 14:51:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:17,528 INFO L225 Difference]: With dead ends: 31050 [2025-03-16 14:51:17,528 INFO L226 Difference]: Without dead ends: 17735 [2025-03-16 14:51:17,537 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-16 14:51:17,537 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 123 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:17,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 85 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17735 states. [2025-03-16 14:51:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17735 to 16984. [2025-03-16 14:51:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16984 states, 16983 states have (on average 1.1102278749337573) internal successors, (18855), 16983 states have internal predecessors, (18855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16984 states to 16984 states and 18855 transitions. [2025-03-16 14:51:17,675 INFO L78 Accepts]: Start accepts. Automaton has 16984 states and 18855 transitions. Word has length 502 [2025-03-16 14:51:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:17,676 INFO L471 AbstractCegarLoop]: Abstraction has 16984 states and 18855 transitions. [2025-03-16 14:51:17,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16984 states and 18855 transitions. [2025-03-16 14:51:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-16 14:51:17,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:17,687 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:17,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:51:17,687 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:17,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:17,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1084986353, now seen corresponding path program 1 times [2025-03-16 14:51:17,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097488303] [2025-03-16 14:51:17,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:17,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:17,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-16 14:51:17,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-16 14:51:17,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:17,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 228 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-16 14:51:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097488303] [2025-03-16 14:51:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097488303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034525290] [2025-03-16 14:51:18,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:18,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:18,399 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-16 14:51:18,400 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-16 14:51:18,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-16 14:51:18,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-16 14:51:18,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:18,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:18,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:51:18,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-16 14:51:18,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:51:18,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034525290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:18,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:51:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:51:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144865993] [2025-03-16 14:51:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:18,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:18,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:18,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:18,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:51:18,654 INFO L87 Difference]: Start difference. First operand 16984 states and 18855 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:19,190 INFO L93 Difference]: Finished difference Result 19746 states and 21904 transitions. [2025-03-16 14:51:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:19,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-16 14:51:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:19,211 INFO L225 Difference]: With dead ends: 19746 [2025-03-16 14:51:19,211 INFO L226 Difference]: Without dead ends: 19744 [2025-03-16 14:51:19,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:51:19,217 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 181 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:19,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 138 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2025-03-16 14:51:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 16984. [2025-03-16 14:51:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16984 states, 16983 states have (on average 1.1101689925219338) internal successors, (18854), 16983 states have internal predecessors, (18854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16984 states to 16984 states and 18854 transitions. [2025-03-16 14:51:19,425 INFO L78 Accepts]: Start accepts. Automaton has 16984 states and 18854 transitions. Word has length 508 [2025-03-16 14:51:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:19,425 INFO L471 AbstractCegarLoop]: Abstraction has 16984 states and 18854 transitions. [2025-03-16 14:51:19,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 16984 states and 18854 transitions. [2025-03-16 14:51:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2025-03-16 14:51:19,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:19,438 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-16 14:51:19,444 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-16 14:51:19,639 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,SelfDestructingSolverStorable16 [2025-03-16 14:51:19,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:19,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2075413062, now seen corresponding path program 1 times [2025-03-16 14:51:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953170055] [2025-03-16 14:51:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:19,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 636 statements into 1 equivalence classes. [2025-03-16 14:51:19,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 636 of 636 statements. [2025-03-16 14:51:19,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:19,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-16 14:51:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:20,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953170055] [2025-03-16 14:51:20,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953170055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:20,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460690662] [2025-03-16 14:51:20,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:20,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:20,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:20,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:20,200 INFO L87 Difference]: Start difference. First operand 16984 states and 18854 transitions. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:21,095 INFO L93 Difference]: Finished difference Result 38028 states and 42378 transitions. [2025-03-16 14:51:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 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 636 [2025-03-16 14:51:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:21,114 INFO L225 Difference]: With dead ends: 38028 [2025-03-16 14:51:21,114 INFO L226 Difference]: Without dead ends: 23257 [2025-03-16 14:51:21,121 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-16 14:51:21,122 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 213 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:21,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 71 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:51:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23257 states. [2025-03-16 14:51:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23257 to 19016. [2025-03-16 14:51:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19016 states, 19015 states have (on average 1.115592952931896) internal successors, (21213), 19015 states have internal predecessors, (21213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19016 states to 19016 states and 21213 transitions. [2025-03-16 14:51:21,297 INFO L78 Accepts]: Start accepts. Automaton has 19016 states and 21213 transitions. Word has length 636 [2025-03-16 14:51:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:21,297 INFO L471 AbstractCegarLoop]: Abstraction has 19016 states and 21213 transitions. [2025-03-16 14:51:21,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19016 states and 21213 transitions. [2025-03-16 14:51:21,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-16 14:51:21,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:21,312 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, 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, 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, 1, 1, 1, 1, 1, 1, 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-16 14:51:21,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:51:21,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:21,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1191894226, now seen corresponding path program 1 times [2025-03-16 14:51:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:21,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635129504] [2025-03-16 14:51:21,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:21,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-16 14:51:21,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-16 14:51:21,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:21,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 1039 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2025-03-16 14:51:21,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:21,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635129504] [2025-03-16 14:51:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635129504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:21,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931800296] [2025-03-16 14:51:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:21,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:21,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:21,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:21,636 INFO L87 Difference]: Start difference. First operand 19016 states and 21213 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:22,236 INFO L93 Difference]: Finished difference Result 37117 states and 41393 transitions. [2025-03-16 14:51:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:22,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 707 [2025-03-16 14:51:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:22,253 INFO L225 Difference]: With dead ends: 37117 [2025-03-16 14:51:22,253 INFO L226 Difference]: Without dead ends: 18470 [2025-03-16 14:51:22,265 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-16 14:51:22,265 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 49 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:22,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 362 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:51:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18470 states. [2025-03-16 14:51:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18470 to 18462. [2025-03-16 14:51:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18462 states, 18461 states have (on average 1.0967444883809112) internal successors, (20247), 18461 states have internal predecessors, (20247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 20247 transitions. [2025-03-16 14:51:22,413 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 20247 transitions. Word has length 707 [2025-03-16 14:51:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:22,413 INFO L471 AbstractCegarLoop]: Abstraction has 18462 states and 20247 transitions. [2025-03-16 14:51:22,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 20247 transitions. [2025-03-16 14:51:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 925 [2025-03-16 14:51:22,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:22,429 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, 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, 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, 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, 1, 1, 1, 1] [2025-03-16 14:51:22,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:51:22,429 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:22,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash 385278132, now seen corresponding path program 1 times [2025-03-16 14:51:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146554846] [2025-03-16 14:51:22,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:22,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 924 statements into 1 equivalence classes. [2025-03-16 14:51:22,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 924 of 924 statements. [2025-03-16 14:51:22,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:22,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2496 backedges. 1645 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2025-03-16 14:51:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146554846] [2025-03-16 14:51:22,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146554846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:22,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:22,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:22,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478602788] [2025-03-16 14:51:22,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:22,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:22,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:22,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:22,932 INFO L87 Difference]: Start difference. First operand 18462 states and 20247 transitions. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:23,768 INFO L93 Difference]: Finished difference Result 36190 states and 39682 transitions. [2025-03-16 14:51:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:23,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 924 [2025-03-16 14:51:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:23,785 INFO L225 Difference]: With dead ends: 36190 [2025-03-16 14:51:23,785 INFO L226 Difference]: Without dead ends: 19941 [2025-03-16 14:51:23,794 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-16 14:51:23,795 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 160 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:23,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 69 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:51:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19941 states. [2025-03-16 14:51:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19941 to 18462. [2025-03-16 14:51:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18462 states, 18461 states have (on average 1.096419478901468) internal successors, (20241), 18461 states have internal predecessors, (20241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 20241 transitions. [2025-03-16 14:51:23,943 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 20241 transitions. Word has length 924 [2025-03-16 14:51:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:23,943 INFO L471 AbstractCegarLoop]: Abstraction has 18462 states and 20241 transitions. [2025-03-16 14:51:23,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 20241 transitions. [2025-03-16 14:51:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2025-03-16 14:51:23,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:23,959 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-16 14:51:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:51:23,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash -867586582, now seen corresponding path program 1 times [2025-03-16 14:51:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:23,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68931978] [2025-03-16 14:51:23,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:24,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 975 statements into 1 equivalence classes. [2025-03-16 14:51:24,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 975 of 975 statements. [2025-03-16 14:51:24,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:24,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 1889 proven. 106 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2025-03-16 14:51:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68931978] [2025-03-16 14:51:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68931978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149859627] [2025-03-16 14:51:25,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:25,367 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-16 14:51:25,368 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-16 14:51:25,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 975 statements into 1 equivalence classes. [2025-03-16 14:51:25,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 975 of 975 statements. [2025-03-16 14:51:25,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:25,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:25,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:51:25,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 1909 proven. 434 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2025-03-16 14:51:26,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:51:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 2343 proven. 0 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2025-03-16 14:51:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149859627] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:51:26,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2025-03-16 14:51:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062421816] [2025-03-16 14:51:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:26,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:51:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:26,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:51:26,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:51:26,525 INFO L87 Difference]: Start difference. First operand 18462 states and 20241 transitions. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:27,491 INFO L93 Difference]: Finished difference Result 41345 states and 45372 transitions. [2025-03-16 14:51:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:27,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 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 975 [2025-03-16 14:51:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:27,513 INFO L225 Difference]: With dead ends: 41345 [2025-03-16 14:51:27,513 INFO L226 Difference]: Without dead ends: 25096 [2025-03-16 14:51:27,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1954 GetRequests, 1943 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:51:27,523 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 186 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:27,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 65 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:51:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25096 states. [2025-03-16 14:51:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25096 to 18094. [2025-03-16 14:51:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18094 states, 18093 states have (on average 1.0973857292875697) internal successors, (19855), 18093 states have internal predecessors, (19855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18094 states to 18094 states and 19855 transitions. [2025-03-16 14:51:27,760 INFO L78 Accepts]: Start accepts. Automaton has 18094 states and 19855 transitions. Word has length 975 [2025-03-16 14:51:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:27,761 INFO L471 AbstractCegarLoop]: Abstraction has 18094 states and 19855 transitions. [2025-03-16 14:51:27,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18094 states and 19855 transitions. [2025-03-16 14:51:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2025-03-16 14:51:27,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:27,784 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 6, 6, 6, 6, 6, 6, 6, 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, 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-16 14:51:27,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:51:27,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:27,985 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -314870849, now seen corresponding path program 1 times [2025-03-16 14:51:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459481437] [2025-03-16 14:51:27,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:28,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 986 statements into 1 equivalence classes. [2025-03-16 14:51:28,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 986 of 986 statements. [2025-03-16 14:51:28,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:28,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3228 backedges. 1886 proven. 64 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2025-03-16 14:51:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459481437] [2025-03-16 14:51:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459481437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:51:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748962784] [2025-03-16 14:51:28,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:28,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:28,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:51:28,906 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-16 14:51:28,907 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-16 14:51:28,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 986 statements into 1 equivalence classes. [2025-03-16 14:51:29,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 986 of 986 statements. [2025-03-16 14:51:29,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:29,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:29,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:51:29,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:51:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3228 backedges. 1950 proven. 0 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2025-03-16 14:51:29,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:51:29,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748962784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:29,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:51:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:51:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115708213] [2025-03-16 14:51:29,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:29,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:29,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:29,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:51:29,231 INFO L87 Difference]: Start difference. First operand 18094 states and 19855 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:29,721 INFO L93 Difference]: Finished difference Result 39144 states and 42950 transitions. [2025-03-16 14:51:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:29,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 986 [2025-03-16 14:51:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:29,742 INFO L225 Difference]: With dead ends: 39144 [2025-03-16 14:51:29,742 INFO L226 Difference]: Without dead ends: 20867 [2025-03-16 14:51:29,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 985 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-16 14:51:29,755 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:29,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 344 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20867 states. [2025-03-16 14:51:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20867 to 18830. [2025-03-16 14:51:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18830 states, 18829 states have (on average 1.0957034361888576) internal successors, (20631), 18829 states have internal predecessors, (20631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18830 states to 18830 states and 20631 transitions. [2025-03-16 14:51:29,917 INFO L78 Accepts]: Start accepts. Automaton has 18830 states and 20631 transitions. Word has length 986 [2025-03-16 14:51:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:29,918 INFO L471 AbstractCegarLoop]: Abstraction has 18830 states and 20631 transitions. [2025-03-16 14:51:29,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18830 states and 20631 transitions. [2025-03-16 14:51:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2025-03-16 14:51:29,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:29,933 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 14:51:29,939 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-16 14:51:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:51:30,134 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -180487048, now seen corresponding path program 1 times [2025-03-16 14:51:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613212876] [2025-03-16 14:51:30,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:30,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes. [2025-03-16 14:51:30,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements. [2025-03-16 14:51:30,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:30,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3924 backedges. 2160 proven. 0 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2025-03-16 14:51:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:30,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613212876] [2025-03-16 14:51:30,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613212876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:30,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:30,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109403553] [2025-03-16 14:51:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:30,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:30,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:30,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:30,458 INFO L87 Difference]: Start difference. First operand 18830 states and 20631 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:30,737 INFO L93 Difference]: Finished difference Result 37102 states and 40650 transitions. [2025-03-16 14:51:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:30,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 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-16 14:51:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:30,753 INFO L225 Difference]: With dead ends: 37102 [2025-03-16 14:51:30,753 INFO L226 Difference]: Without dead ends: 18273 [2025-03-16 14:51:30,764 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-16 14:51:30,764 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:30,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 38 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:51:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18273 states. [2025-03-16 14:51:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18273 to 18270. [2025-03-16 14:51:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18270 states, 18269 states have (on average 1.0954075209371066) internal successors, (20012), 18269 states have internal predecessors, (20012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18270 states to 18270 states and 20012 transitions. [2025-03-16 14:51:30,900 INFO L78 Accepts]: Start accepts. Automaton has 18270 states and 20012 transitions. Word has length 1067 [2025-03-16 14:51:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 18270 states and 20012 transitions. [2025-03-16 14:51:30,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 18270 states and 20012 transitions. [2025-03-16 14:51:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2025-03-16 14:51:30,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:30,915 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:51:30,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:51:30,915 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1976942738, now seen corresponding path program 1 times [2025-03-16 14:51:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653677427] [2025-03-16 14:51:30,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:30,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1078 statements into 1 equivalence classes. [2025-03-16 14:51:31,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1078 of 1078 statements. [2025-03-16 14:51:31,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:31,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 2000 proven. 0 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2025-03-16 14:51:31,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653677427] [2025-03-16 14:51:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653677427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:31,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:31,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:31,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660152] [2025-03-16 14:51:31,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:31,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:31,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:31,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:31,437 INFO L87 Difference]: Start difference. First operand 18270 states and 20012 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:31,919 INFO L93 Difference]: Finished difference Result 38941 states and 42602 transitions. [2025-03-16 14:51:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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 1078 [2025-03-16 14:51:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:31,940 INFO L225 Difference]: With dead ends: 38941 [2025-03-16 14:51:31,940 INFO L226 Difference]: Without dead ends: 20116 [2025-03-16 14:51:31,953 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-16 14:51:31,953 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:31,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 339 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20116 states. [2025-03-16 14:51:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20116 to 18640. [2025-03-16 14:51:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18640 states, 18639 states have (on average 1.0940501099844413) internal successors, (20392), 18639 states have internal predecessors, (20392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18640 states to 18640 states and 20392 transitions. [2025-03-16 14:51:32,124 INFO L78 Accepts]: Start accepts. Automaton has 18640 states and 20392 transitions. Word has length 1078 [2025-03-16 14:51:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:32,124 INFO L471 AbstractCegarLoop]: Abstraction has 18640 states and 20392 transitions. [2025-03-16 14:51:32,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18640 states and 20392 transitions. [2025-03-16 14:51:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1161 [2025-03-16 14:51:32,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:32,141 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:32,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 14:51:32,142 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:32,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -516662907, now seen corresponding path program 1 times [2025-03-16 14:51:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700519310] [2025-03-16 14:51:32,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1160 statements into 1 equivalence classes. [2025-03-16 14:51:32,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1160 of 1160 statements. [2025-03-16 14:51:32,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:32,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 2386 proven. 0 refuted. 0 times theorem prover too weak. 2402 trivial. 0 not checked. [2025-03-16 14:51:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:32,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700519310] [2025-03-16 14:51:32,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700519310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:32,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:32,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481550325] [2025-03-16 14:51:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:32,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:32,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:32,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:32,979 INFO L87 Difference]: Start difference. First operand 18640 states and 20392 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:33,707 INFO L93 Difference]: Finished difference Result 44836 states and 48985 transitions. [2025-03-16 14:51:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1160 [2025-03-16 14:51:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:33,728 INFO L225 Difference]: With dead ends: 44836 [2025-03-16 14:51:33,728 INFO L226 Difference]: Without dead ends: 26011 [2025-03-16 14:51:33,739 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-16 14:51:33,740 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:33,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 69 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26011 states. [2025-03-16 14:51:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26011 to 23054. [2025-03-16 14:51:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23054 states, 23053 states have (on average 1.0934802411833602) internal successors, (25208), 23053 states have internal predecessors, (25208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23054 states to 23054 states and 25208 transitions. [2025-03-16 14:51:33,934 INFO L78 Accepts]: Start accepts. Automaton has 23054 states and 25208 transitions. Word has length 1160 [2025-03-16 14:51:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:33,935 INFO L471 AbstractCegarLoop]: Abstraction has 23054 states and 25208 transitions. [2025-03-16 14:51:33,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 23054 states and 25208 transitions. [2025-03-16 14:51:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2025-03-16 14:51:33,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:33,953 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:51:33,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 14:51:33,954 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1517820431, now seen corresponding path program 1 times [2025-03-16 14:51:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:33,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656472474] [2025-03-16 14:51:33,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:34,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1179 statements into 1 equivalence classes. [2025-03-16 14:51:34,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1179 of 1179 statements. [2025-03-16 14:51:34,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 1679 proven. 0 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-16 14:51:34,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656472474] [2025-03-16 14:51:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656472474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:34,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:51:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344641265] [2025-03-16 14:51:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:34,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:34,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:34,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:34,287 INFO L87 Difference]: Start difference. First operand 23054 states and 25208 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:34,564 INFO L93 Difference]: Finished difference Result 43712 states and 47811 transitions. [2025-03-16 14:51:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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 1179 [2025-03-16 14:51:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:34,585 INFO L225 Difference]: With dead ends: 43712 [2025-03-16 14:51:34,585 INFO L226 Difference]: Without dead ends: 22869 [2025-03-16 14:51:34,598 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-16 14:51:34,598 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:34,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 31 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:51:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22869 states. [2025-03-16 14:51:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22869 to 22869. [2025-03-16 14:51:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22869 states, 22868 states have (on average 1.0934056323246457) internal successors, (25004), 22868 states have internal predecessors, (25004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22869 states to 22869 states and 25004 transitions. [2025-03-16 14:51:34,790 INFO L78 Accepts]: Start accepts. Automaton has 22869 states and 25004 transitions. Word has length 1179 [2025-03-16 14:51:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:34,790 INFO L471 AbstractCegarLoop]: Abstraction has 22869 states and 25004 transitions. [2025-03-16 14:51:34,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 22869 states and 25004 transitions. [2025-03-16 14:51:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2025-03-16 14:51:34,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:34,808 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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-16 14:51:34,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 14:51:34,808 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:34,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1612870617, now seen corresponding path program 1 times [2025-03-16 14:51:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:34,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249931835] [2025-03-16 14:51:34,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:34,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1195 statements into 1 equivalence classes. [2025-03-16 14:51:34,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1195 of 1195 statements. [2025-03-16 14:51:34,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:34,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4251 backedges. 2680 proven. 0 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [2025-03-16 14:51:35,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249931835] [2025-03-16 14:51:35,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249931835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:35,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:35,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:51:35,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161135233] [2025-03-16 14:51:35,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:35,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:51:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:35,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:51:35,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:51:35,401 INFO L87 Difference]: Start difference. First operand 22869 states and 25004 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:35,905 INFO L93 Difference]: Finished difference Result 49420 states and 53987 transitions. [2025-03-16 14:51:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:51:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 1195 [2025-03-16 14:51:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:35,931 INFO L225 Difference]: With dead ends: 49420 [2025-03-16 14:51:35,931 INFO L226 Difference]: Without dead ends: 26920 [2025-03-16 14:51:35,946 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-16 14:51:35,946 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 107 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:35,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 64 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:51:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26920 states. [2025-03-16 14:51:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26920 to 23053. [2025-03-16 14:51:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23053 states, 23052 states have (on average 1.092703453062641) internal successors, (25189), 23052 states have internal predecessors, (25189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23053 states to 23053 states and 25189 transitions. [2025-03-16 14:51:36,154 INFO L78 Accepts]: Start accepts. Automaton has 23053 states and 25189 transitions. Word has length 1195 [2025-03-16 14:51:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:36,154 INFO L471 AbstractCegarLoop]: Abstraction has 23053 states and 25189 transitions. [2025-03-16 14:51:36,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 23053 states and 25189 transitions. [2025-03-16 14:51:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1257 [2025-03-16 14:51:36,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:51:36,173 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 14:51:36,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 14:51:36,173 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:51:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:51:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2058454279, now seen corresponding path program 1 times [2025-03-16 14:51:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:51:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062038595] [2025-03-16 14:51:36,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:51:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:51:36,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1256 statements into 1 equivalence classes. [2025-03-16 14:51:36,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1256 of 1256 statements. [2025-03-16 14:51:36,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:51:36,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:51:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5780 backedges. 2988 proven. 0 refuted. 0 times theorem prover too weak. 2792 trivial. 0 not checked. [2025-03-16 14:51:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:51:37,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062038595] [2025-03-16 14:51:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062038595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:51:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:51:37,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:51:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237975634] [2025-03-16 14:51:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:51:37,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:51:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:51:37,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:51:37,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:51:37,233 INFO L87 Difference]: Start difference. First operand 23053 states and 25189 transitions. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:51:37,928 INFO L93 Difference]: Finished difference Result 42418 states and 46272 transitions. [2025-03-16 14:51:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:51:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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 1256 [2025-03-16 14:51:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:51:37,929 INFO L225 Difference]: With dead ends: 42418 [2025-03-16 14:51:37,929 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:51:37,943 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-16 14:51:37,943 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 180 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:51:37,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 41 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:51:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:51:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:51:37,944 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-16 14:51:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:51:37,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1256 [2025-03-16 14:51:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:51:37,944 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:51:37,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:51:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:51:37,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:51:37,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:51:37,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 14:51:37,949 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] [2025-03-16 14:51:37,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:51:47,335 WARN L286 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 593 DAG size of output: 757 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-16 14:51:49,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:51:49,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:51:49 BoogieIcfgContainer [2025-03-16 14:51:49,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:51:49,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:51:49,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:51:49,756 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:51:49,757 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:51:02" (3/4) ... [2025-03-16 14:51:49,759 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:51:49,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:51:49,778 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:51:49,779 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:51:49,779 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:51:49,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:51:49,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:51:49,906 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:51:49,908 INFO L158 Benchmark]: Toolchain (without parser) took 49234.57ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 109.7MB in the beginning and 212.5MB in the end (delta: -102.8MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2025-03-16 14:51:49,908 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:51:49,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.75ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 65.7MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:51:49,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.13ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 49.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:51:49,909 INFO L158 Benchmark]: Boogie Preprocessor took 169.38ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 87.4MB in the end (delta: -38.6MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-03-16 14:51:49,909 INFO L158 Benchmark]: IcfgBuilder took 1217.65ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 48.3MB in the end (delta: 39.1MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-16 14:51:49,909 INFO L158 Benchmark]: TraceAbstraction took 47099.08ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 47.4MB in the beginning and 229.1MB in the end (delta: -181.8MB). Peak memory consumption was 989.0MB. Max. memory is 16.1GB. [2025-03-16 14:51:49,910 INFO L158 Benchmark]: Witness Printer took 149.97ms. Allocated memory is still 369.1MB. Free memory was 229.1MB in the beginning and 212.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:51:49,910 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.32ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.75ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 65.7MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.13ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 49.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 169.38ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 87.4MB in the end (delta: -38.6MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1217.65ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 48.3MB in the end (delta: 39.1MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * TraceAbstraction took 47099.08ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 47.4MB in the beginning and 229.1MB in the end (delta: -181.8MB). Peak memory consumption was 989.0MB. Max. memory is 16.1GB. * Witness Printer took 149.97ms. Allocated memory is still 369.1MB. Free memory was 229.1MB in the beginning and 212.5MB in the end (delta: 16.6MB). 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: 133]: 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, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 28, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3915 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3915 mSDsluCounter, 4877 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 517 mSDsCounter, 2709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17206 IncrementalHoareTripleChecker+Invalid, 19915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2709 mSolverCounterUnsat, 4360 mSDtfsCounter, 17206 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4023 GetRequests, 3970 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23054occurred in iteration=25, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 29569 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 19435 NumberOfCodeBlocks, 19435 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 20377 ConstructedInterpolants, 0 QuantifiedInterpolants, 49046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3818 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 33 InterpolantComputations, 28 PerfectInterpolantSequences, 54631/55665 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: (((((((((((((((((((((((((((((a29 <= 140) && (a3 == 1)) && (a8 == 15)) && (a25 == 10)) || (((((a8 <= 15) && (a4 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (a29 <= 130))) || (((((((a23 <= 600177) && (a25 == 11)) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))) || (((((((a25 == 10) && (a29 <= 130)) || ((a25 == 12) && (a29 <= 130))) && (a8 <= 15)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 137))) || (((a3 == 1) && (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 274)) && (246 <= a29)) || ((((((long long) a23 + 43) <= 0) && (a29 <= 310110)) && (a25 <= 9)) && (246 <= a29)))) && (a8 == 15))) || ((((((a25 == 12) && (a23 <= 600177)) && (a29 <= 274)) && (a3 == 1)) && (312 <= a23)) && (a8 == 15))) || (((((a23 <= 600177) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a4 != 1)) && (a8 == 15))) || ((((((a25 == 11) && (a29 <= 599998)) && (a3 == 1)) && (((long long) 119992 + a23) <= 0)) && (a8 == 15)) && (246 <= a29))) || (((((((a25 == 12) && (139 <= a23)) && (a29 <= 310110)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a8 <= 15)) && (((a25 <= 10) && (a29 <= 130)) || ((a25 == 12) && (a29 <= 130)))) && (a4 == 1))) || ((((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a4 != 1)) && (a8 == 15))) || ((((((a25 == 11) && (a29 <= 274)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29))) || ((((((a25 == 11) && (a8 <= 15)) && (a3 == 1)) && (a4 == 1)) && (246 <= a29)) && (a23 <= 137))) || (((((a25 == 12) && (139 <= a23)) && (a3 == 1)) && (a29 <= 220)) && (a8 == 15))) || ((((((a25 == 12) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((a23 <= 600177) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || (((((a29 <= 140) && (a3 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (a8 == 15))) || ((((((a25 == 12) && (a29 <= 599998)) && (a3 == 1)) && (a4 != 1)) && (a8 == 15)) && (a23 <= 137))) || ((((((a25 == 11) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29))) || (((((a25 == 13) && (a3 == 1)) && (a8 == 15)) && (((long long) 59274 + a29) <= 0)) && (a23 <= 137))) || ((((((a25 == 13) && (139 <= a23)) && (a29 <= 310110)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 13) && (a29 <= 274)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a25 <= 10) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 11) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:51:49,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE