./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label14.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 a02231a91e38821a474a995aa0f6354f8b6e8aefa7ca1b1921ca101a19abba9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:04:25,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:04:25,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:04:25,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:04:25,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:04:25,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:04:25,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:04:25,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:04:25,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:04:25,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:04:25,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:04:25,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:04:25,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:04:25,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:04:25,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:04:25,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:04:25,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:04:25,804 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 -> a02231a91e38821a474a995aa0f6354f8b6e8aefa7ca1b1921ca101a19abba9e [2025-03-03 11:04:26,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:04:26,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:04:26,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:04:26,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:04:26,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:04:26,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label14.c [2025-03-03 11:04:27,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e341be15d/966b9d2c486445e182ac63d4011e0722/FLAG11f668e95 [2025-03-03 11:04:27,557 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:04:27,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label14.c [2025-03-03 11:04:27,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e341be15d/966b9d2c486445e182ac63d4011e0722/FLAG11f668e95 [2025-03-03 11:04:27,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e341be15d/966b9d2c486445e182ac63d4011e0722 [2025-03-03 11:04:27,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:04:27,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:04:27,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:04:27,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:04:27,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:04:27,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:27" (1/1) ... [2025-03-03 11:04:27,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:27, skipping insertion in model container [2025-03-03 11:04:27,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:27" (1/1) ... [2025-03-03 11:04:27,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:04:27,799 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_label14.c[5298,5311] [2025-03-03 11:04:28,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:04:28,143 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:04:28,159 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_label14.c[5298,5311] [2025-03-03 11:04:28,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:04:28,357 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:04:28,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28 WrapperNode [2025-03-03 11:04:28,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:04:28,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:04:28,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:04:28,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:04:28,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,564 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-03 11:04:28,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:04:28,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:04:28,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:04:28,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:04:28,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,648 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 11:04:28,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:04:28,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:04:28,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:04:28,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:04:28,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (1/1) ... [2025-03-03 11:04:28,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:04:28,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:04:28,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:04:28,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:04:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:04:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:04:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:04:28,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:04:28,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:04:28,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:04:31,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-03 11:04:31,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-03 11:04:31,475 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-03 11:04:31,475 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:04:31,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:04:31,509 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:04:31,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:31 BoogieIcfgContainer [2025-03-03 11:04:31,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:04:31,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:04:31,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:04:31,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:04:31,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:04:27" (1/3) ... [2025-03-03 11:04:31,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d8382e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:31, skipping insertion in model container [2025-03-03 11:04:31,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:28" (2/3) ... [2025-03-03 11:04:31,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d8382e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:31, skipping insertion in model container [2025-03-03 11:04:31,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:31" (3/3) ... [2025-03-03 11:04:31,518 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label14.c [2025-03-03 11:04:31,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:04:31,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label14.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:04:31,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:04:31,593 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;@484685a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:04:31,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:04:31,600 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-03 11:04:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 11:04:31,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:31,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:31,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:31,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1999276100, now seen corresponding path program 1 times [2025-03-03 11:04:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:31,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394460364] [2025-03-03 11:04:31,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:31,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 11:04:31,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 11:04:31,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:31,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:04:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394460364] [2025-03-03 11:04:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394460364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149249924] [2025-03-03 11:04:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:32,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:04:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:32,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:04:32,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:04:32,023 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 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:36,179 INFO L93 Difference]: Finished difference Result 2898 states and 5642 transitions. [2025-03-03 11:04:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:04:36,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-03 11:04:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:36,193 INFO L225 Difference]: With dead ends: 2898 [2025-03-03 11:04:36,193 INFO L226 Difference]: Without dead ends: 2074 [2025-03-03 11:04:36,196 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-03 11:04:36,198 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2021 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5431 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 6445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 5431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:36,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 712 Invalid, 6445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1014 Valid, 5431 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 11:04:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-03-03 11:04:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2025-03-03 11:04:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5909310178485288) internal successors, (3298), 2073 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3298 transitions. [2025-03-03 11:04:36,290 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3298 transitions. Word has length 50 [2025-03-03 11:04:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:36,291 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3298 transitions. [2025-03-03 11:04:36,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3298 transitions. [2025-03-03 11:04:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 11:04:36,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:36,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:36,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:04:36,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:36,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash -253873394, now seen corresponding path program 1 times [2025-03-03 11:04:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:36,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317722531] [2025-03-03 11:04:36,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:36,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 11:04:36,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 11:04:36,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:36,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 11:04:36,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317722531] [2025-03-03 11:04:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317722531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:36,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:04:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229254496] [2025-03-03 11:04:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:36,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:36,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:36,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:36,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:36,665 INFO L87 Difference]: Start difference. First operand 2074 states and 3298 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 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-03 11:04:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:38,632 INFO L93 Difference]: Finished difference Result 5526 states and 9187 transitions. [2025-03-03 11:04:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:38,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 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 232 [2025-03-03 11:04:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:38,644 INFO L225 Difference]: With dead ends: 5526 [2025-03-03 11:04:38,644 INFO L226 Difference]: Without dead ends: 3454 [2025-03-03 11:04:38,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:38,648 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 590 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:38,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 436 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:04:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2025-03-03 11:04:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3454. [2025-03-03 11:04:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3453 states have (on average 1.4694468578048074) internal successors, (5074), 3453 states have internal predecessors, (5074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5074 transitions. [2025-03-03 11:04:38,703 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5074 transitions. Word has length 232 [2025-03-03 11:04:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:38,705 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 5074 transitions. [2025-03-03 11:04:38,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 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-03 11:04:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5074 transitions. [2025-03-03 11:04:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 11:04:38,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:38,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:04:38,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:04:38,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash -212048739, now seen corresponding path program 1 times [2025-03-03 11:04:38,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:38,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754055754] [2025-03-03 11:04:38,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:38,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-03 11:04:38,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 11:04:38,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:38,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:04:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754055754] [2025-03-03 11:04:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754055754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380907772] [2025-03-03 11:04:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:39,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:04:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:39,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:04:39,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:04:39,095 INFO L87 Difference]: Start difference. First operand 3454 states and 5074 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:41,077 INFO L93 Difference]: Finished difference Result 8339 states and 11975 transitions. [2025-03-03 11:04:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:04:41,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2025-03-03 11:04:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:41,090 INFO L225 Difference]: With dead ends: 8339 [2025-03-03 11:04:41,090 INFO L226 Difference]: Without dead ends: 4834 [2025-03-03 11:04:41,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:04:41,093 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:41,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:04:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-03-03 11:04:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-03-03 11:04:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3019551049963793) internal successors, (5394), 4143 states have internal predecessors, (5394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5394 transitions. [2025-03-03 11:04:41,149 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5394 transitions. Word has length 297 [2025-03-03 11:04:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:41,149 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5394 transitions. [2025-03-03 11:04:41,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5394 transitions. [2025-03-03 11:04:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-03 11:04:41,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:41,153 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:04:41,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:04:41,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:41,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1578859143, now seen corresponding path program 1 times [2025-03-03 11:04:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430123662] [2025-03-03 11:04:41,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:41,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-03 11:04:41,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-03 11:04:41,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:41,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 118 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:04:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:41,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430123662] [2025-03-03 11:04:41,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430123662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:04:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035810445] [2025-03-03 11:04:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:04:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:04:41,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:04:41,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:04:41,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-03 11:04:41,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-03 11:04:41,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:41,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:41,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:04:41,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:04:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 11:04:42,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:04:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035810445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:42,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:04:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 11:04:42,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342634296] [2025-03-03 11:04:42,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:42,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:42,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:42,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:04:42,334 INFO L87 Difference]: Start difference. First operand 4144 states and 5394 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:43,893 INFO L93 Difference]: Finished difference Result 11046 states and 14785 transitions. [2025-03-03 11:04:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:43,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 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 414 [2025-03-03 11:04:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:43,913 INFO L225 Difference]: With dead ends: 11046 [2025-03-03 11:04:43,913 INFO L226 Difference]: Without dead ends: 6904 [2025-03-03 11:04:43,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:04:43,918 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 444 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:43,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:04:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2025-03-03 11:04:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6214. [2025-03-03 11:04:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6214 states, 6213 states have (on average 1.2296797038467728) internal successors, (7640), 6213 states have internal predecessors, (7640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 7640 transitions. [2025-03-03 11:04:44,015 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 7640 transitions. Word has length 414 [2025-03-03 11:04:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:44,016 INFO L471 AbstractCegarLoop]: Abstraction has 6214 states and 7640 transitions. [2025-03-03 11:04:44,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 7640 transitions. [2025-03-03 11:04:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-03 11:04:44,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:44,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:04:44,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 11:04:44,227 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-03 11:04:44,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:44,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1137912307, now seen corresponding path program 1 times [2025-03-03 11:04:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869462805] [2025-03-03 11:04:44,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:44,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 11:04:44,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 11:04:44,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:44,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:04:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869462805] [2025-03-03 11:04:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869462805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:44,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782023664] [2025-03-03 11:04:44,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:44,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:44,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:44,678 INFO L87 Difference]: Start difference. First operand 6214 states and 7640 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:46,282 INFO L93 Difference]: Finished difference Result 15876 states and 19412 transitions. [2025-03-03 11:04:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:46,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 442 [2025-03-03 11:04:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:46,303 INFO L225 Difference]: With dead ends: 15876 [2025-03-03 11:04:46,303 INFO L226 Difference]: Without dead ends: 9664 [2025-03-03 11:04:46,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:46,310 INFO L435 NwaCegarLoop]: 1118 mSDtfsCounter, 598 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:46,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1125 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:04:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-03-03 11:04:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 9664. [2025-03-03 11:04:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9664 states, 9663 states have (on average 1.1778950636448309) internal successors, (11382), 9663 states have internal predecessors, (11382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9664 states to 9664 states and 11382 transitions. [2025-03-03 11:04:46,466 INFO L78 Accepts]: Start accepts. Automaton has 9664 states and 11382 transitions. Word has length 442 [2025-03-03 11:04:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:46,468 INFO L471 AbstractCegarLoop]: Abstraction has 9664 states and 11382 transitions. [2025-03-03 11:04:46,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9664 states and 11382 transitions. [2025-03-03 11:04:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-03 11:04:46,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:46,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:04:46,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:04:46,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:46,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1948689110, now seen corresponding path program 1 times [2025-03-03 11:04:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:46,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880829085] [2025-03-03 11:04:46,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:46,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-03 11:04:46,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-03 11:04:46,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:46,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-03 11:04:46,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:46,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880829085] [2025-03-03 11:04:46,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880829085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:46,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:46,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:04:46,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023962104] [2025-03-03 11:04:46,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:46,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:46,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:46,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:46,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:46,828 INFO L87 Difference]: Start difference. First operand 9664 states and 11382 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:48,328 INFO L93 Difference]: Finished difference Result 26226 states and 31184 transitions. [2025-03-03 11:04:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 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 447 [2025-03-03 11:04:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:48,396 INFO L225 Difference]: With dead ends: 26226 [2025-03-03 11:04:48,396 INFO L226 Difference]: Without dead ends: 17254 [2025-03-03 11:04:48,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:48,401 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:48,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:04:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17254 states. [2025-03-03 11:04:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17254 to 16564. [2025-03-03 11:04:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16564 states, 16563 states have (on average 1.1766588178470083) internal successors, (19489), 16563 states have internal predecessors, (19489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 19489 transitions. [2025-03-03 11:04:48,544 INFO L78 Accepts]: Start accepts. Automaton has 16564 states and 19489 transitions. Word has length 447 [2025-03-03 11:04:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:48,545 INFO L471 AbstractCegarLoop]: Abstraction has 16564 states and 19489 transitions. [2025-03-03 11:04:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16564 states and 19489 transitions. [2025-03-03 11:04:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-03 11:04:48,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:48,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:04:48,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:04:48,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:48,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 350373520, now seen corresponding path program 1 times [2025-03-03 11:04:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027604060] [2025-03-03 11:04:48,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:48,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 11:04:48,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 11:04:48,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:48,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:04:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027604060] [2025-03-03 11:04:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027604060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064700629] [2025-03-03 11:04:48,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:48,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:04:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:48,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:04:48,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:04:48,908 INFO L87 Difference]: Start difference. First operand 16564 states and 19489 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:51,173 INFO L93 Difference]: Finished difference Result 35886 states and 42295 transitions. [2025-03-03 11:04:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:04:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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 449 [2025-03-03 11:04:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:51,200 INFO L225 Difference]: With dead ends: 35886 [2025-03-03 11:04:51,200 INFO L226 Difference]: Without dead ends: 20014 [2025-03-03 11:04:51,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:04:51,214 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1060 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:51,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 100 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:04:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20014 states. [2025-03-03 11:04:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20014 to 20014. [2025-03-03 11:04:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.1577974316694148) internal successors, (23171), 20013 states have internal predecessors, (23171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 23171 transitions. [2025-03-03 11:04:51,403 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 23171 transitions. Word has length 449 [2025-03-03 11:04:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:51,404 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 23171 transitions. [2025-03-03 11:04:51,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 23171 transitions. [2025-03-03 11:04:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 979 [2025-03-03 11:04:51,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:51,411 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:51,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:04:51,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:51,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2014169808, now seen corresponding path program 1 times [2025-03-03 11:04:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51394903] [2025-03-03 11:04:51,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:51,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 978 statements into 1 equivalence classes. [2025-03-03 11:04:51,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 978 of 978 statements. [2025-03-03 11:04:51,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:51,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 11:04:52,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51394903] [2025-03-03 11:04:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51394903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:52,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168120378] [2025-03-03 11:04:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:52,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:52,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:52,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:52,027 INFO L87 Difference]: Start difference. First operand 20014 states and 23171 transitions. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:53,564 INFO L93 Difference]: Finished difference Result 47616 states and 55890 transitions. [2025-03-03 11:04:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 978 [2025-03-03 11:04:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:53,597 INFO L225 Difference]: With dead ends: 47616 [2025-03-03 11:04:53,598 INFO L226 Difference]: Without dead ends: 28984 [2025-03-03 11:04:53,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:53,617 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 666 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:53,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 223 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:04:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28984 states. [2025-03-03 11:04:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28984 to 28294. [2025-03-03 11:04:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28294 states, 28293 states have (on average 1.1511681334605732) internal successors, (32570), 28293 states have internal predecessors, (32570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 32570 transitions. [2025-03-03 11:04:53,966 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 32570 transitions. Word has length 978 [2025-03-03 11:04:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 28294 states and 32570 transitions. [2025-03-03 11:04:53,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 32570 transitions. [2025-03-03 11:04:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2025-03-03 11:04:53,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:53,976 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:04:53,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:04:53,976 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:53,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1921524359, now seen corresponding path program 1 times [2025-03-03 11:04:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563108852] [2025-03-03 11:04:53,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:54,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1096 statements into 1 equivalence classes. [2025-03-03 11:04:54,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1096 of 1096 statements. [2025-03-03 11:04:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 513 proven. 531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:04:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:55,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563108852] [2025-03-03 11:04:55,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563108852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:04:55,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589277298] [2025-03-03 11:04:55,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:55,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:04:55,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:04:55,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:04:55,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:04:55,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1096 statements into 1 equivalence classes. [2025-03-03 11:04:55,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1096 of 1096 statements. [2025-03-03 11:04:55,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:55,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:55,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:04:55,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:04:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:04:56,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:04:56,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589277298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:56,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:04:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-03 11:04:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33758963] [2025-03-03 11:04:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:56,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:04:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:56,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:04:56,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 11:04:56,851 INFO L87 Difference]: Start difference. First operand 28294 states and 32570 transitions. Second operand has 4 states, 4 states have (on average 165.25) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:59,660 INFO L93 Difference]: Finished difference Result 62106 states and 71869 transitions. [2025-03-03 11:04:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:04:59,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1096 [2025-03-03 11:04:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:59,701 INFO L225 Difference]: With dead ends: 62106 [2025-03-03 11:04:59,701 INFO L226 Difference]: Without dead ends: 35194 [2025-03-03 11:04:59,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1094 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 11:04:59,722 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1068 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 1451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1451 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:59,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 115 Invalid, 4229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1451 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 11:04:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35194 states. [2025-03-03 11:04:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35194 to 33124. [2025-03-03 11:04:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.154062132053256) internal successors, (38226), 33123 states have internal predecessors, (38226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 38226 transitions. [2025-03-03 11:05:00,001 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 38226 transitions. Word has length 1096 [2025-03-03 11:05:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:00,002 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 38226 transitions. [2025-03-03 11:05:00,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 38226 transitions. [2025-03-03 11:05:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2025-03-03 11:05:00,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:00,082 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:00,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 11:05:00,282 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,SelfDestructingSolverStorable8 [2025-03-03 11:05:00,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:00,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2083957761, now seen corresponding path program 1 times [2025-03-03 11:05:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:00,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635918029] [2025-03-03 11:05:00,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:00,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes. [2025-03-03 11:05:00,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements. [2025-03-03 11:05:00,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:00,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-03 11:05:00,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:00,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635918029] [2025-03-03 11:05:00,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635918029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:00,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:05:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831263927] [2025-03-03 11:05:00,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:00,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:00,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:00,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:00,843 INFO L87 Difference]: Start difference. First operand 33124 states and 38226 transitions. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:03,617 INFO L93 Difference]: Finished difference Result 86258 states and 99748 transitions. [2025-03-03 11:05:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 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 1189 [2025-03-03 11:05:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:03,675 INFO L225 Difference]: With dead ends: 86258 [2025-03-03 11:05:03,675 INFO L226 Difference]: Without dead ends: 53136 [2025-03-03 11:05:03,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:03,694 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1394 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:03,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 211 Invalid, 4820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 11:05:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53136 states. [2025-03-03 11:05:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53136 to 44164. [2025-03-03 11:05:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44164 states, 44163 states have (on average 1.1618549464483845) internal successors, (51311), 44163 states have internal predecessors, (51311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44164 states to 44164 states and 51311 transitions. [2025-03-03 11:05:04,072 INFO L78 Accepts]: Start accepts. Automaton has 44164 states and 51311 transitions. Word has length 1189 [2025-03-03 11:05:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:04,072 INFO L471 AbstractCegarLoop]: Abstraction has 44164 states and 51311 transitions. [2025-03-03 11:05:04,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 44164 states and 51311 transitions. [2025-03-03 11:05:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2025-03-03 11:05:04,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:04,082 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:04,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:05:04,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:04,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -142177759, now seen corresponding path program 1 times [2025-03-03 11:05:04,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:04,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464044039] [2025-03-03 11:05:04,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:04,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:04,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-03-03 11:05:04,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-03-03 11:05:04,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:04,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 837 proven. 93 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:05:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464044039] [2025-03-03 11:05:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464044039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060950590] [2025-03-03 11:05:05,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:05,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:05,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:05,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 11:05:05,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-03-03 11:05:05,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-03-03 11:05:05,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:05,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:05,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:05:05,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-03-03 11:05:05,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:05,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060950590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:05,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 11:05:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533627992] [2025-03-03 11:05:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:05,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:05,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:05:05,692 INFO L87 Difference]: Start difference. First operand 44164 states and 51311 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:07,289 INFO L93 Difference]: Finished difference Result 89706 states and 104136 transitions. [2025-03-03 11:05:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:07,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 1203 [2025-03-03 11:05:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:07,337 INFO L225 Difference]: With dead ends: 89706 [2025-03-03 11:05:07,338 INFO L226 Difference]: Without dead ends: 45544 [2025-03-03 11:05:07,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:05:07,366 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 598 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:07,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1135 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:05:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45544 states. [2025-03-03 11:05:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 45544. [2025-03-03 11:05:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45544 states, 45543 states have (on average 1.1391212700085633) internal successors, (51879), 45543 states have internal predecessors, (51879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45544 states to 45544 states and 51879 transitions. [2025-03-03 11:05:07,727 INFO L78 Accepts]: Start accepts. Automaton has 45544 states and 51879 transitions. Word has length 1203 [2025-03-03 11:05:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:07,727 INFO L471 AbstractCegarLoop]: Abstraction has 45544 states and 51879 transitions. [2025-03-03 11:05:07,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45544 states and 51879 transitions. [2025-03-03 11:05:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1222 [2025-03-03 11:05:07,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:07,737 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:05:07,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 11:05:07,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:07,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 212770053, now seen corresponding path program 1 times [2025-03-03 11:05:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742007737] [2025-03-03 11:05:07,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:07,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-03 11:05:08,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-03 11:05:08,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:08,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 675 proven. 815 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 11:05:09,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:09,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742007737] [2025-03-03 11:05:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742007737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:09,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103074907] [2025-03-03 11:05:09,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:09,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:09,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 11:05:09,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-03 11:05:09,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-03 11:05:09,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:09,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:09,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:09,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2025-03-03 11:05:09,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:09,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103074907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:09,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:09,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 11:05:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130640079] [2025-03-03 11:05:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:09,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:09,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:05:09,780 INFO L87 Difference]: Start difference. First operand 45544 states and 51879 transitions. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:11,539 INFO L93 Difference]: Finished difference Result 105576 states and 122144 transitions. [2025-03-03 11:05:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:11,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 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 1221 [2025-03-03 11:05:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:11,601 INFO L225 Difference]: With dead ends: 105576 [2025-03-03 11:05:11,601 INFO L226 Difference]: Without dead ends: 60034 [2025-03-03 11:05:11,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1228 GetRequests, 1221 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:05:11,613 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 695 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:11,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 275 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:05:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60034 states. [2025-03-03 11:05:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60034 to 60034. [2025-03-03 11:05:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60034 states, 60033 states have (on average 1.1387903319840755) internal successors, (68365), 60033 states have internal predecessors, (68365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 68365 transitions. [2025-03-03 11:05:12,072 INFO L78 Accepts]: Start accepts. Automaton has 60034 states and 68365 transitions. Word has length 1221 [2025-03-03 11:05:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:12,073 INFO L471 AbstractCegarLoop]: Abstraction has 60034 states and 68365 transitions. [2025-03-03 11:05:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 60034 states and 68365 transitions. [2025-03-03 11:05:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2025-03-03 11:05:12,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:12,157 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:05:12,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 11:05:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:12,358 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:12,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -523339059, now seen corresponding path program 1 times [2025-03-03 11:05:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:12,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609365519] [2025-03-03 11:05:12,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:12,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1280 statements into 1 equivalence classes. [2025-03-03 11:05:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1280 of 1280 statements. [2025-03-03 11:05:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-03-03 11:05:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609365519] [2025-03-03 11:05:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609365519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860308592] [2025-03-03 11:05:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:13,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:13,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:13,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:13,363 INFO L87 Difference]: Start difference. First operand 60034 states and 68365 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:15,024 INFO L93 Difference]: Finished difference Result 142146 states and 163030 transitions. [2025-03-03 11:05:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:15,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 1280 [2025-03-03 11:05:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:15,097 INFO L225 Difference]: With dead ends: 142146 [2025-03-03 11:05:15,097 INFO L226 Difference]: Without dead ends: 73834 [2025-03-03 11:05:15,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:15,131 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 667 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:15,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 941 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:05:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73834 states. [2025-03-03 11:05:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73834 to 69694. [2025-03-03 11:05:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69694 states, 69693 states have (on average 1.0971403153831805) internal successors, (76463), 69693 states have internal predecessors, (76463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69694 states to 69694 states and 76463 transitions. [2025-03-03 11:05:15,758 INFO L78 Accepts]: Start accepts. Automaton has 69694 states and 76463 transitions. Word has length 1280 [2025-03-03 11:05:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 69694 states and 76463 transitions. [2025-03-03 11:05:15,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 69694 states and 76463 transitions. [2025-03-03 11:05:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1283 [2025-03-03 11:05:15,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:15,768 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:05:15,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:05:15,769 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1600922566, now seen corresponding path program 1 times [2025-03-03 11:05:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:15,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658588238] [2025-03-03 11:05:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:15,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. [2025-03-03 11:05:15,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1282 of 1282 statements. [2025-03-03 11:05:15,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:15,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 541 proven. 189 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2025-03-03 11:05:16,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:16,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658588238] [2025-03-03 11:05:16,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658588238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:16,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293170342] [2025-03-03 11:05:16,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:16,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:16,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:16,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:16,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 11:05:17,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. [2025-03-03 11:05:17,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1282 of 1282 statements. [2025-03-03 11:05:17,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:17,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:17,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1484 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 11:05:17,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1143 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-03 11:05:18,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:18,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293170342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:18,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:18,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-03 11:05:18,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048738946] [2025-03-03 11:05:18,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:18,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:05:18,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:18,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:05:18,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:05:18,432 INFO L87 Difference]: Start difference. First operand 69694 states and 76463 transitions. Second operand has 5 states, 5 states have (on average 155.2) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:20,638 INFO L93 Difference]: Finished difference Result 141511 states and 155101 transitions. [2025-03-03 11:05:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:05:20,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 155.2) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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 1282 [2025-03-03 11:05:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:20,706 INFO L225 Difference]: With dead ends: 141511 [2025-03-03 11:05:20,707 INFO L226 Difference]: Without dead ends: 72456 [2025-03-03 11:05:20,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1286 GetRequests, 1280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:05:20,736 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 971 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3210 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:20,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 315 Invalid, 3412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3210 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:05:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72456 states. [2025-03-03 11:05:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72456 to 71074. [2025-03-03 11:05:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71074 states, 71073 states have (on average 1.0956340663824518) internal successors, (77870), 71073 states have internal predecessors, (77870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71074 states to 71074 states and 77870 transitions. [2025-03-03 11:05:21,286 INFO L78 Accepts]: Start accepts. Automaton has 71074 states and 77870 transitions. Word has length 1282 [2025-03-03 11:05:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:21,286 INFO L471 AbstractCegarLoop]: Abstraction has 71074 states and 77870 transitions. [2025-03-03 11:05:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.2) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 71074 states and 77870 transitions. [2025-03-03 11:05:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2025-03-03 11:05:21,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:21,296 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:21,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 11:05:21,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 11:05:21,497 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:21,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1725057514, now seen corresponding path program 1 times [2025-03-03 11:05:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071948640] [2025-03-03 11:05:21,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:21,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1297 statements into 1 equivalence classes. [2025-03-03 11:05:21,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1297 of 1297 statements. [2025-03-03 11:05:21,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:21,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1071 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:05:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071948640] [2025-03-03 11:05:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071948640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767222671] [2025-03-03 11:05:22,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:22,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:22,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:22,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:22,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 11:05:22,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1297 statements into 1 equivalence classes. [2025-03-03 11:05:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1297 of 1297 statements. [2025-03-03 11:05:22,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:22,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:22,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 11:05:22,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1071 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:05:23,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:05:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:05:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767222671] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:23,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:05:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-03-03 11:05:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445086950] [2025-03-03 11:05:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:23,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:05:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:23,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:05:23,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:05:23,333 INFO L87 Difference]: Start difference. First operand 71074 states and 77870 transitions. Second operand has 5 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:25,228 INFO L93 Difference]: Finished difference Result 152496 states and 167938 transitions. [2025-03-03 11:05:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:25,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 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 1297 [2025-03-03 11:05:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:25,321 INFO L225 Difference]: With dead ends: 152496 [2025-03-03 11:05:25,322 INFO L226 Difference]: Without dead ends: 82114 [2025-03-03 11:05:25,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2597 GetRequests, 2589 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:05:25,369 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 906 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:25,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 14 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [906 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:05:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82114 states. [2025-03-03 11:05:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82114 to 76594. [2025-03-03 11:05:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76594 states, 76593 states have (on average 1.100191923543927) internal successors, (84267), 76593 states have internal predecessors, (84267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76594 states to 76594 states and 84267 transitions. [2025-03-03 11:05:26,302 INFO L78 Accepts]: Start accepts. Automaton has 76594 states and 84267 transitions. Word has length 1297 [2025-03-03 11:05:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:26,302 INFO L471 AbstractCegarLoop]: Abstraction has 76594 states and 84267 transitions. [2025-03-03 11:05:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 76594 states and 84267 transitions. [2025-03-03 11:05:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1337 [2025-03-03 11:05:26,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:26,314 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:26,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 11:05:26,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 11:05:26,515 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1282949592, now seen corresponding path program 1 times [2025-03-03 11:05:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488357097] [2025-03-03 11:05:26,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:26,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1336 statements into 1 equivalence classes. [2025-03-03 11:05:26,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1336 of 1336 statements. [2025-03-03 11:05:26,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:26,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-03 11:05:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488357097] [2025-03-03 11:05:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488357097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:28,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847792557] [2025-03-03 11:05:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:28,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:28,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:28,495 INFO L87 Difference]: Start difference. First operand 76594 states and 84267 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:30,011 INFO L93 Difference]: Finished difference Result 152496 states and 167841 transitions. [2025-03-03 11:05:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:30,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1336 [2025-03-03 11:05:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:30,087 INFO L225 Difference]: With dead ends: 152496 [2025-03-03 11:05:30,087 INFO L226 Difference]: Without dead ends: 76594 [2025-03-03 11:05:30,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:30,126 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 747 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:30,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 761 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:05:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76594 states. [2025-03-03 11:05:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76594 to 76594. [2025-03-03 11:05:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76594 states, 76593 states have (on average 1.0944864413197029) internal successors, (83830), 76593 states have internal predecessors, (83830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76594 states to 76594 states and 83830 transitions. [2025-03-03 11:05:30,724 INFO L78 Accepts]: Start accepts. Automaton has 76594 states and 83830 transitions. Word has length 1336 [2025-03-03 11:05:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:30,725 INFO L471 AbstractCegarLoop]: Abstraction has 76594 states and 83830 transitions. [2025-03-03 11:05:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 76594 states and 83830 transitions. [2025-03-03 11:05:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2025-03-03 11:05:30,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:30,737 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:30,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:05:30,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:30,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1537951749, now seen corresponding path program 1 times [2025-03-03 11:05:30,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:30,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605986282] [2025-03-03 11:05:30,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:30,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-03-03 11:05:30,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-03-03 11:05:30,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:30,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1097 proven. 719 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 11:05:32,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605986282] [2025-03-03 11:05:32,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605986282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876218914] [2025-03-03 11:05:32,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:32,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:32,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:32,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 11:05:32,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-03-03 11:05:32,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-03-03 11:05:32,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:32,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:32,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:32,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1230 proven. 0 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2025-03-03 11:05:32,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876218914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 11:05:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453618814] [2025-03-03 11:05:32,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:32,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:32,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:32,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:05:32,608 INFO L87 Difference]: Start difference. First operand 76594 states and 83830 transitions. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:34,061 INFO L93 Difference]: Finished difference Result 175266 states and 192499 transitions. [2025-03-03 11:05:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1355 [2025-03-03 11:05:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:34,171 INFO L225 Difference]: With dead ends: 175266 [2025-03-03 11:05:34,171 INFO L226 Difference]: Without dead ends: 98674 [2025-03-03 11:05:34,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1360 GetRequests, 1355 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-03 11:05:34,221 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 595 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:34,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 899 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98674 states. [2025-03-03 11:05:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98674 to 97984. [2025-03-03 11:05:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97984 states, 97983 states have (on average 1.0842493085535245) internal successors, (106238), 97983 states have internal predecessors, (106238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97984 states to 97984 states and 106238 transitions. [2025-03-03 11:05:35,063 INFO L78 Accepts]: Start accepts. Automaton has 97984 states and 106238 transitions. Word has length 1355 [2025-03-03 11:05:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:35,064 INFO L471 AbstractCegarLoop]: Abstraction has 97984 states and 106238 transitions. [2025-03-03 11:05:35,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 97984 states and 106238 transitions. [2025-03-03 11:05:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1377 [2025-03-03 11:05:35,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:35,088 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, 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, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:05:35,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 11:05:35,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:35,289 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:35,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash -484410990, now seen corresponding path program 1 times [2025-03-03 11:05:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735909874] [2025-03-03 11:05:35,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:35,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1376 statements into 1 equivalence classes. [2025-03-03 11:05:35,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1376 of 1376 statements. [2025-03-03 11:05:35,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:35,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 1257 proven. 0 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2025-03-03 11:05:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735909874] [2025-03-03 11:05:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735909874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:35,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755359620] [2025-03-03 11:05:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:35,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:35,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:35,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:35,962 INFO L87 Difference]: Start difference. First operand 97984 states and 106238 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:37,545 INFO L93 Difference]: Finished difference Result 193206 states and 209480 transitions. [2025-03-03 11:05:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:37,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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 1376 [2025-03-03 11:05:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:37,640 INFO L225 Difference]: With dead ends: 193206 [2025-03-03 11:05:37,640 INFO L226 Difference]: Without dead ends: 95914 [2025-03-03 11:05:37,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:37,663 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 679 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:37,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 901 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:05:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95914 states. [2025-03-03 11:05:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95914 to 80044. [2025-03-03 11:05:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80044 states, 80043 states have (on average 1.0538335644591033) internal successors, (84352), 80043 states have internal predecessors, (84352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80044 states to 80044 states and 84352 transitions. [2025-03-03 11:05:38,322 INFO L78 Accepts]: Start accepts. Automaton has 80044 states and 84352 transitions. Word has length 1376 [2025-03-03 11:05:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:38,323 INFO L471 AbstractCegarLoop]: Abstraction has 80044 states and 84352 transitions. [2025-03-03 11:05:38,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 80044 states and 84352 transitions. [2025-03-03 11:05:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1411 [2025-03-03 11:05:38,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:38,337 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:05:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:05:38,337 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1974817272, now seen corresponding path program 1 times [2025-03-03 11:05:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114449495] [2025-03-03 11:05:38,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:38,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1410 statements into 1 equivalence classes. [2025-03-03 11:05:38,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1410 of 1410 statements. [2025-03-03 11:05:38,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:38,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2248 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-03 11:05:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114449495] [2025-03-03 11:05:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114449495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932725977] [2025-03-03 11:05:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:39,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:39,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:39,113 INFO L87 Difference]: Start difference. First operand 80044 states and 84352 transitions. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:40,586 INFO L93 Difference]: Finished difference Result 173196 states and 182551 transitions. [2025-03-03 11:05:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:40,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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 1410 [2025-03-03 11:05:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:40,673 INFO L225 Difference]: With dead ends: 173196 [2025-03-03 11:05:40,673 INFO L226 Difference]: Without dead ends: 93154 [2025-03-03 11:05:40,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:40,715 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 630 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:40,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 956 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:05:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93154 states. [2025-03-03 11:05:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93154 to 90394. [2025-03-03 11:05:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90394 states, 90393 states have (on average 1.0499153695529522) internal successors, (94905), 90393 states have internal predecessors, (94905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90394 states to 90394 states and 94905 transitions. [2025-03-03 11:05:41,559 INFO L78 Accepts]: Start accepts. Automaton has 90394 states and 94905 transitions. Word has length 1410 [2025-03-03 11:05:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:41,560 INFO L471 AbstractCegarLoop]: Abstraction has 90394 states and 94905 transitions. [2025-03-03 11:05:41,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 90394 states and 94905 transitions. [2025-03-03 11:05:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1454 [2025-03-03 11:05:41,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:41,586 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:41,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:05:41,586 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:41,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 316414702, now seen corresponding path program 1 times [2025-03-03 11:05:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701031276] [2025-03-03 11:05:41,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:41,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1453 statements into 1 equivalence classes. [2025-03-03 11:05:41,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1453 of 1453 statements. [2025-03-03 11:05:41,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:41,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 782 proven. 637 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:05:43,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701031276] [2025-03-03 11:05:43,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701031276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575470019] [2025-03-03 11:05:43,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:43,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:43,943 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:43,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 11:05:44,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1453 statements into 1 equivalence classes. [2025-03-03 11:05:44,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1453 of 1453 statements. [2025-03-03 11:05:44,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:44,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:44,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 11:05:44,185 INFO L279 TraceCheckSpWp]: Computing forward predicates...