./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label19.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/Problem16_label19.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 9b09a0fefbe5958e3921329b980c8e1375b708e4803fba0d8e1dfc742c64b031 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:13:01,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:13:01,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:13:01,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:13:01,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:13:01,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:13:01,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:13:01,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:13:01,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:13:01,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:13:01,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:13:01,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:13:01,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:13:01,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:13:01,622 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:13:01,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:13:01,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:13:01,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:13:01,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:13:01,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:13:01,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:13:01,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:13:01,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:13:01,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:13:01,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:13:01,625 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 -> 9b09a0fefbe5958e3921329b980c8e1375b708e4803fba0d8e1dfc742c64b031 [2025-03-16 15:13:01,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:13:01,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:13:01,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:13:01,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:13:01,895 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:13:01,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label19.c [2025-03-16 15:13:03,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40333d300/2c788c6eafe645b390aa15b330031d6a/FLAGb26254044 [2025-03-16 15:13:03,376 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:13:03,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label19.c [2025-03-16 15:13:03,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40333d300/2c788c6eafe645b390aa15b330031d6a/FLAGb26254044 [2025-03-16 15:13:03,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40333d300/2c788c6eafe645b390aa15b330031d6a [2025-03-16 15:13:03,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:13:03,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:13:03,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:13:03,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:13:03,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:13:03,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:13:03" (1/1) ... [2025-03-16 15:13:03,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379d2a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:03, skipping insertion in model container [2025-03-16 15:13:03,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:13:03" (1/1) ... [2025-03-16 15:13:03,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:13:03,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label19.c[4623,4636] [2025-03-16 15:13:04,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:13:04,127 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:13:04,137 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/Problem16_label19.c[4623,4636] [2025-03-16 15:13:04,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:13:04,254 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:13:04,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04 WrapperNode [2025-03-16 15:13:04,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:13:04,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:13:04,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:13:04,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:13:04,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,401 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:13:04,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:13:04,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:13:04,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:13:04,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:13:04,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,475 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 15:13:04,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:13:04,549 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:13:04,549 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:13:04,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:13:04,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (1/1) ... [2025-03-16 15:13:04,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:13:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:04,577 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 15:13:04,580 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 15:13:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:13:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:13:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:13:04,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:13:04,643 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:13:04,644 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:13:06,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:13:06,391 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:13:06,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:13:06,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:13:06,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:13:06,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:13:06 BoogieIcfgContainer [2025-03-16 15:13:06,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:13:06,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:13:06,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:13:06,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:13:06,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:13:03" (1/3) ... [2025-03-16 15:13:06,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6a54fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:13:06, skipping insertion in model container [2025-03-16 15:13:06,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:13:04" (2/3) ... [2025-03-16 15:13:06,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6a54fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:13:06, skipping insertion in model container [2025-03-16 15:13:06,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:13:06" (3/3) ... [2025-03-16 15:13:06,414 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label19.c [2025-03-16 15:13:06,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:13:06,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label19.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:13:06,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:13:06,551 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;@57af80d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:13:06,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:13:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 15:13:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 15:13:06,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:06,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:06,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1538053196, now seen corresponding path program 1 times [2025-03-16 15:13:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:06,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66674032] [2025-03-16 15:13:06,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:06,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 15:13:06,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 15:13:06,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:06,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:06,691 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 15:13:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66674032] [2025-03-16 15:13:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66674032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:06,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:06,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178250394] [2025-03-16 15:13:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:13:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:06,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:13:06,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:13:06,715 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 15:13:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:06,750 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:13:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:13:06,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-16 15:13:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:06,763 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:13:06,764 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:13:06,768 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 15:13:06,771 INFO L435 NwaCegarLoop]: 599 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, 599 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 15:13:06,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:13:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:13:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:13:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 15:13:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:13:06,815 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 42 [2025-03-16 15:13:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:06,815 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:13:06,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 15:13:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:13:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 15:13:06,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:06,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:06,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:13:06,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:06,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1660308789, now seen corresponding path program 1 times [2025-03-16 15:13:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420996943] [2025-03-16 15:13:06,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:06,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 15:13:06,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 15:13:06,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:06,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:07,078 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 15:13:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:07,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420996943] [2025-03-16 15:13:07,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420996943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:07,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:07,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:07,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276294092] [2025-03-16 15:13:07,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:07,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:07,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:07,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:07,083 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 15:13:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:08,956 INFO L93 Difference]: Finished difference Result 1321 states and 2379 transitions. [2025-03-16 15:13:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:13:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-16 15:13:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:08,960 INFO L225 Difference]: With dead ends: 1321 [2025-03-16 15:13:08,960 INFO L226 Difference]: Without dead ends: 990 [2025-03-16 15:13:08,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:08,961 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1014 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:08,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 67 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:13:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-16 15:13:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-03-16 15:13:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4984833164812943) internal successors, (1482), 989 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states 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 15:13:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1482 transitions. [2025-03-16 15:13:09,009 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1482 transitions. Word has length 42 [2025-03-16 15:13:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:09,009 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1482 transitions. [2025-03-16 15:13:09,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 15:13:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1482 transitions. [2025-03-16 15:13:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 15:13:09,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:09,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 15:13:09,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:13:09,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:09,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash 580575453, now seen corresponding path program 1 times [2025-03-16 15:13:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:09,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526540261] [2025-03-16 15:13:09,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:09,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:09,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 15:13:09,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 15:13:09,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:09,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 15:13:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526540261] [2025-03-16 15:13:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526540261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137603623] [2025-03-16 15:13:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:09,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:09,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:09,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:09,352 INFO L87 Difference]: Start difference. First operand 990 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 15:13:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:10,446 INFO L93 Difference]: Finished difference Result 2308 states and 3761 transitions. [2025-03-16 15:13:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 232 [2025-03-16 15:13:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:10,453 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 15:13:10,453 INFO L226 Difference]: Without dead ends: 1648 [2025-03-16 15:13:10,455 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 15:13:10,456 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:10,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 154 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:13:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-16 15:13:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-16 15:13:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.445658773527626) internal successors, (2381), 1647 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states 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 15:13:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2381 transitions. [2025-03-16 15:13:10,503 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2381 transitions. Word has length 232 [2025-03-16 15:13:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:10,504 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2381 transitions. [2025-03-16 15:13:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 15:13:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2381 transitions. [2025-03-16 15:13:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-16 15:13:10,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:10,513 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:10,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:13:10,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:10,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1441325069, now seen corresponding path program 1 times [2025-03-16 15:13:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:10,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265643543] [2025-03-16 15:13:10,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:10,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-16 15:13:10,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-16 15:13:10,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:10,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-16 15:13:10,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:10,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265643543] [2025-03-16 15:13:10,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265643543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:10,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693205910] [2025-03-16 15:13:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:10,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:10,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:10,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:10,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:10,839 INFO L87 Difference]: Start difference. First operand 1648 states and 2381 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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 15:13:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:11,830 INFO L93 Difference]: Finished difference Result 3624 states and 5414 transitions. [2025-03-16 15:13:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2025-03-16 15:13:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:11,836 INFO L225 Difference]: With dead ends: 3624 [2025-03-16 15:13:11,836 INFO L226 Difference]: Without dead ends: 1977 [2025-03-16 15:13:11,838 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 15:13:11,839 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 271 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:11,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 537 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:13:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-03-16 15:13:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2025-03-16 15:13:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.1336032388663968) internal successors, (2240), 1976 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states 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 15:13:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2240 transitions. [2025-03-16 15:13:11,868 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2240 transitions. Word has length 343 [2025-03-16 15:13:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:11,868 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2240 transitions. [2025-03-16 15:13:11,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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 15:13:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2240 transitions. [2025-03-16 15:13:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 15:13:11,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:11,872 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:11,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:13:11,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:11,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash 127323143, now seen corresponding path program 1 times [2025-03-16 15:13:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143961030] [2025-03-16 15:13:11,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:11,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 15:13:11,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 15:13:11,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:11,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 15:13:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143961030] [2025-03-16 15:13:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143961030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:13:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876305179] [2025-03-16 15:13:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:12,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:12,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:12,068 INFO L87 Difference]: Start difference. First operand 1977 states and 2240 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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 15:13:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:12,715 INFO L93 Difference]: Finished difference Result 3953 states and 4507 transitions. [2025-03-16 15:13:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 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 361 [2025-03-16 15:13:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:12,721 INFO L225 Difference]: With dead ends: 3953 [2025-03-16 15:13:12,721 INFO L226 Difference]: Without dead ends: 2306 [2025-03-16 15:13:12,723 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 15:13:12,724 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 262 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:12,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 30 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-16 15:13:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2025-03-16 15:13:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.0928416485900216) internal successors, (2519), 2305 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states 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 15:13:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 2519 transitions. [2025-03-16 15:13:12,754 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 2519 transitions. Word has length 361 [2025-03-16 15:13:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:12,754 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 2519 transitions. [2025-03-16 15:13:12,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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 15:13:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2519 transitions. [2025-03-16 15:13:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2025-03-16 15:13:12,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:12,761 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:12,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:13:12,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:12,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 865886851, now seen corresponding path program 1 times [2025-03-16 15:13:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831047915] [2025-03-16 15:13:12,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:12,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-03-16 15:13:12,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-03-16 15:13:12,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:12,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 15:13:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831047915] [2025-03-16 15:13:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831047915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756737682] [2025-03-16 15:13:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:13,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:13,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:13,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:13,571 INFO L87 Difference]: Start difference. First operand 2306 states and 2519 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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 15:13:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:14,254 INFO L93 Difference]: Finished difference Result 4611 states and 5049 transitions. [2025-03-16 15:13:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:14,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 619 [2025-03-16 15:13:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:14,261 INFO L225 Difference]: With dead ends: 4611 [2025-03-16 15:13:14,261 INFO L226 Difference]: Without dead ends: 2635 [2025-03-16 15:13:14,263 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 15:13:14,263 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:14,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 104 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:13:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-03-16 15:13:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2025-03-16 15:13:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.0827638572513287) internal successors, (2852), 2634 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states 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 15:13:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2852 transitions. [2025-03-16 15:13:14,294 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2852 transitions. Word has length 619 [2025-03-16 15:13:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:14,294 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 2852 transitions. [2025-03-16 15:13:14,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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 15:13:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2852 transitions. [2025-03-16 15:13:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-03-16 15:13:14,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:14,305 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:14,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:13:14,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:14,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash 548951575, now seen corresponding path program 1 times [2025-03-16 15:13:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465815439] [2025-03-16 15:13:14,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-03-16 15:13:14,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-03-16 15:13:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-16 15:13:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:14,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465815439] [2025-03-16 15:13:14,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465815439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:14,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:14,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863746644] [2025-03-16 15:13:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:14,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:14,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:14,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:14,610 INFO L87 Difference]: Start difference. First operand 2635 states and 2852 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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 15:13:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:15,288 INFO L93 Difference]: Finished difference Result 6256 states and 6841 transitions. [2025-03-16 15:13:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:15,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 627 [2025-03-16 15:13:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:15,300 INFO L225 Difference]: With dead ends: 6256 [2025-03-16 15:13:15,300 INFO L226 Difference]: Without dead ends: 4280 [2025-03-16 15:13:15,302 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 15:13:15,302 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 236 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:15,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 35 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2025-03-16 15:13:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2025-03-16 15:13:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.0775882215470904) internal successors, (4611), 4279 states have internal predecessors, (4611), 0 states have call successors, (0), 0 states 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 15:13:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 4611 transitions. [2025-03-16 15:13:15,350 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 4611 transitions. Word has length 627 [2025-03-16 15:13:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:15,351 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 4611 transitions. [2025-03-16 15:13:15,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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 15:13:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 4611 transitions. [2025-03-16 15:13:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2025-03-16 15:13:15,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:15,357 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:15,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:13:15,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:15,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1929766872, now seen corresponding path program 1 times [2025-03-16 15:13:15,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:15,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436383658] [2025-03-16 15:13:15,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:15,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 920 statements into 1 equivalence classes. [2025-03-16 15:13:15,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 920 of 920 statements. [2025-03-16 15:13:15,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:15,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 917 proven. 214 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2025-03-16 15:13:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436383658] [2025-03-16 15:13:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436383658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551492860] [2025-03-16 15:13:16,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:16,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:16,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:16,249 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 15:13:16,251 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 15:13:16,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 920 statements into 1 equivalence classes. [2025-03-16 15:13:16,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 920 of 920 statements. [2025-03-16 15:13:16,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:16,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:16,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:16,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-03-16 15:13:17,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551492860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:17,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:17,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 15:13:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648362442] [2025-03-16 15:13:17,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:17,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:17,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:17,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:17,020 INFO L87 Difference]: Start difference. First operand 4280 states and 4611 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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 15:13:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:17,694 INFO L93 Difference]: Finished difference Result 9875 states and 10700 transitions. [2025-03-16 15:13:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:17,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 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 920 [2025-03-16 15:13:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:17,712 INFO L225 Difference]: With dead ends: 9875 [2025-03-16 15:13:17,712 INFO L226 Difference]: Without dead ends: 6254 [2025-03-16 15:13:17,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:17,717 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 93 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:17,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 85 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2025-03-16 15:13:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6254. [2025-03-16 15:13:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.0666879897649129) internal successors, (6670), 6253 states have internal predecessors, (6670), 0 states have call successors, (0), 0 states 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 15:13:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6670 transitions. [2025-03-16 15:13:17,810 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6670 transitions. Word has length 920 [2025-03-16 15:13:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:17,811 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6670 transitions. [2025-03-16 15:13:17,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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 15:13:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6670 transitions. [2025-03-16 15:13:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-03-16 15:13:17,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:17,825 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:17,832 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 15:13:18,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:18,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:18,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:18,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1436192643, now seen corresponding path program 1 times [2025-03-16 15:13:18,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:18,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539135260] [2025-03-16 15:13:18,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:18,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:18,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 950 statements into 1 equivalence classes. [2025-03-16 15:13:18,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 950 of 950 statements. [2025-03-16 15:13:18,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:18,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1841 backedges. 1282 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-16 15:13:18,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:18,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539135260] [2025-03-16 15:13:18,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539135260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:18,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:18,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:18,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536728176] [2025-03-16 15:13:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:18,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:18,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:18,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:18,580 INFO L87 Difference]: Start difference. First operand 6254 states and 6670 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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 15:13:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:19,323 INFO L93 Difference]: Finished difference Result 13494 states and 14477 transitions. [2025-03-16 15:13:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:19,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 950 [2025-03-16 15:13:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:19,341 INFO L225 Difference]: With dead ends: 13494 [2025-03-16 15:13:19,343 INFO L226 Difference]: Without dead ends: 7899 [2025-03-16 15:13:19,348 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 15:13:19,348 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:19,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 426 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:13:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2025-03-16 15:13:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 7570. [2025-03-16 15:13:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7570 states, 7569 states have (on average 1.0585282071607873) internal successors, (8012), 7569 states have internal predecessors, (8012), 0 states have call successors, (0), 0 states 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 15:13:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 8012 transitions. [2025-03-16 15:13:19,432 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 8012 transitions. Word has length 950 [2025-03-16 15:13:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:19,433 INFO L471 AbstractCegarLoop]: Abstraction has 7570 states and 8012 transitions. [2025-03-16 15:13:19,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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 15:13:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 8012 transitions. [2025-03-16 15:13:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2025-03-16 15:13:19,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:19,442 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:19,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:13:19,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:19,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 718670335, now seen corresponding path program 1 times [2025-03-16 15:13:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039286145] [2025-03-16 15:13:19,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:19,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 951 statements into 1 equivalence classes. [2025-03-16 15:13:19,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 951 of 951 statements. [2025-03-16 15:13:19,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:19,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 1145 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-03-16 15:13:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:20,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039286145] [2025-03-16 15:13:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039286145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:20,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237139977] [2025-03-16 15:13:20,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:20,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:20,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:20,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:20,149 INFO L87 Difference]: Start difference. First operand 7570 states and 8012 transitions. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:20,711 INFO L93 Difference]: Finished difference Result 15797 states and 16783 transitions. [2025-03-16 15:13:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:20,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 951 [2025-03-16 15:13:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:20,725 INFO L225 Difference]: With dead ends: 15797 [2025-03-16 15:13:20,725 INFO L226 Difference]: Without dead ends: 8886 [2025-03-16 15:13:20,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 15:13:20,731 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 204 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:20,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 51 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2025-03-16 15:13:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 8886. [2025-03-16 15:13:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8886 states, 8885 states have (on average 1.0552616769836805) internal successors, (9376), 8885 states have internal predecessors, (9376), 0 states have call successors, (0), 0 states 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 15:13:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 9376 transitions. [2025-03-16 15:13:20,812 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 9376 transitions. Word has length 951 [2025-03-16 15:13:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:20,813 INFO L471 AbstractCegarLoop]: Abstraction has 8886 states and 9376 transitions. [2025-03-16 15:13:20,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 9376 transitions. [2025-03-16 15:13:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2025-03-16 15:13:20,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:20,823 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:20,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:13:20,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:20,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash 478898996, now seen corresponding path program 1 times [2025-03-16 15:13:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197452234] [2025-03-16 15:13:20,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:20,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 976 statements into 1 equivalence classes. [2025-03-16 15:13:20,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 976 of 976 statements. [2025-03-16 15:13:20,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:20,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 827 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-03-16 15:13:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197452234] [2025-03-16 15:13:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197452234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:21,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:21,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141234433] [2025-03-16 15:13:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:21,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:21,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:21,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:21,638 INFO L87 Difference]: Start difference. First operand 8886 states and 9376 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 15:13:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:22,204 INFO L93 Difference]: Finished difference Result 17113 states and 18087 transitions. [2025-03-16 15:13:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:22,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 976 [2025-03-16 15:13:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:22,218 INFO L225 Difference]: With dead ends: 17113 [2025-03-16 15:13:22,218 INFO L226 Difference]: Without dead ends: 8886 [2025-03-16 15:13:22,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 15:13:22,225 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 95 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:22,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 375 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2025-03-16 15:13:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 8886. [2025-03-16 15:13:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8886 states, 8885 states have (on average 1.0485087225661227) internal successors, (9316), 8885 states have internal predecessors, (9316), 0 states have call successors, (0), 0 states 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 15:13:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 9316 transitions. [2025-03-16 15:13:22,299 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 9316 transitions. Word has length 976 [2025-03-16 15:13:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:22,299 INFO L471 AbstractCegarLoop]: Abstraction has 8886 states and 9316 transitions. [2025-03-16 15:13:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 15:13:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 9316 transitions. [2025-03-16 15:13:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2025-03-16 15:13:22,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:22,311 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:13:22,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:13:22,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:22,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1876922090, now seen corresponding path program 1 times [2025-03-16 15:13:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901775691] [2025-03-16 15:13:22,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:22,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes. [2025-03-16 15:13:22,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements. [2025-03-16 15:13:22,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:22,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2046 backedges. 1345 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-03-16 15:13:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901775691] [2025-03-16 15:13:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901775691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:23,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:13:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187768101] [2025-03-16 15:13:23,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:23,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:13:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:23,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:13:23,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:23,171 INFO L87 Difference]: Start difference. First operand 8886 states and 9316 transitions. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 15:13:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:23,999 INFO L93 Difference]: Finished difference Result 17114 states and 17968 transitions. [2025-03-16 15:13:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:13:23,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 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 1079 [2025-03-16 15:13:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:24,013 INFO L225 Difference]: With dead ends: 17114 [2025-03-16 15:13:24,013 INFO L226 Difference]: Without dead ends: 8887 [2025-03-16 15:13:24,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:24,021 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 357 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:24,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 561 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:13:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-16 15:13:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8886. [2025-03-16 15:13:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8886 states, 8885 states have (on average 1.0477208778840743) internal successors, (9309), 8885 states have internal predecessors, (9309), 0 states have call successors, (0), 0 states 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 15:13:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 9309 transitions. [2025-03-16 15:13:24,084 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 9309 transitions. Word has length 1079 [2025-03-16 15:13:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:24,085 INFO L471 AbstractCegarLoop]: Abstraction has 8886 states and 9309 transitions. [2025-03-16 15:13:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 15:13:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 9309 transitions. [2025-03-16 15:13:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1083 [2025-03-16 15:13:24,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:24,095 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:13:24,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:13:24,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:24,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1245079845, now seen corresponding path program 1 times [2025-03-16 15:13:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416137149] [2025-03-16 15:13:24,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:24,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1082 statements into 1 equivalence classes. [2025-03-16 15:13:24,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1082 of 1082 statements. [2025-03-16 15:13:24,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:24,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2546 backedges. 1312 proven. 0 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2025-03-16 15:13:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416137149] [2025-03-16 15:13:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416137149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:24,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:24,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258859057] [2025-03-16 15:13:24,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:24,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:24,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:24,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:24,933 INFO L87 Difference]: Start difference. First operand 8886 states and 9309 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 15:13:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:25,494 INFO L93 Difference]: Finished difference Result 18100 states and 18955 transitions. [2025-03-16 15:13:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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 1082 [2025-03-16 15:13:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:25,508 INFO L225 Difference]: With dead ends: 18100 [2025-03-16 15:13:25,509 INFO L226 Difference]: Without dead ends: 9873 [2025-03-16 15:13:25,515 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 15:13:25,515 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:25,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 436 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9873 states. [2025-03-16 15:13:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9873 to 9873. [2025-03-16 15:13:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9873 states, 9872 states have (on average 1.043658833063209) internal successors, (10303), 9872 states have internal predecessors, (10303), 0 states have call successors, (0), 0 states 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 15:13:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 10303 transitions. [2025-03-16 15:13:25,583 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 10303 transitions. Word has length 1082 [2025-03-16 15:13:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:25,583 INFO L471 AbstractCegarLoop]: Abstraction has 9873 states and 10303 transitions. [2025-03-16 15:13:25,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 15:13:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 10303 transitions. [2025-03-16 15:13:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2025-03-16 15:13:25,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:25,594 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 15:13:25,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:13:25,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:25,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1012288833, now seen corresponding path program 1 times [2025-03-16 15:13:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:25,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860836916] [2025-03-16 15:13:25,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:25,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:25,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1093 statements into 1 equivalence classes. [2025-03-16 15:13:25,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1093 of 1093 statements. [2025-03-16 15:13:25,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:25,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-16 15:13:26,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:26,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860836916] [2025-03-16 15:13:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860836916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790950420] [2025-03-16 15:13:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:26,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:26,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:26,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:26,472 INFO L87 Difference]: Start difference. First operand 9873 states and 10303 transitions. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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 15:13:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:27,158 INFO L93 Difference]: Finished difference Result 19094 states and 19948 transitions. [2025-03-16 15:13:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:13:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 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 1093 [2025-03-16 15:13:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:27,173 INFO L225 Difference]: With dead ends: 19094 [2025-03-16 15:13:27,173 INFO L226 Difference]: Without dead ends: 9880 [2025-03-16 15:13:27,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:27,181 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:27,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 441 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9880 states. [2025-03-16 15:13:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9880 to 9873. [2025-03-16 15:13:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9873 states, 9872 states have (on average 1.0434562398703404) internal successors, (10301), 9872 states have internal predecessors, (10301), 0 states have call successors, (0), 0 states 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 15:13:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 10301 transitions. [2025-03-16 15:13:27,252 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 10301 transitions. Word has length 1093 [2025-03-16 15:13:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:27,252 INFO L471 AbstractCegarLoop]: Abstraction has 9873 states and 10301 transitions. [2025-03-16 15:13:27,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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 15:13:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 10301 transitions. [2025-03-16 15:13:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1101 [2025-03-16 15:13:27,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:27,263 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:27,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:13:27,263 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:27,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1079706988, now seen corresponding path program 1 times [2025-03-16 15:13:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449299903] [2025-03-16 15:13:27,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:27,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1100 statements into 1 equivalence classes. [2025-03-16 15:13:27,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1100 of 1100 statements. [2025-03-16 15:13:27,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:27,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 866 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2025-03-16 15:13:27,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:27,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449299903] [2025-03-16 15:13:27,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449299903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:27,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:27,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775400865] [2025-03-16 15:13:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:27,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:27,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:27,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:27,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:27,697 INFO L87 Difference]: Start difference. First operand 9873 states and 10301 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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 15:13:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:28,244 INFO L93 Difference]: Finished difference Result 19745 states and 20599 transitions. [2025-03-16 15:13:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:28,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 1100 [2025-03-16 15:13:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:28,255 INFO L225 Difference]: With dead ends: 19745 [2025-03-16 15:13:28,255 INFO L226 Difference]: Without dead ends: 9873 [2025-03-16 15:13:28,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 15:13:28,266 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 240 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:28,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 408 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9873 states. [2025-03-16 15:13:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9873 to 9215. [2025-03-16 15:13:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0341871065769481) internal successors, (9529), 9214 states have internal predecessors, (9529), 0 states have call successors, (0), 0 states 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 15:13:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9529 transitions. [2025-03-16 15:13:28,329 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9529 transitions. Word has length 1100 [2025-03-16 15:13:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:28,329 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9529 transitions. [2025-03-16 15:13:28,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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 15:13:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9529 transitions. [2025-03-16 15:13:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1212 [2025-03-16 15:13:28,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:28,341 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:28,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:13:28,341 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:28,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash -419277421, now seen corresponding path program 1 times [2025-03-16 15:13:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040112014] [2025-03-16 15:13:28,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:28,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1211 statements into 1 equivalence classes. [2025-03-16 15:13:28,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1211 of 1211 statements. [2025-03-16 15:13:28,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:28,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 2587 trivial. 0 not checked. [2025-03-16 15:13:28,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:28,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040112014] [2025-03-16 15:13:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040112014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:28,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876103895] [2025-03-16 15:13:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:28,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:28,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:28,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:28,908 INFO L87 Difference]: Start difference. First operand 9215 states and 9529 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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 15:13:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:30,005 INFO L93 Difference]: Finished difference Result 22385 states and 23209 transitions. [2025-03-16 15:13:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:13:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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 1211 [2025-03-16 15:13:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:30,007 INFO L225 Difference]: With dead ends: 22385 [2025-03-16 15:13:30,007 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:13:30,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:30,016 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 623 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:30,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 39 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:13:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:13:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:13:30,017 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 15:13:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:13:30,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1211 [2025-03-16 15:13:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:30,017 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:13:30,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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 15:13:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:13:30,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:13:30,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:13:30,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:13:30,022 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:30,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:13:30,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:13:30,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:13:30 BoogieIcfgContainer [2025-03-16 15:13:30,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:13:30,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:13:30,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:13:30,382 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:13:30,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:13:06" (3/4) ... [2025-03-16 15:13:30,383 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:13:30,406 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:13:30,408 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:13:30,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:13:30,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:13:30,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:13:30,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:13:30,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:13:30,553 INFO L158 Benchmark]: Toolchain (without parser) took 26900.77ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 108.6MB in the beginning and 1.1GB in the end (delta: -944.0MB). Peak memory consumption was 389.0MB. Max. memory is 16.1GB. [2025-03-16 15:13:30,553 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:13:30,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.61ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 50.7MB in the end (delta: 57.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 15:13:30,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 146.00ms. Allocated memory is still 142.6MB. Free memory was 50.7MB in the beginning and 89.7MB in the end (delta: -39.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-03-16 15:13:30,554 INFO L158 Benchmark]: Boogie Preprocessor took 146.43ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 57.5MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:13:30,555 INFO L158 Benchmark]: IcfgBuilder took 1853.87ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.5MB in the beginning and 150.7MB in the end (delta: -93.3MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2025-03-16 15:13:30,555 INFO L158 Benchmark]: TraceAbstraction took 23976.03ms. Allocated memory was 427.8MB in the beginning and 1.5GB in the end (delta: 1.0GB). Free memory was 150.7MB in the beginning and 1.1GB in the end (delta: -922.7MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2025-03-16 15:13:30,555 INFO L158 Benchmark]: Witness Printer took 169.94ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:13:30,558 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.61ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 50.7MB in the end (delta: 57.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 146.00ms. Allocated memory is still 142.6MB. Free memory was 50.7MB in the beginning and 89.7MB in the end (delta: -39.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.43ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 57.5MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1853.87ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 57.5MB in the beginning and 150.7MB in the end (delta: -93.3MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23976.03ms. Allocated memory was 427.8MB in the beginning and 1.5GB in the end (delta: 1.0GB). Free memory was 150.7MB in the beginning and 1.1GB in the end (delta: -922.7MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * Witness Printer took 169.94ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 146]: 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, 335 locations, 661 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4699 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4699 mSDsluCounter, 4348 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 2086 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14234 IncrementalHoareTripleChecker+Invalid, 16320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2086 mSolverCounterUnsat, 4134 mSDtfsCounter, 14234 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 953 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9873occurred in iteration=13, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 995 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 12548 NumberOfCodeBlocks, 12548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 12531 ConstructedInterpolants, 0 QuantifiedInterpolants, 27686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 23211/23425 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: 1783]: Location Invariant Derived location invariant: (((((((((((a12 <= 7) && (a16 != 9)) && (a16 <= 11)) || ((a16 <= 8) && (a12 == 8))) || ((a16 == 9) && (a15 != 3))) || ((a15 == 3) && (7 == a12))) || (((a12 != 6) && (a15 <= 3)) && (0 <= ((long long) a18 + 155)))) || (((a12 != 6) && (a15 <= 3)) && (a16 != 9))) || ((a16 <= 8) && (0 <= ((long long) a18 + 155)))) || ((a15 <= 3) && (a12 == 8))) || (((a15 <= 3) && (0 <= ((long long) a18 + 155))) && (a16 != 9))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:13:30,574 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