./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee9b5fdd674726fda67e17570bcafe668da2440128a5d9da4a9084c95b04c368 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:14:14,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:14:14,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:14:14,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:14:14,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:14:14,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:14:14,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:14:14,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:14:14,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:14:14,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:14:14,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:14:14,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:14:14,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:14:14,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:14:14,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:14:14,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:14:14,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:14:14,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:14:14,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:14:14,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:14:14,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:14:14,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:14:14,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:14:14,709 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 -> ee9b5fdd674726fda67e17570bcafe668da2440128a5d9da4a9084c95b04c368 [2025-03-08 02:14:14,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:14:14,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:14:14,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:14:14,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:14:14,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:14:14,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label11.c [2025-03-08 02:14:16,069 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919a01e17/c0bc818ad03247b293bee5495bc1bad5/FLAGc24dddf68 [2025-03-08 02:14:16,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:14:16,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label11.c [2025-03-08 02:14:16,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919a01e17/c0bc818ad03247b293bee5495bc1bad5/FLAGc24dddf68 [2025-03-08 02:14:16,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919a01e17/c0bc818ad03247b293bee5495bc1bad5 [2025-03-08 02:14:16,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:14:16,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:14:16,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:14:16,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:14:16,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:14:16,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:14:16" (1/1) ... [2025-03-08 02:14:16,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31498961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:16, skipping insertion in model container [2025-03-08 02:14:16,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:14:16" (1/1) ... [2025-03-08 02:14:16,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:14:16,631 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/Problem18_label11.c[4550,4563] [2025-03-08 02:14:16,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:14:16,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:14:17,004 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/Problem18_label11.c[4550,4563] [2025-03-08 02:14:17,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:14:17,206 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:14:17,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17 WrapperNode [2025-03-08 02:14:17,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:14:17,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:14:17,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:14:17,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:14:17,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,389 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-08 02:14:17,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:14:17,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:14:17,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:14:17,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:14:17,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,508 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:14:17,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:14:17,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:14:17,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:14:17,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:14:17,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (1/1) ... [2025-03-08 02:14:17,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:14:17,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:14:17,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:14:17,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:14:17,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:14:17,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:14:17,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:14:17,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:14:17,703 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:14:17,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:14:20,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-08 02:14:20,396 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-08 02:14:20,530 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-08 02:14:20,531 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:14:20,559 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:14:20,559 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:14:20,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:14:20 BoogieIcfgContainer [2025-03-08 02:14:20,560 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:14:20,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:14:20,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:14:20,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:14:20,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:14:16" (1/3) ... [2025-03-08 02:14:20,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6b7ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:14:20, skipping insertion in model container [2025-03-08 02:14:20,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:14:17" (2/3) ... [2025-03-08 02:14:20,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6b7ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:14:20, skipping insertion in model container [2025-03-08 02:14:20,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:14:20" (3/3) ... [2025-03-08 02:14:20,573 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label11.c [2025-03-08 02:14:20,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:14:20,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label11.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:14:20,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:14:20,664 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;@2240621f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:14:20,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:14:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 02:14:20,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:20,674 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-08 02:14:20,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:20,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash -372247608, now seen corresponding path program 1 times [2025-03-08 02:14:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:20,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500299836] [2025-03-08 02:14:20,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:20,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 02:14:20,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 02:14:20,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:14:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500299836] [2025-03-08 02:14:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500299836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:14:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132812938] [2025-03-08 02:14:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:20,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:20,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:20,943 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.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-08 02:14:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:23,390 INFO L93 Difference]: Finished difference Result 2221 states and 4279 transitions. [2025-03-08 02:14:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.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-08 02:14:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:23,403 INFO L225 Difference]: With dead ends: 2221 [2025-03-08 02:14:23,403 INFO L226 Difference]: Without dead ends: 1384 [2025-03-08 02:14:23,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:23,408 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 753 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:23,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 487 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:14:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-08 02:14:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-08 02:14:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.5994215473608098) internal successors, (2212), 1383 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2212 transitions. [2025-03-08 02:14:23,471 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2212 transitions. Word has length 42 [2025-03-08 02:14:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:23,471 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2212 transitions. [2025-03-08 02:14:23,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.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-08 02:14:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2212 transitions. [2025-03-08 02:14:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 02:14:23,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:23,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:23,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:14:23,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:23,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash -507243461, now seen corresponding path program 1 times [2025-03-08 02:14:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:23,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065840655] [2025-03-08 02:14:23,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:23,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:23,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 02:14:23,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 02:14:23,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:23,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:14:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:23,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065840655] [2025-03-08 02:14:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065840655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:14:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425257556] [2025-03-08 02:14:23,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:23,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:23,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:23,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:23,665 INFO L87 Difference]: Start difference. First operand 1384 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:25,787 INFO L93 Difference]: Finished difference Result 4146 states and 6631 transitions. [2025-03-08 02:14:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:25,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-08 02:14:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:25,799 INFO L225 Difference]: With dead ends: 4146 [2025-03-08 02:14:25,799 INFO L226 Difference]: Without dead ends: 2764 [2025-03-08 02:14:25,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:25,803 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:25,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 529 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:14:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-03-08 02:14:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-03-08 02:14:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.3503438291711907) internal successors, (3731), 2763 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3731 transitions. [2025-03-08 02:14:25,860 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3731 transitions. Word has length 107 [2025-03-08 02:14:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:25,862 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3731 transitions. [2025-03-08 02:14:25,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3731 transitions. [2025-03-08 02:14:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 02:14:25,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:25,871 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:25,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:14:25,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:25,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1655884809, now seen corresponding path program 1 times [2025-03-08 02:14:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:25,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301965662] [2025-03-08 02:14:25,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:25,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 02:14:25,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 02:14:25,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:25,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 02:14:26,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:26,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301965662] [2025-03-08 02:14:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301965662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:26,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:26,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122208371] [2025-03-08 02:14:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:26,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:14:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:26,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:14:26,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:14:26,419 INFO L87 Difference]: Start difference. First operand 2764 states and 3731 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:29,269 INFO L93 Difference]: Finished difference Result 7596 states and 9794 transitions. [2025-03-08 02:14:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:14:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 225 [2025-03-08 02:14:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:29,283 INFO L225 Difference]: With dead ends: 7596 [2025-03-08 02:14:29,283 INFO L226 Difference]: Without dead ends: 4834 [2025-03-08 02:14:29,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:14:29,286 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:29,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 02:14:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-03-08 02:14:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-03-08 02:14:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.2698527636978034) internal successors, (5261), 4143 states have internal predecessors, (5261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5261 transitions. [2025-03-08 02:14:29,339 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5261 transitions. Word has length 225 [2025-03-08 02:14:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:29,340 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5261 transitions. [2025-03-08 02:14:29,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5261 transitions. [2025-03-08 02:14:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-08 02:14:29,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:29,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:29,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:14:29,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:29,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1540286526, now seen corresponding path program 1 times [2025-03-08 02:14:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:29,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408624036] [2025-03-08 02:14:29,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:29,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 02:14:29,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 02:14:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:14:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408624036] [2025-03-08 02:14:29,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408624036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:14:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9617068] [2025-03-08 02:14:29,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:14:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:14:29,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:14:29,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:14:29,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 02:14:29,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 02:14:29,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:29,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:29,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:14:29,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:14:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 02:14:30,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:14:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9617068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:14:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 02:14:30,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729966431] [2025-03-08 02:14:30,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:30,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:30,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:14:30,188 INFO L87 Difference]: Start difference. First operand 4144 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 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-08 02:14:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:31,993 INFO L93 Difference]: Finished difference Result 12426 states and 15778 transitions. [2025-03-08 02:14:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 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 341 [2025-03-08 02:14:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:32,012 INFO L225 Difference]: With dead ends: 12426 [2025-03-08 02:14:32,012 INFO L226 Difference]: Without dead ends: 8284 [2025-03-08 02:14:32,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:14:32,018 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:32,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 550 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:14:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2025-03-08 02:14:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 6904. [2025-03-08 02:14:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.2358394900767782) internal successors, (8531), 6903 states have internal predecessors, (8531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8531 transitions. [2025-03-08 02:14:32,128 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8531 transitions. Word has length 341 [2025-03-08 02:14:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:32,129 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8531 transitions. [2025-03-08 02:14:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 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-08 02:14:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8531 transitions. [2025-03-08 02:14:32,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-08 02:14:32,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:32,133 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:32,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:14:32,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:14:32,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:32,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1820386259, now seen corresponding path program 1 times [2025-03-08 02:14:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464898260] [2025-03-08 02:14:32,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:32,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-08 02:14:32,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-08 02:14:32,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:32,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 02:14:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464898260] [2025-03-08 02:14:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464898260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14966649] [2025-03-08 02:14:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:14:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:32,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:14:32,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:14:32,649 INFO L87 Difference]: Start difference. First operand 6904 states and 8531 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:34,419 INFO L93 Difference]: Finished difference Result 15239 states and 18535 transitions. [2025-03-08 02:14:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:14:34,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 411 [2025-03-08 02:14:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:34,444 INFO L225 Difference]: With dead ends: 15239 [2025-03-08 02:14:34,444 INFO L226 Difference]: Without dead ends: 8284 [2025-03-08 02:14:34,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:14:34,451 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 513 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:34,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 640 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:14:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2025-03-08 02:14:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2025-03-08 02:14:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.154291923216226) internal successors, (9561), 8283 states have internal predecessors, (9561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9561 transitions. [2025-03-08 02:14:34,573 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9561 transitions. Word has length 411 [2025-03-08 02:14:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9561 transitions. [2025-03-08 02:14:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9561 transitions. [2025-03-08 02:14:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-08 02:14:34,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:34,581 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:34,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:14:34,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:34,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1194956435, now seen corresponding path program 1 times [2025-03-08 02:14:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033347543] [2025-03-08 02:14:34,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:34,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-08 02:14:34,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-08 02:14:34,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:34,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 02:14:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:34,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033347543] [2025-03-08 02:14:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033347543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:34,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:34,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:14:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796502572] [2025-03-08 02:14:34,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:34,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:34,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:34,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:34,880 INFO L87 Difference]: Start difference. First operand 8284 states and 9561 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 2 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:36,455 INFO L93 Difference]: Finished difference Result 20016 states and 22949 transitions. [2025-03-08 02:14:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 2 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 426 [2025-03-08 02:14:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:36,479 INFO L225 Difference]: With dead ends: 20016 [2025-03-08 02:14:36,479 INFO L226 Difference]: Without dead ends: 11734 [2025-03-08 02:14:36,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:36,485 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:36,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:14:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2025-03-08 02:14:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11734. [2025-03-08 02:14:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.119151112247507) internal successors, (13131), 11733 states have internal predecessors, (13131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13131 transitions. [2025-03-08 02:14:36,614 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13131 transitions. Word has length 426 [2025-03-08 02:14:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:36,616 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13131 transitions. [2025-03-08 02:14:36,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 2 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13131 transitions. [2025-03-08 02:14:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 02:14:36,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:36,620 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:36,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:14:36,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:36,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:36,621 INFO L85 PathProgramCache]: Analyzing trace with hash 889462015, now seen corresponding path program 1 times [2025-03-08 02:14:36,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:36,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069943226] [2025-03-08 02:14:36,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:36,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:36,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 02:14:36,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 02:14:36,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:36,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:14:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069943226] [2025-03-08 02:14:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069943226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983409035] [2025-03-08 02:14:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:36,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:36,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:36,957 INFO L87 Difference]: Start difference. First operand 11734 states and 13131 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:38,473 INFO L93 Difference]: Finished difference Result 32436 states and 36566 transitions. [2025-03-08 02:14:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 434 [2025-03-08 02:14:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:38,502 INFO L225 Difference]: With dead ends: 32436 [2025-03-08 02:14:38,502 INFO L226 Difference]: Without dead ends: 20704 [2025-03-08 02:14:38,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:38,536 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 601 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:38,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 978 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:14:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-03-08 02:14:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20704. [2025-03-08 02:14:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.0932232043665169) internal successors, (22633), 20703 states have internal predecessors, (22633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 22633 transitions. [2025-03-08 02:14:38,786 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 22633 transitions. Word has length 434 [2025-03-08 02:14:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:38,786 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 22633 transitions. [2025-03-08 02:14:38,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 22633 transitions. [2025-03-08 02:14:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-08 02:14:38,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:38,792 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:38,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:14:38,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:38,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1749095836, now seen corresponding path program 1 times [2025-03-08 02:14:38,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:38,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696731463] [2025-03-08 02:14:38,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:38,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-08 02:14:38,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-08 02:14:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 02:14:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:39,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696731463] [2025-03-08 02:14:39,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696731463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:39,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:39,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448655372] [2025-03-08 02:14:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:39,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:39,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:39,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:39,017 INFO L87 Difference]: Start difference. First operand 20704 states and 22633 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:40,649 INFO L93 Difference]: Finished difference Result 48306 states and 53266 transitions. [2025-03-08 02:14:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:40,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 441 [2025-03-08 02:14:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:40,690 INFO L225 Difference]: With dead ends: 48306 [2025-03-08 02:14:40,691 INFO L226 Difference]: Without dead ends: 27604 [2025-03-08 02:14:40,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:40,709 INFO L435 NwaCegarLoop]: 1111 mSDtfsCounter, 658 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:40,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1118 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:14:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27604 states. [2025-03-08 02:14:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27604 to 26914. [2025-03-08 02:14:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26914 states, 26913 states have (on average 1.0879129045442724) internal successors, (29279), 26913 states have internal predecessors, (29279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26914 states to 26914 states and 29279 transitions. [2025-03-08 02:14:41,184 INFO L78 Accepts]: Start accepts. Automaton has 26914 states and 29279 transitions. Word has length 441 [2025-03-08 02:14:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:41,185 INFO L471 AbstractCegarLoop]: Abstraction has 26914 states and 29279 transitions. [2025-03-08 02:14:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 26914 states and 29279 transitions. [2025-03-08 02:14:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 02:14:41,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:41,189 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:41,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:14:41,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash 965159987, now seen corresponding path program 1 times [2025-03-08 02:14:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650506212] [2025-03-08 02:14:41,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:41,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 02:14:41,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 02:14:41,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:41,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-08 02:14:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650506212] [2025-03-08 02:14:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650506212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:41,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472147853] [2025-03-08 02:14:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:41,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:41,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:41,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:41,460 INFO L87 Difference]: Start difference. First operand 26914 states and 29279 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:43,079 INFO L93 Difference]: Finished difference Result 60036 states and 66062 transitions. [2025-03-08 02:14:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:43,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 466 [2025-03-08 02:14:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:43,129 INFO L225 Difference]: With dead ends: 60036 [2025-03-08 02:14:43,129 INFO L226 Difference]: Without dead ends: 33124 [2025-03-08 02:14:43,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:43,146 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:43,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 932 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:14:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33124 states. [2025-03-08 02:14:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33124 to 33124. [2025-03-08 02:14:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.0809407360444405) internal successors, (35804), 33123 states have internal predecessors, (35804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 35804 transitions. [2025-03-08 02:14:43,528 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 35804 transitions. Word has length 466 [2025-03-08 02:14:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 35804 transitions. [2025-03-08 02:14:43,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 35804 transitions. [2025-03-08 02:14:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 02:14:43,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:43,540 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:43,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:14:43,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:43,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1513316070, now seen corresponding path program 1 times [2025-03-08 02:14:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:43,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622368123] [2025-03-08 02:14:43,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:43,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:43,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 02:14:43,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 02:14:43,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:43,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-08 02:14:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:43,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622368123] [2025-03-08 02:14:43,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622368123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:43,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:43,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921332636] [2025-03-08 02:14:43,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:43,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:43,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:43,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:43,889 INFO L87 Difference]: Start difference. First operand 33124 states and 35804 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:45,367 INFO L93 Difference]: Finished difference Result 77286 states and 84152 transitions. [2025-03-08 02:14:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:45,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 535 [2025-03-08 02:14:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:45,483 INFO L225 Difference]: With dead ends: 77286 [2025-03-08 02:14:45,483 INFO L226 Difference]: Without dead ends: 40714 [2025-03-08 02:14:45,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:45,506 INFO L435 NwaCegarLoop]: 1087 mSDtfsCounter, 641 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:45,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1093 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:14:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40714 states. [2025-03-08 02:14:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40714 to 37264. [2025-03-08 02:14:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37264 states, 37263 states have (on average 1.0473123473687036) internal successors, (39026), 37263 states have internal predecessors, (39026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37264 states to 37264 states and 39026 transitions. [2025-03-08 02:14:45,902 INFO L78 Accepts]: Start accepts. Automaton has 37264 states and 39026 transitions. Word has length 535 [2025-03-08 02:14:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:45,902 INFO L471 AbstractCegarLoop]: Abstraction has 37264 states and 39026 transitions. [2025-03-08 02:14:45,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37264 states and 39026 transitions. [2025-03-08 02:14:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 02:14:45,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:45,909 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:45,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:14:45,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1935527589, now seen corresponding path program 1 times [2025-03-08 02:14:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289763875] [2025-03-08 02:14:45,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:45,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 02:14:45,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 02:14:45,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:45,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-08 02:14:46,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:46,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289763875] [2025-03-08 02:14:46,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289763875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:46,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:46,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317285659] [2025-03-08 02:14:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:46,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:46,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:46,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:46,262 INFO L87 Difference]: Start difference. First operand 37264 states and 39026 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:47,477 INFO L93 Difference]: Finished difference Result 74526 states and 78050 transitions. [2025-03-08 02:14:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 563 [2025-03-08 02:14:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:47,513 INFO L225 Difference]: With dead ends: 74526 [2025-03-08 02:14:47,513 INFO L226 Difference]: Without dead ends: 37264 [2025-03-08 02:14:47,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:47,536 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 717 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:47,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 894 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:14:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37264 states. [2025-03-08 02:14:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37264 to 36574. [2025-03-08 02:14:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36574 states, 36573 states have (on average 1.0333579416509446) internal successors, (37793), 36573 states have internal predecessors, (37793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36574 states to 36574 states and 37793 transitions. [2025-03-08 02:14:47,885 INFO L78 Accepts]: Start accepts. Automaton has 36574 states and 37793 transitions. Word has length 563 [2025-03-08 02:14:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 36574 states and 37793 transitions. [2025-03-08 02:14:47,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 36574 states and 37793 transitions. [2025-03-08 02:14:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-08 02:14:47,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:47,890 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:14:47,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -333541802, now seen corresponding path program 1 times [2025-03-08 02:14:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948593338] [2025-03-08 02:14:47,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:47,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-08 02:14:47,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-08 02:14:47,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:47,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-08 02:14:48,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:48,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948593338] [2025-03-08 02:14:48,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948593338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:48,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:48,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069428332] [2025-03-08 02:14:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:48,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:48,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:48,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:48,171 INFO L87 Difference]: Start difference. First operand 36574 states and 37793 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:49,500 INFO L93 Difference]: Finished difference Result 82116 states and 85065 transitions. [2025-03-08 02:14:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 584 [2025-03-08 02:14:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:49,537 INFO L225 Difference]: With dead ends: 82116 [2025-03-08 02:14:49,537 INFO L226 Difference]: Without dead ends: 44854 [2025-03-08 02:14:49,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:49,559 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 603 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:49,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 304 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:14:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-03-08 02:14:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 44164. [2025-03-08 02:14:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44164 states, 44163 states have (on average 1.0320177524171819) internal successors, (45577), 44163 states have internal predecessors, (45577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44164 states to 44164 states and 45577 transitions. [2025-03-08 02:14:49,915 INFO L78 Accepts]: Start accepts. Automaton has 44164 states and 45577 transitions. Word has length 584 [2025-03-08 02:14:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:49,916 INFO L471 AbstractCegarLoop]: Abstraction has 44164 states and 45577 transitions. [2025-03-08 02:14:49,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 44164 states and 45577 transitions. [2025-03-08 02:14:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2025-03-08 02:14:49,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:49,982 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:49,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:14:49,982 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:49,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1827031879, now seen corresponding path program 1 times [2025-03-08 02:14:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:49,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317487966] [2025-03-08 02:14:49,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:50,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1117 statements into 1 equivalence classes. [2025-03-08 02:14:50,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1117 of 1117 statements. [2025-03-08 02:14:50,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 460 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-08 02:14:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317487966] [2025-03-08 02:14:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317487966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:14:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227330269] [2025-03-08 02:14:51,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:51,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:14:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:14:51,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:14:51,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:14:51,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1117 statements into 1 equivalence classes. [2025-03-08 02:14:51,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1117 of 1117 statements. [2025-03-08 02:14:51,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:51,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:51,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:14:51,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:14:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-08 02:14:51,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:14:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227330269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:51,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:14:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:14:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073896080] [2025-03-08 02:14:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:51,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:51,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:51,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:14:51,382 INFO L87 Difference]: Start difference. First operand 44164 states and 45577 transitions. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:52,679 INFO L93 Difference]: Finished difference Result 99366 states and 102849 transitions. [2025-03-08 02:14:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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 1117 [2025-03-08 02:14:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:52,735 INFO L225 Difference]: With dead ends: 99366 [2025-03-08 02:14:52,736 INFO L226 Difference]: Without dead ends: 53134 [2025-03-08 02:14:52,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1122 GetRequests, 1117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:14:52,768 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 628 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:52,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 873 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:14:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53134 states. [2025-03-08 02:14:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 51754. [2025-03-08 02:14:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51754 states, 51753 states have (on average 1.0331961432187506) internal successors, (53471), 51753 states have internal predecessors, (53471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 53471 transitions. [2025-03-08 02:14:53,213 INFO L78 Accepts]: Start accepts. Automaton has 51754 states and 53471 transitions. Word has length 1117 [2025-03-08 02:14:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:53,213 INFO L471 AbstractCegarLoop]: Abstraction has 51754 states and 53471 transitions. [2025-03-08 02:14:53,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 51754 states and 53471 transitions. [2025-03-08 02:14:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2025-03-08 02:14:53,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:53,227 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:53,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 02:14:53,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 02:14:53,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:53,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1317443298, now seen corresponding path program 1 times [2025-03-08 02:14:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770201326] [2025-03-08 02:14:53,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:53,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1290 statements into 1 equivalence classes. [2025-03-08 02:14:53,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1290 of 1290 statements. [2025-03-08 02:14:53,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1934 backedges. 829 proven. 0 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-03-08 02:14:53,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770201326] [2025-03-08 02:14:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770201326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143329875] [2025-03-08 02:14:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:53,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:53,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:53,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:53,880 INFO L87 Difference]: Start difference. First operand 51754 states and 53471 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:55,376 INFO L93 Difference]: Finished difference Result 125586 states and 130079 transitions. [2025-03-08 02:14:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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 1290 [2025-03-08 02:14:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:55,458 INFO L225 Difference]: With dead ends: 125586 [2025-03-08 02:14:55,458 INFO L226 Difference]: Without dead ends: 74524 [2025-03-08 02:14:55,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:55,493 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 579 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:55,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 81 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:14:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74524 states. [2025-03-08 02:14:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74524 to 71764. [2025-03-08 02:14:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71764 states, 71763 states have (on average 1.0347950893914692) internal successors, (74260), 71763 states have internal predecessors, (74260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71764 states to 71764 states and 74260 transitions. [2025-03-08 02:14:56,190 INFO L78 Accepts]: Start accepts. Automaton has 71764 states and 74260 transitions. Word has length 1290 [2025-03-08 02:14:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:56,191 INFO L471 AbstractCegarLoop]: Abstraction has 71764 states and 74260 transitions. [2025-03-08 02:14:56,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 71764 states and 74260 transitions. [2025-03-08 02:14:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1307 [2025-03-08 02:14:56,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:56,218 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, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:56,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:14:56,218 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:56,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash -684319617, now seen corresponding path program 1 times [2025-03-08 02:14:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:56,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466366186] [2025-03-08 02:14:56,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:56,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1306 statements into 1 equivalence classes. [2025-03-08 02:14:56,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1306 of 1306 statements. [2025-03-08 02:14:56,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:56,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:14:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 1187 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-08 02:14:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:14:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466366186] [2025-03-08 02:14:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466366186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:14:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:14:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:14:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045704395] [2025-03-08 02:14:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:14:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:14:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:14:56,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:14:56,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:14:56,959 INFO L87 Difference]: Start difference. First operand 71764 states and 74260 transitions. Second operand has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:14:58,276 INFO L93 Difference]: Finished difference Result 142146 states and 147078 transitions. [2025-03-08 02:14:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:14:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 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 1306 [2025-03-08 02:14:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:14:58,498 INFO L225 Difference]: With dead ends: 142146 [2025-03-08 02:14:58,498 INFO L226 Difference]: Without dead ends: 70384 [2025-03-08 02:14:58,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-08 02:14:58,516 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 500 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:14:58,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 943 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:14:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70384 states. [2025-03-08 02:14:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70384 to 69694. [2025-03-08 02:14:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69694 states, 69693 states have (on average 1.0303330320118234) internal successors, (71807), 69693 states have internal predecessors, (71807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69694 states to 69694 states and 71807 transitions. [2025-03-08 02:14:58,983 INFO L78 Accepts]: Start accepts. Automaton has 69694 states and 71807 transitions. Word has length 1306 [2025-03-08 02:14:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:14:58,983 INFO L471 AbstractCegarLoop]: Abstraction has 69694 states and 71807 transitions. [2025-03-08 02:14:58,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:14:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 69694 states and 71807 transitions. [2025-03-08 02:14:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1367 [2025-03-08 02:14:59,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:14:59,001 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:14:59,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:14:59,001 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:14:59,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:14:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1184161947, now seen corresponding path program 1 times [2025-03-08 02:14:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:14:59,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657900203] [2025-03-08 02:14:59,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:14:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:14:59,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1366 statements into 1 equivalence classes. [2025-03-08 02:14:59,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1366 of 1366 statements. [2025-03-08 02:14:59,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:14:59,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:15:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2767 backedges. 1594 proven. 0 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2025-03-08 02:15:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:15:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657900203] [2025-03-08 02:15:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657900203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:15:00,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:15:00,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:15:00,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722429987] [2025-03-08 02:15:00,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:15:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:15:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:15:00,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:15:00,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:15:00,344 INFO L87 Difference]: Start difference. First operand 69694 states and 71807 transitions. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:15:02,045 INFO L93 Difference]: Finished difference Result 137459 states and 141637 transitions. [2025-03-08 02:15:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:15:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 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 1366 [2025-03-08 02:15:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:15:02,117 INFO L225 Difference]: With dead ends: 137459 [2025-03-08 02:15:02,117 INFO L226 Difference]: Without dead ends: 68457 [2025-03-08 02:15:02,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:15:02,158 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 2010 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:15:02,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 951 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:15:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68457 states. [2025-03-08 02:15:02,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68457 to 67624. [2025-03-08 02:15:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67624 states, 67623 states have (on average 1.0289398577407096) internal successors, (69580), 67623 states have internal predecessors, (69580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67624 states to 67624 states and 69580 transitions. [2025-03-08 02:15:02,871 INFO L78 Accepts]: Start accepts. Automaton has 67624 states and 69580 transitions. Word has length 1366 [2025-03-08 02:15:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:15:02,871 INFO L471 AbstractCegarLoop]: Abstraction has 67624 states and 69580 transitions. [2025-03-08 02:15:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 67624 states and 69580 transitions. [2025-03-08 02:15:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1378 [2025-03-08 02:15:02,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:15:02,902 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, 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, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:15:02,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:15:02,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:15:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:15:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1661562229, now seen corresponding path program 1 times [2025-03-08 02:15:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:15:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420212772] [2025-03-08 02:15:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:15:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:15:02,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1377 statements into 1 equivalence classes. [2025-03-08 02:15:03,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1377 of 1377 statements. [2025-03-08 02:15:03,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:15:03,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:15:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2402 backedges. 766 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2025-03-08 02:15:03,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:15:03,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420212772] [2025-03-08 02:15:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420212772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:15:03,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:15:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:15:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119120613] [2025-03-08 02:15:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:15:03,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:15:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:15:03,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:15:03,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:03,720 INFO L87 Difference]: Start difference. First operand 67624 states and 69580 transitions. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:15:05,104 INFO L93 Difference]: Finished difference Result 145596 states and 149935 transitions. [2025-03-08 02:15:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:15:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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 1377 [2025-03-08 02:15:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:15:05,183 INFO L225 Difference]: With dead ends: 145596 [2025-03-08 02:15:05,183 INFO L226 Difference]: Without dead ends: 77974 [2025-03-08 02:15:05,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:05,230 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 614 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:15:05,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 271 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:15:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77974 states. [2025-03-08 02:15:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77974 to 71764. [2025-03-08 02:15:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71764 states, 71763 states have (on average 1.0287334698939565) internal successors, (73825), 71763 states have internal predecessors, (73825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71764 states to 71764 states and 73825 transitions. [2025-03-08 02:15:06,142 INFO L78 Accepts]: Start accepts. Automaton has 71764 states and 73825 transitions. Word has length 1377 [2025-03-08 02:15:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:15:06,143 INFO L471 AbstractCegarLoop]: Abstraction has 71764 states and 73825 transitions. [2025-03-08 02:15:06,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 71764 states and 73825 transitions. [2025-03-08 02:15:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1425 [2025-03-08 02:15:06,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:15:06,162 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:15:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:15:06,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:15:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:15:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 303244513, now seen corresponding path program 1 times [2025-03-08 02:15:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:15:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597203011] [2025-03-08 02:15:06,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:15:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:15:06,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1424 statements into 1 equivalence classes. [2025-03-08 02:15:06,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1424 of 1424 statements. [2025-03-08 02:15:06,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:15:06,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:15:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2025-03-08 02:15:06,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:15:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597203011] [2025-03-08 02:15:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597203011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:15:06,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:15:06,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:15:06,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860983103] [2025-03-08 02:15:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:15:06,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:15:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:15:06,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:15:06,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:06,789 INFO L87 Difference]: Start difference. First operand 71764 states and 73825 transitions. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:15:08,171 INFO L93 Difference]: Finished difference Result 144906 states and 149045 transitions. [2025-03-08 02:15:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:15:08,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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 1424 [2025-03-08 02:15:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:15:08,243 INFO L225 Difference]: With dead ends: 144906 [2025-03-08 02:15:08,243 INFO L226 Difference]: Without dead ends: 69694 [2025-03-08 02:15:08,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:08,288 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 615 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:15:08,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 936 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:15:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69694 states. [2025-03-08 02:15:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69694 to 69004. [2025-03-08 02:15:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69004 states, 69003 states have (on average 1.0178108198194282) internal successors, (70232), 69003 states have internal predecessors, (70232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69004 states to 69004 states and 70232 transitions. [2025-03-08 02:15:09,179 INFO L78 Accepts]: Start accepts. Automaton has 69004 states and 70232 transitions. Word has length 1424 [2025-03-08 02:15:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:15:09,180 INFO L471 AbstractCegarLoop]: Abstraction has 69004 states and 70232 transitions. [2025-03-08 02:15:09,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 69004 states and 70232 transitions. [2025-03-08 02:15:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1502 [2025-03-08 02:15:09,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:15:09,314 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:15:09,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:15:09,314 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:15:09,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:15:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1264535538, now seen corresponding path program 1 times [2025-03-08 02:15:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:15:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119313871] [2025-03-08 02:15:09,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:15:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:15:09,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1501 statements into 1 equivalence classes. [2025-03-08 02:15:09,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1501 of 1501 statements. [2025-03-08 02:15:09,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:15:09,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:15:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 2833 trivial. 0 not checked. [2025-03-08 02:15:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:15:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119313871] [2025-03-08 02:15:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119313871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:15:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:15:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:15:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024481964] [2025-03-08 02:15:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:15:09,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:15:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:15:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:15:09,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:09,963 INFO L87 Difference]: Start difference. First operand 69004 states and 70232 transitions. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:15:11,303 INFO L93 Difference]: Finished difference Result 149046 states and 151849 transitions. [2025-03-08 02:15:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:15:11,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 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 1501 [2025-03-08 02:15:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:15:11,379 INFO L225 Difference]: With dead ends: 149046 [2025-03-08 02:15:11,380 INFO L226 Difference]: Without dead ends: 80044 [2025-03-08 02:15:11,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:11,422 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 652 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:15:11,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 943 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:15:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80044 states. [2025-03-08 02:15:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80044 to 77284. [2025-03-08 02:15:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77284 states, 77283 states have (on average 1.0164719278495917) internal successors, (78556), 77283 states have internal predecessors, (78556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77284 states to 77284 states and 78556 transitions. [2025-03-08 02:15:12,250 INFO L78 Accepts]: Start accepts. Automaton has 77284 states and 78556 transitions. Word has length 1501 [2025-03-08 02:15:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:15:12,251 INFO L471 AbstractCegarLoop]: Abstraction has 77284 states and 78556 transitions. [2025-03-08 02:15:12,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 77284 states and 78556 transitions. [2025-03-08 02:15:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1746 [2025-03-08 02:15:12,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:15:12,315 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:15:12,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:15:12,315 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:15:12,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:15:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2081244591, now seen corresponding path program 1 times [2025-03-08 02:15:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:15:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351897654] [2025-03-08 02:15:12,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:15:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:15:12,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1745 statements into 1 equivalence classes. [2025-03-08 02:15:12,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1745 of 1745 statements. [2025-03-08 02:15:12,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:15:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:15:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2025-03-08 02:15:13,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:15:13,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351897654] [2025-03-08 02:15:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351897654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:15:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:15:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:15:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323744538] [2025-03-08 02:15:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:15:13,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:15:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:15:13,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:15:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:13,304 INFO L87 Difference]: Start difference. First operand 77284 states and 78556 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:15:14,742 INFO L93 Difference]: Finished difference Result 154566 states and 157110 transitions. [2025-03-08 02:15:14,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:15:14,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 1745 [2025-03-08 02:15:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:15:14,829 INFO L225 Difference]: With dead ends: 154566 [2025-03-08 02:15:14,829 INFO L226 Difference]: Without dead ends: 77284 [2025-03-08 02:15:14,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:14,872 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 658 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:15:14,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 919 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:15:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77284 states. [2025-03-08 02:15:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77284 to 75214. [2025-03-08 02:15:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75214 states, 75213 states have (on average 1.013335460625158) internal successors, (76216), 75213 states have internal predecessors, (76216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75214 states to 75214 states and 76216 transitions. [2025-03-08 02:15:15,443 INFO L78 Accepts]: Start accepts. Automaton has 75214 states and 76216 transitions. Word has length 1745 [2025-03-08 02:15:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:15:15,443 INFO L471 AbstractCegarLoop]: Abstraction has 75214 states and 76216 transitions. [2025-03-08 02:15:15,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 75214 states and 76216 transitions. [2025-03-08 02:15:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2025-03-08 02:15:15,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:15:15,477 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:15:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:15:15,477 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:15:15,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:15:15,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1056566016, now seen corresponding path program 1 times [2025-03-08 02:15:15,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:15:15,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309382911] [2025-03-08 02:15:15,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:15:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:15:15,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1766 statements into 1 equivalence classes. [2025-03-08 02:15:15,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1766 of 1766 statements. [2025-03-08 02:15:15,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:15:15,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:15:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 2611 trivial. 0 not checked. [2025-03-08 02:15:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:15:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309382911] [2025-03-08 02:15:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309382911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:15:16,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:15:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:15:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574221362] [2025-03-08 02:15:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:15:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:15:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:15:16,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:15:16,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:16,852 INFO L87 Difference]: Start difference. First operand 75214 states and 76216 transitions. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:15:17,686 INFO L93 Difference]: Finished difference Result 75238 states and 76240 transitions. [2025-03-08 02:15:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:15:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 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 1766 [2025-03-08 02:15:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:15:17,688 INFO L225 Difference]: With dead ends: 75238 [2025-03-08 02:15:17,688 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:15:17,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:15:17,709 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:15:17,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 979 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:15:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:15:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:15:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:15:17,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1766 [2025-03-08 02:15:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:15:17,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:15:17,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:15:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:15:17,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:15:17,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:15:17,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:15:17,716 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:15:17,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:15:19,907 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:15:19,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:15:19 BoogieIcfgContainer [2025-03-08 02:15:19,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:15:19,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:15:19,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:15:19,940 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:15:19,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:14:20" (3/4) ... [2025-03-08 02:15:19,942 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:15:19,983 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 02:15:19,987 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:15:19,990 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:15:19,993 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:15:20,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:15:20,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:15:20,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:15:20,184 INFO L158 Benchmark]: Toolchain (without parser) took 63749.71ms. Allocated memory was 142.6MB in the beginning and 6.7GB in the end (delta: 6.6GB). Free memory was 101.7MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-03-08 02:15:20,185 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:15:20,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.53ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 55.5MB in the end (delta: 45.9MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2025-03-08 02:15:20,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 181.92ms. Allocated memory is still 142.6MB. Free memory was 55.5MB in the beginning and 69.3MB in the end (delta: -13.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2025-03-08 02:15:20,186 INFO L158 Benchmark]: Boogie Preprocessor took 221.42ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 54.2MB in the end (delta: 15.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2025-03-08 02:15:20,186 INFO L158 Benchmark]: IcfgBuilder took 2947.06ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 54.2MB in the beginning and 137.6MB in the end (delta: -83.4MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. [2025-03-08 02:15:20,187 INFO L158 Benchmark]: TraceAbstraction took 59374.39ms. Allocated memory was 251.7MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 137.6MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-03-08 02:15:20,187 INFO L158 Benchmark]: Witness Printer took 243.97ms. Allocated memory is still 6.7GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 02:15:20,187 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.13ms. Allocated memory is still 226.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.53ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 55.5MB in the end (delta: 45.9MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 181.92ms. Allocated memory is still 142.6MB. Free memory was 55.5MB in the beginning and 69.3MB in the end (delta: -13.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 221.42ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 54.2MB in the end (delta: 15.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2947.06ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 54.2MB in the beginning and 137.6MB in the end (delta: -83.4MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. * TraceAbstraction took 59374.39ms. Allocated memory was 251.7MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 137.6MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 243.97ms. Allocated memory is still 6.7GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. 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: 145]: 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, 757 locations, 1443 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14882 SdHoareTripleChecker+Valid, 30.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14882 mSDsluCounter, 15139 SdHoareTripleChecker+Invalid, 24.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 6976 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41588 IncrementalHoareTripleChecker+Invalid, 48564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6976 mSolverCounterUnsat, 14983 mSDtfsCounter, 41588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1522 GetRequests, 1490 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77284occurred in iteration=19, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 24983 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 18925 NumberOfCodeBlocks, 18925 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 18902 ConstructedInterpolants, 0 QuantifiedInterpolants, 33216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1730 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 24636/25207 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: 4269]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a24 == 1) && (5 == a15)) && (a18 == 11)) || (((a24 == 1) && (a18 <= 8)) && (5 == a15))) || (((a24 == 3) && (a18 <= 8)) && (5 == a15))) || ((((a15 <= 4) && (a18 == 10)) && (a24 == 4)) && (a3 <= 417))) || (((a24 == 0) && (5 == a15)) && (a18 == 11))) || (((5 == a15) && (a24 == 2)) && (a18 == 9))) || ((((a24 == 2) && (a18 == 11)) && (a3 <= 417)) && (a15 == 6))) || ((((a24 == 3) && (a15 <= 4)) && (a18 == 11)) && (a3 <= 417))) || (((a18 == 10) && (a24 == 2)) && (a15 == 6))) || (((a24 == 3) && (a18 == 10)) && (a15 == 6))) || (((5 == a15) && (a18 == 10)) && (a24 == 2))) || (((a24 == 0) && (a18 <= 8)) && (a15 == 6))) || (((a24 == 2) && (a18 == 9)) && (a15 == 6))) || (((a15 <= 4) && (a24 <= 1)) && (a18 == 12))) || ((((a3 <= 306) && (a24 == 0)) && (a15 == 4)) && (a18 == 10))) || (((a15 == 4) && (a18 <= 8)) && (a3 <= 99))) || ((((a15 <= 4) && (a18 == 12)) && (a24 == 4)) && (a3 <= 417))) || ((((a24 == 3) && (a18 <= 8)) && (a3 <= 417)) && (a15 == 6))) || (((5 == a15) && (a18 == 10)) && (a24 == 4))) || (((a24 == 3) && (a15 <= 4)) && (a18 == 10))) || (((a24 == 0) && (5 == a15)) && (a18 == 9))) || (((a24 == 0) && (a18 == 9)) && (a15 == 6))) || ((((a18 <= 8) && (5 == a15)) && (a24 == 2)) && (a3 <= 417))) || (((a15 <= 4) && (a24 == 4)) && (a18 == 9))) || ((((a18 <= 8) && (5 == a15)) && (a24 == 4)) && (a3 <= 417))) || ((((5 == a15) && (a18 == 12)) && (a24 == 4)) && (a3 <= 99))) || ((((a24 == 1) && (5 == a15)) && (a18 == 10)) && (a3 <= 417))) || ((((a24 == 1) && (a18 == 12)) && (a3 <= 417)) && (a15 == 6))) || (((a24 == 3) && (5 == a15)) && (a18 == 11))) || (((a24 == 1) && (a18 <= 8)) && (a15 == 6))) || (((a24 == 1) && (5 == a15)) && (a18 == 9))) || (((a24 == 0) && (a18 == 11)) && (a15 == 6))) || (((a24 == 3) && (a18 == 9)) && (a15 == 6))) || (((a18 <= 8) && (a24 == 2)) && (a15 == 6))) || (((a24 == 3) && (5 == a15)) && (a18 == 10))) || ((((5 == a15) && (a24 == 2)) && (a18 == 11)) && (a3 <= 417))) || (((a15 <= 4) && (a24 <= 1)) && (a18 == 9))) || (((a18 <= 8) && (a15 <= 4)) && (a24 == 4))) || (((a24 == 1) && (a18 == 11)) && (a15 == 6))) || (((a24 == 3) && (a18 == 11)) && (a15 == 6))) || (((a24 == 0) && (a18 == 12)) && (a15 == 6))) || ((((a24 == 1) && (a18 == 10)) && (a3 <= 417)) && (a15 == 6))) || (((a15 <= 4) && (a18 == 11)) && (a24 == 4))) || (((a24 == 2) && (a18 == 12)) && (a15 == 6))) || (((a3 <= 115) && (a15 <= 4)) && (a24 <= 1))) || (((a15 <= 4) && (a24 <= 1)) && (a18 == 11))) || (((a24 == 1) && (5 == a15)) && (a18 == 12))) || ((((a15 <= 4) && (a24 <= 3)) && (a3 <= 417)) && (a18 == 9))) || (((a24 == 3) && (5 == a15)) && (a18 == 12))) || ((((5 == a15) && (a18 == 11)) && (a24 == 4)) && (a3 <= 417))) || ((a24 == 1) && (a15 <= 4))) || ((((a24 == 0) && (5 == a15)) && (a18 == 12)) && (a3 <= 417))) || ((((a24 == 3) && (a18 == 12)) && (a3 <= 417)) && (a15 == 6))) || (((a24 == 0) && (a18 == 10)) && (a15 == 6))) || (((a18 <= 8) && (a15 <= 4)) && (a24 <= 3))) || (((a24 == 0) && (5 == a15)) && (a18 == 10))) || (((5 == a15) && (a24 == 2)) && (a18 == 12))) || ((a15 <= 4) && (a24 == 2))) || ((((a24 == 3) && (a15 <= 4)) && (a18 == 12)) && (a3 <= 417))) || (((a24 == 0) && (a18 <= 8)) && (5 == a15))) || (((a24 == 1) && (a18 == 9)) && (a15 == 6))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:15:20,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE