./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label30.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/Problem16_label30.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 12d23798e1ec2473ce2c19acb587b0594ab921b365483c260e8791dd4e57612e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:55:17,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:55:18,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:55:18,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:55:18,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:55:18,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:55:18,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:55:18,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:55:18,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:55:18,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:55:18,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:55:18,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:55:18,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:55:18,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:55:18,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:55:18,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:55:18,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:55:18,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:55:18,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:55:18,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:55:18,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:55:18,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:55:18,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:55:18,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:55:18,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:55:18,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:55:18,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:55:18,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:55:18,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:55:18,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:55:18,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:55:18,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:55:18,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:55:18,070 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 -> 12d23798e1ec2473ce2c19acb587b0594ab921b365483c260e8791dd4e57612e [2025-03-03 10:55:18,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:55:18,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:55:18,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:55:18,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:55:18,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:55:18,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label30.c [2025-03-03 10:55:19,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33c6e80c/e86625e82034405f9bb97a34fea8a117/FLAGbe5b0a3ba [2025-03-03 10:55:19,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:55:19,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label30.c [2025-03-03 10:55:19,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33c6e80c/e86625e82034405f9bb97a34fea8a117/FLAGbe5b0a3ba [2025-03-03 10:55:19,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33c6e80c/e86625e82034405f9bb97a34fea8a117 [2025-03-03 10:55:19,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:55:19,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:55:19,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:55:19,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:55:19,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:55:19,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:19" (1/1) ... [2025-03-03 10:55:19,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a16809c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:19, skipping insertion in model container [2025-03-03 10:55:19,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:19" (1/1) ... [2025-03-03 10:55:19,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:55:20,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label30.c[1812,1825] [2025-03-03 10:55:20,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:55:20,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:55:20,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label30.c[1812,1825] [2025-03-03 10:55:20,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:55:20,511 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:55:20,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20 WrapperNode [2025-03-03 10:55:20,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:55:20,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:55:20,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:55:20,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:55:20,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,630 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:55:20,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:55:20,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:55:20,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:55:20,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:55:20,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:55:20,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:55:20,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:55:20,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:55:20,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:55:20,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (1/1) ... [2025-03-03 10:55:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:55:20,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:20,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:55:20,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:55:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:55:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:55:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:55:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:55:20,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:55:20,931 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:55:22,500 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:55:22,572 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:55:22,573 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:55:22,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:55:22,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:55:22,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:22 BoogieIcfgContainer [2025-03-03 10:55:22,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:55:22,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:55:22,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:55:22,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:55:22,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:55:19" (1/3) ... [2025-03-03 10:55:22,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb7f1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:22, skipping insertion in model container [2025-03-03 10:55:22,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:20" (2/3) ... [2025-03-03 10:55:22,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb7f1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:22, skipping insertion in model container [2025-03-03 10:55:22,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:22" (3/3) ... [2025-03-03 10:55:22,603 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label30.c [2025-03-03 10:55:22,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:55:22,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label30.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:55:22,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:55:22,686 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;@30bb8949, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:55:22,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:55:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 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 10:55:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 10:55:22,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:22,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:22,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1305868051, now seen corresponding path program 1 times [2025-03-03 10:55:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:22,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787636072] [2025-03-03 10:55:22,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:22,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 10:55:22,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 10:55:22,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:22,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787636072] [2025-03-03 10:55:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787636072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:22,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:22,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195806763] [2025-03-03 10:55:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:22,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:22,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:22,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:22,907 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 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) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:24,368 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-03 10:55:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:24,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-03 10:55:24,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:24,380 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 10:55:24,380 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:55:24,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:24,386 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 369 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:24,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:55:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:55:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:55:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2025-03-03 10:55:24,431 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 15 [2025-03-03 10:55:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:24,431 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2025-03-03 10:55:24,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2025-03-03 10:55:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 10:55:24,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:24,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:24,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:55:24,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:24,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -342609893, now seen corresponding path program 1 times [2025-03-03 10:55:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:24,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567712344] [2025-03-03 10:55:24,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:24,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 10:55:24,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 10:55:24,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:24,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:24,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567712344] [2025-03-03 10:55:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567712344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:24,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:24,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603518064] [2025-03-03 10:55:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:24,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:24,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:24,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:24,627 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:25,613 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2025-03-03 10:55:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:25,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 10:55:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:25,618 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:55:25,618 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:55:25,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:25,620 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:25,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 218 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:55:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:55:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:55:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions. [2025-03-03 10:55:25,656 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 81 [2025-03-03 10:55:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:25,657 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions. [2025-03-03 10:55:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions. [2025-03-03 10:55:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 10:55:25,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:25,659 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:55:25,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:55:25,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:25,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash -560786722, now seen corresponding path program 1 times [2025-03-03 10:55:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108360399] [2025-03-03 10:55:25,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:25,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 10:55:25,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 10:55:25,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:25,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108360399] [2025-03-03 10:55:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108360399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:25,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:25,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793783101] [2025-03-03 10:55:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:25,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:25,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:25,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:25,904 INFO L87 Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:27,529 INFO L93 Difference]: Finished difference Result 4283 states and 6144 transitions. [2025-03-03 10:55:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:55:27,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 10:55:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:27,538 INFO L225 Difference]: With dead ends: 4283 [2025-03-03 10:55:27,539 INFO L226 Difference]: Without dead ends: 2965 [2025-03-03 10:55:27,543 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 10:55:27,545 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 886 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:27,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 150 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:55:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-03-03 10:55:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2025-03-03 10:55:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3670715249662617) internal successors, (4052), 2964 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4052 transitions. [2025-03-03 10:55:27,596 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4052 transitions. Word has length 94 [2025-03-03 10:55:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:27,597 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4052 transitions. [2025-03-03 10:55:27,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4052 transitions. [2025-03-03 10:55:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 10:55:27,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:27,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:27,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:55:27,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -876805447, now seen corresponding path program 1 times [2025-03-03 10:55:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:27,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928237628] [2025-03-03 10:55:27,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 10:55:27,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 10:55:27,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:27,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:55:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928237628] [2025-03-03 10:55:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928237628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:27,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995258213] [2025-03-03 10:55:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:27,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:27,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:27,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:27,820 INFO L87 Difference]: Start difference. First operand 2965 states and 4052 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:28,781 INFO L93 Difference]: Finished difference Result 8231 states and 11469 transitions. [2025-03-03 10:55:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:28,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2025-03-03 10:55:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:28,806 INFO L225 Difference]: With dead ends: 8231 [2025-03-03 10:55:28,807 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:55:28,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:28,814 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:28,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:55:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:55:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4281. [2025-03-03 10:55:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3133177570093457) internal successors, (5621), 4280 states have internal predecessors, (5621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5621 transitions. [2025-03-03 10:55:28,907 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5621 transitions. Word has length 181 [2025-03-03 10:55:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:28,907 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5621 transitions. [2025-03-03 10:55:28,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5621 transitions. [2025-03-03 10:55:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 10:55:28,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:28,909 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:28,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:55:28,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 252811406, now seen corresponding path program 1 times [2025-03-03 10:55:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637788762] [2025-03-03 10:55:28,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:28,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:28,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 10:55:28,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 10:55:28,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:28,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 10:55:29,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:29,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637788762] [2025-03-03 10:55:29,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637788762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:29,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:29,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567981660] [2025-03-03 10:55:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:29,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:29,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:29,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:29,098 INFO L87 Difference]: Start difference. First operand 4281 states and 5621 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:29,924 INFO L93 Difference]: Finished difference Result 9547 states and 12468 transitions. [2025-03-03 10:55:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 212 [2025-03-03 10:55:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:29,937 INFO L225 Difference]: With dead ends: 9547 [2025-03-03 10:55:29,937 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:55:29,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:29,941 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:29,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:55:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:55:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-03 10:55:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2162258756254467) internal successors, (6806), 5596 states have internal predecessors, (6806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6806 transitions. [2025-03-03 10:55:30,012 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6806 transitions. Word has length 212 [2025-03-03 10:55:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:30,013 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6806 transitions. [2025-03-03 10:55:30,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6806 transitions. [2025-03-03 10:55:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 10:55:30,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:30,016 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:30,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:55:30,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:30,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1318781256, now seen corresponding path program 1 times [2025-03-03 10:55:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536327471] [2025-03-03 10:55:30,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:30,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:55:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:55:30,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:30,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536327471] [2025-03-03 10:55:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536327471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:55:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370524137] [2025-03-03 10:55:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:55:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:30,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:55:30,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:30,502 INFO L87 Difference]: Start difference. First operand 5597 states and 6806 transitions. Second operand has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:31,782 INFO L93 Difference]: Finished difference Result 10722 states and 13122 transitions. [2025-03-03 10:55:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:55:31,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-03-03 10:55:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:31,795 INFO L225 Difference]: With dead ends: 10722 [2025-03-03 10:55:31,795 INFO L226 Difference]: Without dead ends: 5268 [2025-03-03 10:55:31,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:31,800 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 308 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:31,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 291 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:55:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-03 10:55:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-03-03 10:55:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0924625023732675) internal successors, (5754), 5267 states have internal predecessors, (5754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5754 transitions. [2025-03-03 10:55:31,872 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5754 transitions. Word has length 347 [2025-03-03 10:55:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:31,873 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5754 transitions. [2025-03-03 10:55:31,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5754 transitions. [2025-03-03 10:55:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-03 10:55:31,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:31,876 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:31,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:55:31,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:31,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:31,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2118114353, now seen corresponding path program 1 times [2025-03-03 10:55:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:31,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54686759] [2025-03-03 10:55:31,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:31,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:31,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 10:55:31,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 10:55:31,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:31,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-03 10:55:32,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54686759] [2025-03-03 10:55:32,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54686759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518936314] [2025-03-03 10:55:32,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:32,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:32,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:32,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:55:32,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 10:55:32,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 10:55:32,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:32,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:32,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:55:32,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 10:55:32,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518936314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:32,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:55:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886142257] [2025-03-03 10:55:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:32,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:32,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:32,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:32,739 INFO L87 Difference]: Start difference. First operand 5268 states and 5754 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:33,370 INFO L93 Difference]: Finished difference Result 6257 states and 6773 transitions. [2025-03-03 10:55:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 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 354 [2025-03-03 10:55:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:33,383 INFO L225 Difference]: With dead ends: 6257 [2025-03-03 10:55:33,383 INFO L226 Difference]: Without dead ends: 6255 [2025-03-03 10:55:33,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:33,385 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:33,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-03-03 10:55:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 5597. [2025-03-03 10:55:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.089349535382416) internal successors, (6096), 5596 states have internal predecessors, (6096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6096 transitions. [2025-03-03 10:55:33,440 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6096 transitions. Word has length 354 [2025-03-03 10:55:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:33,440 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6096 transitions. [2025-03-03 10:55:33,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6096 transitions. [2025-03-03 10:55:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 10:55:33,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:33,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:33,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:55:33,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:33,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -297626484, now seen corresponding path program 1 times [2025-03-03 10:55:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505990476] [2025-03-03 10:55:33,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:33,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 10:55:33,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 10:55:33,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:33,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 10:55:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:33,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505990476] [2025-03-03 10:55:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505990476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:33,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:33,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402212859] [2025-03-03 10:55:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:33,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:33,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:33,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:33,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:33,993 INFO L87 Difference]: Start difference. First operand 5597 states and 6096 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:34,683 INFO L93 Difference]: Finished difference Result 13824 states and 15194 transitions. [2025-03-03 10:55:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:34,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 553 [2025-03-03 10:55:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:34,698 INFO L225 Difference]: With dead ends: 13824 [2025-03-03 10:55:34,698 INFO L226 Difference]: Without dead ends: 8558 [2025-03-03 10:55:34,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:34,701 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:34,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 432 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-03-03 10:55:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8558. [2025-03-03 10:55:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.065794086712633) internal successors, (9120), 8557 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9120 transitions. [2025-03-03 10:55:34,773 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9120 transitions. Word has length 553 [2025-03-03 10:55:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:34,774 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9120 transitions. [2025-03-03 10:55:34,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9120 transitions. [2025-03-03 10:55:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-03 10:55:34,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:34,782 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:34,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:55:34,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:34,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:34,783 INFO L85 PathProgramCache]: Analyzing trace with hash 440673345, now seen corresponding path program 1 times [2025-03-03 10:55:34,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:34,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471334922] [2025-03-03 10:55:34,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:34,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-03 10:55:34,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-03 10:55:34,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:34,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-03 10:55:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471334922] [2025-03-03 10:55:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471334922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746694507] [2025-03-03 10:55:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:35,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:35,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:35,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:35,118 INFO L87 Difference]: Start difference. First operand 8558 states and 9120 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:35,802 INFO L93 Difference]: Finished difference Result 19417 states and 20888 transitions. [2025-03-03 10:55:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 587 [2025-03-03 10:55:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:35,821 INFO L225 Difference]: With dead ends: 19417 [2025-03-03 10:55:35,821 INFO L226 Difference]: Without dead ends: 11190 [2025-03-03 10:55:35,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:35,829 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 176 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:35,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 420 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2025-03-03 10:55:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10861. [2025-03-03 10:55:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0615101289134439) internal successors, (11528), 10860 states have internal predecessors, (11528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11528 transitions. [2025-03-03 10:55:35,929 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11528 transitions. Word has length 587 [2025-03-03 10:55:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:35,930 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11528 transitions. [2025-03-03 10:55:35,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11528 transitions. [2025-03-03 10:55:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-03-03 10:55:35,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:35,941 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:35,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:55:35,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:35,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1848066072, now seen corresponding path program 1 times [2025-03-03 10:55:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:35,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912825035] [2025-03-03 10:55:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:35,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-03 10:55:36,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-03 10:55:36,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:36,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-03 10:55:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912825035] [2025-03-03 10:55:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912825035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:36,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:36,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:36,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685052171] [2025-03-03 10:55:36,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:36,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:36,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:36,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:36,287 INFO L87 Difference]: Start difference. First operand 10861 states and 11528 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:36,928 INFO L93 Difference]: Finished difference Result 24352 states and 26058 transitions. [2025-03-03 10:55:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:36,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 746 [2025-03-03 10:55:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:36,951 INFO L225 Difference]: With dead ends: 24352 [2025-03-03 10:55:36,951 INFO L226 Difference]: Without dead ends: 13822 [2025-03-03 10:55:36,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:36,962 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:36,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 440 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-03-03 10:55:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2025-03-03 10:55:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.055382511585505) internal successors, (13892), 13163 states have internal predecessors, (13892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13892 transitions. [2025-03-03 10:55:37,105 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13892 transitions. Word has length 746 [2025-03-03 10:55:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:37,105 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13892 transitions. [2025-03-03 10:55:37,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13892 transitions. [2025-03-03 10:55:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2025-03-03 10:55:37,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:37,113 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:37,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:55:37,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:37,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash -25065326, now seen corresponding path program 1 times [2025-03-03 10:55:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:37,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633352558] [2025-03-03 10:55:37,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:37,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:37,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 747 statements into 1 equivalence classes. [2025-03-03 10:55:37,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 747 of 747 statements. [2025-03-03 10:55:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-03-03 10:55:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633352558] [2025-03-03 10:55:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633352558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242876380] [2025-03-03 10:55:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:37,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:37,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:37,488 INFO L87 Difference]: Start difference. First operand 13164 states and 13892 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:38,147 INFO L93 Difference]: Finished difference Result 27971 states and 29467 transitions. [2025-03-03 10:55:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 747 [2025-03-03 10:55:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:38,162 INFO L225 Difference]: With dead ends: 27971 [2025-03-03 10:55:38,162 INFO L226 Difference]: Without dead ends: 13164 [2025-03-03 10:55:38,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:38,173 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:38,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-03 10:55:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2025-03-03 10:55:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0365435561788998) internal successors, (13303), 12834 states have internal predecessors, (13303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13303 transitions. [2025-03-03 10:55:38,271 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13303 transitions. Word has length 747 [2025-03-03 10:55:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:38,272 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13303 transitions. [2025-03-03 10:55:38,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13303 transitions. [2025-03-03 10:55:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2025-03-03 10:55:38,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:38,285 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:38,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:55:38,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:38,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1708320584, now seen corresponding path program 1 times [2025-03-03 10:55:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324968870] [2025-03-03 10:55:38,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:38,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1030 statements into 1 equivalence classes. [2025-03-03 10:55:38,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1030 of 1030 statements. [2025-03-03 10:55:38,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:38,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 996 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-03-03 10:55:39,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:39,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324968870] [2025-03-03 10:55:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324968870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:39,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:55:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849860819] [2025-03-03 10:55:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:39,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:39,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:39,199 INFO L87 Difference]: Start difference. First operand 12835 states and 13303 transitions. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:39,957 INFO L93 Difference]: Finished difference Result 25348 states and 26282 transitions. [2025-03-03 10:55:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:55:39,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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 1030 [2025-03-03 10:55:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:39,973 INFO L225 Difference]: With dead ends: 25348 [2025-03-03 10:55:39,973 INFO L226 Difference]: Without dead ends: 12844 [2025-03-03 10:55:39,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:39,982 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:39,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states. [2025-03-03 10:55:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 12506. [2025-03-03 10:55:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0367852858856457) internal successors, (12965), 12505 states have internal predecessors, (12965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12965 transitions. [2025-03-03 10:55:40,074 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12965 transitions. Word has length 1030 [2025-03-03 10:55:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:40,075 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12965 transitions. [2025-03-03 10:55:40,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12965 transitions. [2025-03-03 10:55:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2025-03-03 10:55:40,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:40,116 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:40,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:55:40,116 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:40,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -291685421, now seen corresponding path program 1 times [2025-03-03 10:55:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:40,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720025707] [2025-03-03 10:55:40,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:40,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1087 statements into 1 equivalence classes. [2025-03-03 10:55:40,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1087 of 1087 statements. [2025-03-03 10:55:40,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:40,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1725 proven. 0 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-03 10:55:40,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:40,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720025707] [2025-03-03 10:55:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720025707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949158343] [2025-03-03 10:55:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:40,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:40,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:40,711 INFO L87 Difference]: Start difference. First operand 12506 states and 12965 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:41,264 INFO L93 Difference]: Finished difference Result 24681 states and 25597 transitions. [2025-03-03 10:55:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:41,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 1087 [2025-03-03 10:55:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:41,282 INFO L225 Difference]: With dead ends: 24681 [2025-03-03 10:55:41,282 INFO L226 Difference]: Without dead ends: 12506 [2025-03-03 10:55:41,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:41,292 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:41,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 422 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-03 10:55:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 11848. [2025-03-03 10:55:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0233814467797755) internal successors, (12124), 11847 states have internal predecessors, (12124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12124 transitions. [2025-03-03 10:55:41,450 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12124 transitions. Word has length 1087 [2025-03-03 10:55:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:41,451 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12124 transitions. [2025-03-03 10:55:41,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12124 transitions. [2025-03-03 10:55:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1113 [2025-03-03 10:55:41,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:41,463 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:41,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:55:41,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:41,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash -579573430, now seen corresponding path program 1 times [2025-03-03 10:55:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:41,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090562360] [2025-03-03 10:55:41,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:41,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:41,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1112 statements into 1 equivalence classes. [2025-03-03 10:55:41,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1112 of 1112 statements. [2025-03-03 10:55:41,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:41,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2633 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-03-03 10:55:42,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090562360] [2025-03-03 10:55:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090562360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:42,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:42,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195318698] [2025-03-03 10:55:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:42,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:42,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:42,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:42,162 INFO L87 Difference]: Start difference. First operand 11848 states and 12124 transitions. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:42,705 INFO L93 Difference]: Finished difference Result 24023 states and 24584 transitions. [2025-03-03 10:55:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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 1112 [2025-03-03 10:55:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:42,719 INFO L225 Difference]: With dead ends: 24023 [2025-03-03 10:55:42,720 INFO L226 Difference]: Without dead ends: 12506 [2025-03-03 10:55:42,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:42,728 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:42,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-03-03 10:55:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2025-03-03 10:55:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0225509796081567) internal successors, (12787), 12505 states have internal predecessors, (12787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12787 transitions. [2025-03-03 10:55:42,817 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12787 transitions. Word has length 1112 [2025-03-03 10:55:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:42,818 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12787 transitions. [2025-03-03 10:55:42,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12787 transitions. [2025-03-03 10:55:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2025-03-03 10:55:42,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:42,831 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:42,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:55:42,832 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:42,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash -98349195, now seen corresponding path program 1 times [2025-03-03 10:55:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524990692] [2025-03-03 10:55:42,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:42,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:42,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1166 statements into 1 equivalence classes. [2025-03-03 10:55:42,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1166 of 1166 statements. [2025-03-03 10:55:42,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:42,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-03 10:55:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:43,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524990692] [2025-03-03 10:55:43,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524990692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:43,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:43,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829448852] [2025-03-03 10:55:43,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:43,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:43,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:43,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:43,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:43,298 INFO L87 Difference]: Start difference. First operand 12506 states and 12787 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:43,863 INFO L93 Difference]: Finished difference Result 27313 states and 27961 transitions. [2025-03-03 10:55:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 1166 [2025-03-03 10:55:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:43,874 INFO L225 Difference]: With dead ends: 27313 [2025-03-03 10:55:43,874 INFO L226 Difference]: Without dead ends: 13493 [2025-03-03 10:55:43,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:43,881 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 209 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:43,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 410 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-03 10:55:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 12177. [2025-03-03 10:55:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0198751642575559) internal successors, (12418), 12176 states have internal predecessors, (12418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12418 transitions. [2025-03-03 10:55:43,962 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12418 transitions. Word has length 1166 [2025-03-03 10:55:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:43,962 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12418 transitions. [2025-03-03 10:55:43,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12418 transitions. [2025-03-03 10:55:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2025-03-03 10:55:43,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:43,976 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:43,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:55:43,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:43,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 486108221, now seen corresponding path program 1 times [2025-03-03 10:55:43,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:43,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323291885] [2025-03-03 10:55:43,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:43,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:44,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1246 statements into 1 equivalence classes. [2025-03-03 10:55:44,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1246 of 1246 statements. [2025-03-03 10:55:44,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:44,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2827 backedges. 1955 proven. 66 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2025-03-03 10:55:45,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:45,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323291885] [2025-03-03 10:55:45,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323291885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:45,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624545745] [2025-03-03 10:55:45,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:45,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:45,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:45,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:45,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:55:45,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1246 statements into 1 equivalence classes. [2025-03-03 10:55:45,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1246 of 1246 statements. [2025-03-03 10:55:45,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:45,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:55:45,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2827 backedges. 1502 proven. 201 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-03-03 10:55:47,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:55:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2827 backedges. 1502 proven. 201 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-03-03 10:55:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624545745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:55:50,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:55:50,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-03 10:55:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548896040] [2025-03-03 10:55:50,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:55:50,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:55:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:50,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:55:50,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:55:50,065 INFO L87 Difference]: Start difference. First operand 12177 states and 12418 transitions. Second operand has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 8 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:53,561 INFO L93 Difference]: Finished difference Result 35867 states and 36577 transitions. [2025-03-03 10:55:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:55:53,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 8 states have internal predecessors, (1705), 0 states have call successors, (0), 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 1246 [2025-03-03 10:55:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:53,581 INFO L225 Difference]: With dead ends: 35867 [2025-03-03 10:55:53,581 INFO L226 Difference]: Without dead ends: 24021 [2025-03-03 10:55:53,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2502 GetRequests, 2487 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 10:55:53,592 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1503 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6808 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 7049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 6808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:53,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 94 Invalid, 7049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 6808 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:55:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2025-03-03 10:55:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 17770. [2025-03-03 10:55:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17770 states, 17769 states have (on average 1.0190781698463616) internal successors, (18108), 17769 states have internal predecessors, (18108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18108 transitions. [2025-03-03 10:55:53,740 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18108 transitions. Word has length 1246 [2025-03-03 10:55:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:53,740 INFO L471 AbstractCegarLoop]: Abstraction has 17770 states and 18108 transitions. [2025-03-03 10:55:53,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 8 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18108 transitions. [2025-03-03 10:55:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2025-03-03 10:55:53,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:53,756 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:55:53,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:55:53,959 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,SelfDestructingSolverStorable15 [2025-03-03 10:55:53,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1214826409, now seen corresponding path program 1 times [2025-03-03 10:55:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467616208] [2025-03-03 10:55:53,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:54,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-03-03 10:55:54,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-03-03 10:55:54,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:54,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 1757 proven. 0 refuted. 0 times theorem prover too weak. 1629 trivial. 0 not checked. [2025-03-03 10:55:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467616208] [2025-03-03 10:55:54,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467616208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:54,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:54,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983312413] [2025-03-03 10:55:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:54,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:54,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:54,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:54,777 INFO L87 Difference]: Start difference. First operand 17770 states and 18108 transitions. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:55,418 INFO L93 Difference]: Finished difference Result 35538 states and 36217 transitions. [2025-03-03 10:55:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:55,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1276 [2025-03-03 10:55:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:55,432 INFO L225 Difference]: With dead ends: 35538 [2025-03-03 10:55:55,432 INFO L226 Difference]: Without dead ends: 18099 [2025-03-03 10:55:55,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:55,442 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:55,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 103 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2025-03-03 10:55:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 18099. [2025-03-03 10:55:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0188418609791137) internal successors, (18439), 18098 states have internal predecessors, (18439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18439 transitions. [2025-03-03 10:55:55,608 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18439 transitions. Word has length 1276 [2025-03-03 10:55:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:55,608 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18439 transitions. [2025-03-03 10:55:55,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18439 transitions. [2025-03-03 10:55:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2025-03-03 10:55:55,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:55,623 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:55:55,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:55:55,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:55,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash -102573253, now seen corresponding path program 1 times [2025-03-03 10:55:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640218638] [2025-03-03 10:55:55,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:55,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-03-03 10:55:55,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-03-03 10:55:55,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:55,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3568 backedges. 2265 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2025-03-03 10:55:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640218638] [2025-03-03 10:55:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640218638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:56,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:56,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283215925] [2025-03-03 10:55:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:56,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:56,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:56,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:56,530 INFO L87 Difference]: Start difference. First operand 18099 states and 18439 transitions. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:57,144 INFO L93 Difference]: Finished difference Result 38499 states and 39220 transitions. [2025-03-03 10:55:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 1339 [2025-03-03 10:55:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:57,162 INFO L225 Difference]: With dead ends: 38499 [2025-03-03 10:55:57,162 INFO L226 Difference]: Without dead ends: 21060 [2025-03-03 10:55:57,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:57,172 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:57,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 46 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-03 10:55:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19415. [2025-03-03 10:55:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.018234263933244) internal successors, (19768), 19414 states have internal predecessors, (19768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19768 transitions. [2025-03-03 10:55:57,309 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19768 transitions. Word has length 1339 [2025-03-03 10:55:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:57,309 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19768 transitions. [2025-03-03 10:55:57,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:55:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19768 transitions. [2025-03-03 10:55:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2025-03-03 10:55:57,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:57,325 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 10:55:57,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:55:57,325 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:57,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:57,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1640952842, now seen corresponding path program 1 times [2025-03-03 10:55:57,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:57,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152120895] [2025-03-03 10:55:57,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:57,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:57,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1380 statements into 1 equivalence classes. [2025-03-03 10:55:57,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1380 of 1380 statements. [2025-03-03 10:55:57,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 3187 proven. 132 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-03-03 10:55:59,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152120895] [2025-03-03 10:55:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152120895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035696912] [2025-03-03 10:55:59,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:59,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:59,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:59,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:55:59,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:55:59,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1380 statements into 1 equivalence classes. [2025-03-03 10:55:59,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1380 of 1380 statements. [2025-03-03 10:55:59,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:59,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:59,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:55:59,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 1205 proven. 0 refuted. 0 times theorem prover too weak. 2939 trivial. 0 not checked. [2025-03-03 10:55:59,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:59,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035696912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:59,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:59,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:55:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172345508] [2025-03-03 10:55:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:59,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:59,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:59,744 INFO L87 Difference]: Start difference. First operand 19415 states and 19768 transitions. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:00,259 INFO L93 Difference]: Finished difference Result 38170 states and 38872 transitions. [2025-03-03 10:56:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:00,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 1380 [2025-03-03 10:56:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:00,272 INFO L225 Difference]: With dead ends: 38170 [2025-03-03 10:56:00,272 INFO L226 Difference]: Without dead ends: 19415 [2025-03-03 10:56:00,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1384 GetRequests, 1380 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:00,279 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 117 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:00,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 425 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-03-03 10:56:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 19415. [2025-03-03 10:56:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.017976717832492) internal successors, (19763), 19414 states have internal predecessors, (19763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19763 transitions. [2025-03-03 10:56:00,400 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19763 transitions. Word has length 1380 [2025-03-03 10:56:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:00,401 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19763 transitions. [2025-03-03 10:56:00,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19763 transitions. [2025-03-03 10:56:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1634 [2025-03-03 10:56:00,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:00,420 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:00,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:56:00,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:00,621 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:00,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:00,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1032987047, now seen corresponding path program 1 times [2025-03-03 10:56:00,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:00,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283569389] [2025-03-03 10:56:00,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:00,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1633 statements into 1 equivalence classes. [2025-03-03 10:56:00,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1633 of 1633 statements. [2025-03-03 10:56:00,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:00,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5288 backedges. 2067 proven. 1349 refuted. 0 times theorem prover too weak. 1872 trivial. 0 not checked. [2025-03-03 10:56:02,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283569389] [2025-03-03 10:56:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283569389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106873649] [2025-03-03 10:56:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:02,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:02,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:02,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:02,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:56:02,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1633 statements into 1 equivalence classes. [2025-03-03 10:56:02,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1633 of 1633 statements. [2025-03-03 10:56:02,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:02,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:02,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:56:02,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5288 backedges. 2865 proven. 0 refuted. 0 times theorem prover too weak. 2423 trivial. 0 not checked. [2025-03-03 10:56:03,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:03,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106873649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:03,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:03,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:56:03,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069435472] [2025-03-03 10:56:03,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:03,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:03,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:03,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:03,095 INFO L87 Difference]: Start difference. First operand 19415 states and 19763 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:03,616 INFO L93 Difference]: Finished difference Result 38170 states and 38862 transitions. [2025-03-03 10:56:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:03,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 1633 [2025-03-03 10:56:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:03,631 INFO L225 Difference]: With dead ends: 38170 [2025-03-03 10:56:03,631 INFO L226 Difference]: Without dead ends: 19415 [2025-03-03 10:56:03,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1637 GetRequests, 1633 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:03,639 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 92 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:03,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 377 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-03-03 10:56:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 18757. [2025-03-03 10:56:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0169012582640222) internal successors, (19073), 18756 states have internal predecessors, (19073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19073 transitions. [2025-03-03 10:56:03,769 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19073 transitions. Word has length 1633 [2025-03-03 10:56:03,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:03,770 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19073 transitions. [2025-03-03 10:56:03,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19073 transitions. [2025-03-03 10:56:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2022 [2025-03-03 10:56:03,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:03,794 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:56:03,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:56:03,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:03,998 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:03,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1115138227, now seen corresponding path program 1 times [2025-03-03 10:56:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665954153] [2025-03-03 10:56:03,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:04,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2021 statements into 1 equivalence classes. [2025-03-03 10:56:04,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2021 of 2021 statements. [2025-03-03 10:56:04,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:04,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8247 backedges. 5855 proven. 153 refuted. 0 times theorem prover too weak. 2239 trivial. 0 not checked. [2025-03-03 10:56:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665954153] [2025-03-03 10:56:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665954153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80612311] [2025-03-03 10:56:06,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:06,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:06,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:06,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:06,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:56:06,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2021 statements into 1 equivalence classes. [2025-03-03 10:56:06,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2021 of 2021 statements. [2025-03-03 10:56:06,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:06,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:06,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 2331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:56:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8247 backedges. 4850 proven. 0 refuted. 0 times theorem prover too weak. 3397 trivial. 0 not checked. [2025-03-03 10:56:06,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80612311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:06,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:06,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:56:06,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434708526] [2025-03-03 10:56:06,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:06,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:06,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:06,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:06,765 INFO L87 Difference]: Start difference. First operand 18757 states and 19073 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 10:56:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:07,329 INFO L93 Difference]: Finished difference Result 39159 states and 39823 transitions. [2025-03-03 10:56:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:07,330 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 2021 [2025-03-03 10:56:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:07,347 INFO L225 Difference]: With dead ends: 39159 [2025-03-03 10:56:07,347 INFO L226 Difference]: Without dead ends: 21062 [2025-03-03 10:56:07,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 2021 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:07,358 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 223 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:07,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 427 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2025-03-03 10:56:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 19744. [2025-03-03 10:56:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0164108798055007) internal successors, (20067), 19743 states have internal predecessors, (20067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20067 transitions. [2025-03-03 10:56:07,510 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20067 transitions. Word has length 2021 [2025-03-03 10:56:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:07,511 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20067 transitions. [2025-03-03 10:56:07,511 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 10:56:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20067 transitions. [2025-03-03 10:56:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2053 [2025-03-03 10:56:07,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:07,576 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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] [2025-03-03 10:56:07,584 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 10:56:07,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:07,777 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1435775873, now seen corresponding path program 1 times [2025-03-03 10:56:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998678512] [2025-03-03 10:56:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:07,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2052 statements into 1 equivalence classes. [2025-03-03 10:56:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2052 of 2052 statements. [2025-03-03 10:56:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8669 backedges. 6448 proven. 91 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2025-03-03 10:56:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998678512] [2025-03-03 10:56:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998678512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378458748] [2025-03-03 10:56:09,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:09,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:09,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:56:10,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2052 statements into 1 equivalence classes. [2025-03-03 10:56:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2052 of 2052 statements. [2025-03-03 10:56:10,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:10,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:10,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 2365 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:56:10,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8669 backedges. 6613 proven. 157 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2025-03-03 10:56:12,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:56:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8669 backedges. 6349 proven. 421 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2025-03-03 10:56:15,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378458748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:56:15,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:56:15,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-03 10:56:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658625971] [2025-03-03 10:56:15,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:56:15,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 10:56:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:15,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 10:56:15,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:56:15,230 INFO L87 Difference]: Start difference. First operand 19744 states and 20067 transitions. Second operand has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:17,836 INFO L93 Difference]: Finished difference Result 39159 states and 39804 transitions. [2025-03-03 10:56:17,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 10:56:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 states have internal predecessors, (1792), 0 states have call successors, (0), 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 2052 [2025-03-03 10:56:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:17,855 INFO L225 Difference]: With dead ends: 39159 [2025-03-03 10:56:17,855 INFO L226 Difference]: Without dead ends: 20075 [2025-03-03 10:56:17,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4114 GetRequests, 4101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-03 10:56:17,863 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1527 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7402 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 7441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:17,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 449 Invalid, 7441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7402 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:56:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20075 states. [2025-03-03 10:56:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20075 to 20073. [2025-03-03 10:56:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0158429653248306) internal successors, (20390), 20072 states have internal predecessors, (20390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20390 transitions. [2025-03-03 10:56:18,019 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20390 transitions. Word has length 2052 [2025-03-03 10:56:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:18,020 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20390 transitions. [2025-03-03 10:56:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20390 transitions. [2025-03-03 10:56:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2253 [2025-03-03 10:56:18,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:18,079 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:18,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:56:18,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:18,280 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:18,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:18,280 INFO L85 PathProgramCache]: Analyzing trace with hash 870024361, now seen corresponding path program 1 times [2025-03-03 10:56:18,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:18,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179756461] [2025-03-03 10:56:18,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:18,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2252 statements into 1 equivalence classes. [2025-03-03 10:56:18,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2252 of 2252 statements. [2025-03-03 10:56:18,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:18,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9993 backedges. 7100 proven. 153 refuted. 0 times theorem prover too weak. 2740 trivial. 0 not checked. [2025-03-03 10:56:20,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179756461] [2025-03-03 10:56:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179756461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283532452] [2025-03-03 10:56:20,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:20,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:20,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:20,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:20,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:56:20,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2252 statements into 1 equivalence classes. [2025-03-03 10:56:21,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2252 of 2252 statements. [2025-03-03 10:56:21,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:21,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:21,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 2565 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:56:21,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9993 backedges. 3398 proven. 0 refuted. 0 times theorem prover too weak. 6595 trivial. 0 not checked. [2025-03-03 10:56:21,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283532452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:56:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278684330] [2025-03-03 10:56:21,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:21,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:21,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:21,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:21,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:21,540 INFO L87 Difference]: Start difference. First operand 20073 states and 20390 transitions. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:22,217 INFO L93 Difference]: Finished difference Result 42118 states and 42791 transitions. [2025-03-03 10:56:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:22,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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 2252 [2025-03-03 10:56:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:22,238 INFO L225 Difference]: With dead ends: 42118 [2025-03-03 10:56:22,238 INFO L226 Difference]: Without dead ends: 22705 [2025-03-03 10:56:22,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2257 GetRequests, 2252 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:22,250 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 182 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:22,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 46 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:56:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2025-03-03 10:56:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 20073. [2025-03-03 10:56:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0155938620964529) internal successors, (20385), 20072 states have internal predecessors, (20385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20385 transitions. [2025-03-03 10:56:22,439 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20385 transitions. Word has length 2252 [2025-03-03 10:56:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:22,439 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20385 transitions. [2025-03-03 10:56:22,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20385 transitions. [2025-03-03 10:56:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2319 [2025-03-03 10:56:22,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:22,468 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:56:22,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:56:22,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:22,668 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash 447445294, now seen corresponding path program 1 times [2025-03-03 10:56:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406853624] [2025-03-03 10:56:22,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:22,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2318 statements into 1 equivalence classes. [2025-03-03 10:56:22,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2318 of 2318 statements. [2025-03-03 10:56:22,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:22,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10390 backedges. 7378 proven. 153 refuted. 0 times theorem prover too weak. 2859 trivial. 0 not checked. [2025-03-03 10:56:25,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406853624] [2025-03-03 10:56:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406853624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034262856] [2025-03-03 10:56:25,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:25,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:25,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:25,129 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:25,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:56:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2318 statements into 1 equivalence classes. [2025-03-03 10:56:25,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2318 of 2318 statements. [2025-03-03 10:56:25,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:25,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:25,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:56:25,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10390 backedges. 6870 proven. 67 refuted. 0 times theorem prover too weak. 3453 trivial. 0 not checked. [2025-03-03 10:56:29,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:56:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10390 backedges. 5816 proven. 0 refuted. 0 times theorem prover too weak. 4574 trivial. 0 not checked. [2025-03-03 10:56:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034262856] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:32,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:56:32,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-03 10:56:32,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108219246] [2025-03-03 10:56:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:32,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:32,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:32,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:56:32,375 INFO L87 Difference]: Start difference. First operand 20073 states and 20385 transitions. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:32,963 INFO L93 Difference]: Finished difference Result 41131 states and 41777 transitions. [2025-03-03 10:56:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:32,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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 2318 [2025-03-03 10:56:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:32,985 INFO L225 Difference]: With dead ends: 41131 [2025-03-03 10:56:32,985 INFO L226 Difference]: Without dead ends: 21718 [2025-03-03 10:56:33,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4640 GetRequests, 4633 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:56:33,001 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:33,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 29 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2025-03-03 10:56:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 20073. [2025-03-03 10:56:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0148963730569949) internal successors, (20371), 20072 states have internal predecessors, (20371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20371 transitions. [2025-03-03 10:56:33,159 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20371 transitions. Word has length 2318 [2025-03-03 10:56:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:33,160 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20371 transitions. [2025-03-03 10:56:33,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20371 transitions. [2025-03-03 10:56:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2323 [2025-03-03 10:56:33,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:33,188 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:33,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 10:56:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 10:56:33,389 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:33,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash -938778592, now seen corresponding path program 1 times [2025-03-03 10:56:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068609708] [2025-03-03 10:56:33,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:33,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-03-03 10:56:33,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-03-03 10:56:33,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:33,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11015 backedges. 6664 proven. 79 refuted. 0 times theorem prover too weak. 4272 trivial. 0 not checked. [2025-03-03 10:56:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068609708] [2025-03-03 10:56:36,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068609708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:36,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650905666] [2025-03-03 10:56:36,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:36,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:36,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:36,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:36,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 10:56:36,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-03-03 10:56:36,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-03-03 10:56:36,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:36,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:36,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:56:36,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11015 backedges. 7019 proven. 250 refuted. 0 times theorem prover too weak. 3746 trivial. 0 not checked. [2025-03-03 10:56:37,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:56:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11015 backedges. 6088 proven. 0 refuted. 0 times theorem prover too weak. 4927 trivial. 0 not checked. [2025-03-03 10:56:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650905666] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:38,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:56:38,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-03 10:56:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359876058] [2025-03-03 10:56:38,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:38,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:38,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:38,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:38,247 INFO L87 Difference]: Start difference. First operand 20073 states and 20371 transitions. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:38,872 INFO L93 Difference]: Finished difference Result 39815 states and 40409 transitions. [2025-03-03 10:56:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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 2322 [2025-03-03 10:56:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:38,886 INFO L225 Difference]: With dead ends: 39815 [2025-03-03 10:56:38,887 INFO L226 Difference]: Without dead ends: 20073 [2025-03-03 10:56:38,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4646 GetRequests, 4641 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:38,892 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 84 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:38,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 18 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-03 10:56:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 20073. [2025-03-03 10:56:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.014647269828617) internal successors, (20366), 20072 states have internal predecessors, (20366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20366 transitions. [2025-03-03 10:56:39,021 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20366 transitions. Word has length 2322 [2025-03-03 10:56:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:39,022 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20366 transitions. [2025-03-03 10:56:39,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:56:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20366 transitions. [2025-03-03 10:56:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2390 [2025-03-03 10:56:39,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:39,050 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:39,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 10:56:39,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 10:56:39,250 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:39,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1654314541, now seen corresponding path program 1 times [2025-03-03 10:56:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:39,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812139254] [2025-03-03 10:56:39,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2389 statements into 1 equivalence classes.