./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label17.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 6848db2ddd2556f2093bbcb0368e7a4f47fdd5c1a9995f9fb65bc5fd459ece0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:20:23,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:20:23,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:20:23,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:20:23,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:20:23,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:20:23,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:20:23,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:20:23,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:20:23,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:20:23,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:20:23,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:20:23,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:20:23,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:20:23,077 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:20:23,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:20:23,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:20:23,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:20:23,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:20:23,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:20:23,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:20:23,080 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 -> 6848db2ddd2556f2093bbcb0368e7a4f47fdd5c1a9995f9fb65bc5fd459ece0d [2025-03-08 02:20:23,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:20:23,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:20:23,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:20:23,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:20:23,305 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:20:23,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label17.c [2025-03-08 02:20:24,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815ebc7b/1355aea80a0d4ec59470f388bf3f790d/FLAGa883071f2 [2025-03-08 02:20:25,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:20:25,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label17.c [2025-03-08 02:20:25,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815ebc7b/1355aea80a0d4ec59470f388bf3f790d/FLAGa883071f2 [2025-03-08 02:20:25,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815ebc7b/1355aea80a0d4ec59470f388bf3f790d [2025-03-08 02:20:25,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:20:25,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:20:25,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:20:25,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:20:25,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:20:25,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:20:25" (1/1) ... [2025-03-08 02:20:25,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad67a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:25, skipping insertion in model container [2025-03-08 02:20:25,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:20:25" (1/1) ... [2025-03-08 02:20:25,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:20:25,973 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/Problem19_label17.c[1799,1812] [2025-03-08 02:20:26,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:20:26,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:20:26,685 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/Problem19_label17.c[1799,1812] [2025-03-08 02:20:27,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:20:27,154 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:20:27,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27 WrapperNode [2025-03-08 02:20:27,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:20:27,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:20:27,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:20:27,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:20:27,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:27,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:27,883 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:20:27,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:20:27,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:20:27,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:20:27,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:20:27,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:27,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:20:28,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:20:28,590 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:20:28,590 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:20:28,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:20:28,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (1/1) ... [2025-03-08 02:20:28,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:20:28,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:20:28,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:20:28,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:20:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:20:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:20:28,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:20:28,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:20:28,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:20:28,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:20:34,490 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:20:34,490 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:20:34,491 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:20:34,491 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:20:34,491 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:20:34,795 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:20:34,796 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:20:34,838 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:20:34,839 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:20:34,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:20:34 BoogieIcfgContainer [2025-03-08 02:20:34,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:20:34,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:20:34,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:20:34,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:20:34,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:20:25" (1/3) ... [2025-03-08 02:20:34,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b4c972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:20:34, skipping insertion in model container [2025-03-08 02:20:34,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:27" (2/3) ... [2025-03-08 02:20:34,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b4c972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:20:34, skipping insertion in model container [2025-03-08 02:20:34,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:20:34" (3/3) ... [2025-03-08 02:20:34,849 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label17.c [2025-03-08 02:20:34,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:20:34,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label17.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:20:34,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:20:34,960 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;@3876f046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:20:34,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:20:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 02:20:34,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:34,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:34,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:34,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:34,979 INFO L85 PathProgramCache]: Analyzing trace with hash -143478376, now seen corresponding path program 1 times [2025-03-08 02:20:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:34,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437830938] [2025-03-08 02:20:34,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:35,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 02:20:35,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 02:20:35,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:35,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:20:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437830938] [2025-03-08 02:20:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437830938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:20:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207790533] [2025-03-08 02:20:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:35,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:20:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:35,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:20:35,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:35,185 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:40,882 INFO L93 Difference]: Finished difference Result 4957 states and 9395 transitions. [2025-03-08 02:20:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:20:40,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-08 02:20:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:40,908 INFO L225 Difference]: With dead ends: 4957 [2025-03-08 02:20:40,909 INFO L226 Difference]: Without dead ends: 3129 [2025-03-08 02:20:40,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:40,921 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 1616 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:40,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1616 Valid, 1598 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-08 02:20:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-03-08 02:20:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3108. [2025-03-08 02:20:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4975 transitions. [2025-03-08 02:20:41,071 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4975 transitions. Word has length 10 [2025-03-08 02:20:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 4975 transitions. [2025-03-08 02:20:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4975 transitions. [2025-03-08 02:20:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 02:20:41,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:41,074 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:20:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:20:41,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:41,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 439524667, now seen corresponding path program 1 times [2025-03-08 02:20:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591616375] [2025-03-08 02:20:41,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:41,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 02:20:41,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 02:20:41,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:41,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:20:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:41,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591616375] [2025-03-08 02:20:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591616375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423719188] [2025-03-08 02:20:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:41,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:20:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:41,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:20:41,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:41,449 INFO L87 Difference]: Start difference. First operand 3108 states and 4975 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:48,860 INFO L93 Difference]: Finished difference Result 10359 states and 16187 transitions. [2025-03-08 02:20:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:20:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-08 02:20:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:48,886 INFO L225 Difference]: With dead ends: 10359 [2025-03-08 02:20:48,887 INFO L226 Difference]: Without dead ends: 7253 [2025-03-08 02:20:48,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:20:48,893 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 4321 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9504 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 11002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 9504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:48,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 1298 Invalid, 11002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1498 Valid, 9504 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-08 02:20:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2025-03-08 02:20:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7249. [2025-03-08 02:20:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 7248 states have (on average 1.4501931567328918) internal successors, (10511), 7248 states have internal predecessors, (10511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10511 transitions. [2025-03-08 02:20:49,014 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10511 transitions. Word has length 77 [2025-03-08 02:20:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:49,015 INFO L471 AbstractCegarLoop]: Abstraction has 7249 states and 10511 transitions. [2025-03-08 02:20:49,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10511 transitions. [2025-03-08 02:20:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-08 02:20:49,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:49,028 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:49,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:20:49,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 100427847, now seen corresponding path program 1 times [2025-03-08 02:20:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720197825] [2025-03-08 02:20:49,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-08 02:20:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-08 02:20:49,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 02:20:49,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720197825] [2025-03-08 02:20:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720197825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:49,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81640817] [2025-03-08 02:20:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:49,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:20:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:49,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:20:49,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:49,852 INFO L87 Difference]: Start difference. First operand 7249 states and 10511 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:56,217 INFO L93 Difference]: Finished difference Result 17269 states and 24865 transitions. [2025-03-08 02:20:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:20:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 294 [2025-03-08 02:20:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:56,257 INFO L225 Difference]: With dead ends: 17269 [2025-03-08 02:20:56,257 INFO L226 Difference]: Without dead ends: 11387 [2025-03-08 02:20:56,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:20:56,268 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 9885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:56,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2159 Invalid, 9885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-03-08 02:20:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2025-03-08 02:20:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 11367. [2025-03-08 02:20:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.328523667077248) internal successors, (15100), 11366 states have internal predecessors, (15100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15100 transitions. [2025-03-08 02:20:56,482 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15100 transitions. Word has length 294 [2025-03-08 02:20:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:56,485 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15100 transitions. [2025-03-08 02:20:56,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15100 transitions. [2025-03-08 02:20:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-08 02:20:56,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:56,488 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:20:56,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash 25785717, now seen corresponding path program 1 times [2025-03-08 02:20:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333828852] [2025-03-08 02:20:56,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-08 02:20:56,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-08 02:20:56,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:56,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:20:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333828852] [2025-03-08 02:20:56,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333828852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:56,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:56,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141763391] [2025-03-08 02:20:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:56,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:20:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:56,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:20:56,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:56,971 INFO L87 Difference]: Start difference. First operand 11367 states and 15100 transitions. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:01,600 INFO L93 Difference]: Finished difference Result 20033 states and 27481 transitions. [2025-03-08 02:21:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:01,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 322 [2025-03-08 02:21:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:01,627 INFO L225 Difference]: With dead ends: 20033 [2025-03-08 02:21:01,627 INFO L226 Difference]: Without dead ends: 11367 [2025-03-08 02:21:01,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:01,636 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:01,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 02:21:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11367 states. [2025-03-08 02:21:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11367 to 11367. [2025-03-08 02:21:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.327379904979764) internal successors, (15087), 11366 states have internal predecessors, (15087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15087 transitions. [2025-03-08 02:21:01,770 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15087 transitions. Word has length 322 [2025-03-08 02:21:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:01,771 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15087 transitions. [2025-03-08 02:21:01,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15087 transitions. [2025-03-08 02:21:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-08 02:21:01,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:01,778 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:01,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:21:01,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:01,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:01,779 INFO L85 PathProgramCache]: Analyzing trace with hash 291428058, now seen corresponding path program 1 times [2025-03-08 02:21:01,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:01,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54727451] [2025-03-08 02:21:01,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:01,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 02:21:01,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 02:21:01,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:01,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 02:21:02,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:02,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54727451] [2025-03-08 02:21:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54727451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:21:02,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855360137] [2025-03-08 02:21:02,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:02,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:21:02,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:21:02,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:21:02,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:21:02,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 02:21:02,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 02:21:02,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:02,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:02,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:21:02,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:21:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:02,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:21:02,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855360137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:02,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:21:02,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:21:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422286301] [2025-03-08 02:21:02,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:02,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:02,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:02,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:02,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:21:02,721 INFO L87 Difference]: Start difference. First operand 11367 states and 15087 transitions. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:07,140 INFO L93 Difference]: Finished difference Result 28211 states and 39183 transitions. [2025-03-08 02:21:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:07,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 566 [2025-03-08 02:21:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:07,170 INFO L225 Difference]: With dead ends: 28211 [2025-03-08 02:21:07,170 INFO L226 Difference]: Without dead ends: 19576 [2025-03-08 02:21:07,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:21:07,183 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 1775 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 5582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:07,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 1445 Invalid, 5582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 02:21:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2025-03-08 02:21:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 19575. [2025-03-08 02:21:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19575 states, 19574 states have (on average 1.2423623173597629) internal successors, (24318), 19574 states have internal predecessors, (24318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19575 states to 19575 states and 24318 transitions. [2025-03-08 02:21:07,369 INFO L78 Accepts]: Start accepts. Automaton has 19575 states and 24318 transitions. Word has length 566 [2025-03-08 02:21:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:07,370 INFO L471 AbstractCegarLoop]: Abstraction has 19575 states and 24318 transitions. [2025-03-08 02:21:07,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 19575 states and 24318 transitions. [2025-03-08 02:21:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 02:21:07,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:07,381 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:07,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:21:07,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:21:07,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:07,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash -77367974, now seen corresponding path program 1 times [2025-03-08 02:21:07,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:07,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081477137] [2025-03-08 02:21:07,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:07,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 02:21:07,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 02:21:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081477137] [2025-03-08 02:21:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081477137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525191970] [2025-03-08 02:21:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:07,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:07,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:07,989 INFO L87 Difference]: Start difference. First operand 19575 states and 24318 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:12,518 INFO L93 Difference]: Finished difference Result 46052 states and 59454 transitions. [2025-03-08 02:21:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 571 [2025-03-08 02:21:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:12,562 INFO L225 Difference]: With dead ends: 46052 [2025-03-08 02:21:12,562 INFO L226 Difference]: Without dead ends: 29209 [2025-03-08 02:21:12,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:12,573 INFO L435 NwaCegarLoop]: 2993 mSDtfsCounter, 1421 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4130 mSolverCounterSat, 1663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1663 IncrementalHoareTripleChecker+Valid, 4130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:12,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 3163 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1663 Valid, 4130 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 02:21:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29209 states. [2025-03-08 02:21:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29209 to 27797. [2025-03-08 02:21:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27797 states, 27796 states have (on average 1.223125629586991) internal successors, (33998), 27796 states have internal predecessors, (33998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27797 states to 27797 states and 33998 transitions. [2025-03-08 02:21:12,847 INFO L78 Accepts]: Start accepts. Automaton has 27797 states and 33998 transitions. Word has length 571 [2025-03-08 02:21:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:12,847 INFO L471 AbstractCegarLoop]: Abstraction has 27797 states and 33998 transitions. [2025-03-08 02:21:12,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27797 states and 33998 transitions. [2025-03-08 02:21:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 02:21:12,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:12,858 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:12,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:21:12,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -72692794, now seen corresponding path program 1 times [2025-03-08 02:21:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844059350] [2025-03-08 02:21:12,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:12,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 02:21:12,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 02:21:12,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:12,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 02:21:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844059350] [2025-03-08 02:21:13,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844059350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:13,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:13,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897924726] [2025-03-08 02:21:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:13,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:13,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:13,162 INFO L87 Difference]: Start difference. First operand 27797 states and 33998 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:17,966 INFO L93 Difference]: Finished difference Result 76271 states and 94708 transitions. [2025-03-08 02:21:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 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 574 [2025-03-08 02:21:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:18,037 INFO L225 Difference]: With dead ends: 76271 [2025-03-08 02:21:18,037 INFO L226 Difference]: Without dead ends: 51206 [2025-03-08 02:21:18,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:18,063 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 2111 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5097 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:18,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 964 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5097 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 02:21:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51206 states. [2025-03-08 02:21:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51206 to 49837. [2025-03-08 02:21:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49837 states, 49836 states have (on average 1.2111525804639216) internal successors, (60359), 49836 states have internal predecessors, (60359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49837 states to 49837 states and 60359 transitions. [2025-03-08 02:21:18,521 INFO L78 Accepts]: Start accepts. Automaton has 49837 states and 60359 transitions. Word has length 574 [2025-03-08 02:21:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 49837 states and 60359 transitions. [2025-03-08 02:21:18,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 49837 states and 60359 transitions. [2025-03-08 02:21:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2025-03-08 02:21:18,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:18,527 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:21:18,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:18,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -903249169, now seen corresponding path program 1 times [2025-03-08 02:21:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941188777] [2025-03-08 02:21:18,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:18,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-03-08 02:21:18,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-03-08 02:21:18,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:18,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 02:21:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941188777] [2025-03-08 02:21:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941188777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483401570] [2025-03-08 02:21:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:19,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:19,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:19,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:19,060 INFO L87 Difference]: Start difference. First operand 49837 states and 60359 transitions. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:23,799 INFO L93 Difference]: Finished difference Result 114727 states and 142448 transitions. [2025-03-08 02:21:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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 803 [2025-03-08 02:21:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:23,876 INFO L225 Difference]: With dead ends: 114727 [2025-03-08 02:21:23,876 INFO L226 Difference]: Without dead ends: 67622 [2025-03-08 02:21:23,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:23,902 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 1549 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 1699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 5735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1699 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:23,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1672 Invalid, 5735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1699 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:21:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2025-03-08 02:21:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 49783. [2025-03-08 02:21:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49783 states, 49782 states have (on average 1.2108191715881242) internal successors, (60277), 49782 states have internal predecessors, (60277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49783 states to 49783 states and 60277 transitions. [2025-03-08 02:21:24,414 INFO L78 Accepts]: Start accepts. Automaton has 49783 states and 60277 transitions. Word has length 803 [2025-03-08 02:21:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:24,415 INFO L471 AbstractCegarLoop]: Abstraction has 49783 states and 60277 transitions. [2025-03-08 02:21:24,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 49783 states and 60277 transitions. [2025-03-08 02:21:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-08 02:21:24,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:24,421 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:24,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:21:24,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:24,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:24,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2016909172, now seen corresponding path program 1 times [2025-03-08 02:21:24,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:24,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346813562] [2025-03-08 02:21:24,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:24,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:24,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-08 02:21:24,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-08 02:21:24,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:24,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-08 02:21:24,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:24,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346813562] [2025-03-08 02:21:24,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346813562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:24,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:24,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007262228] [2025-03-08 02:21:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:24,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:24,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:24,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:24,778 INFO L87 Difference]: Start difference. First operand 49783 states and 60277 transitions. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:29,173 INFO L93 Difference]: Finished difference Result 115967 states and 141280 transitions. [2025-03-08 02:21:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:29,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 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 827 [2025-03-08 02:21:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:29,243 INFO L225 Difference]: With dead ends: 115967 [2025-03-08 02:21:29,243 INFO L226 Difference]: Without dead ends: 68916 [2025-03-08 02:21:29,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:29,279 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 1371 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 2082 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 6008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2082 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:29,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 746 Invalid, 6008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2082 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 02:21:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68916 states. [2025-03-08 02:21:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68916 to 68899. [2025-03-08 02:21:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68899 states, 68898 states have (on average 1.1851287410374758) internal successors, (81653), 68898 states have internal predecessors, (81653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68899 states to 68899 states and 81653 transitions. [2025-03-08 02:21:29,935 INFO L78 Accepts]: Start accepts. Automaton has 68899 states and 81653 transitions. Word has length 827 [2025-03-08 02:21:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:29,936 INFO L471 AbstractCegarLoop]: Abstraction has 68899 states and 81653 transitions. [2025-03-08 02:21:29,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 68899 states and 81653 transitions. [2025-03-08 02:21:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-03-08 02:21:29,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:29,942 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:29,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:21:29,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:29,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash -87176229, now seen corresponding path program 1 times [2025-03-08 02:21:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193210479] [2025-03-08 02:21:29,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:29,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-03-08 02:21:30,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-03-08 02:21:30,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:30,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 02:21:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193210479] [2025-03-08 02:21:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193210479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958706742] [2025-03-08 02:21:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:30,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:30,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:30,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:30,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:30,863 INFO L87 Difference]: Start difference. First operand 68899 states and 81653 transitions. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:35,732 INFO L93 Difference]: Finished difference Result 174747 states and 209480 transitions. [2025-03-08 02:21:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:35,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 869 [2025-03-08 02:21:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:35,852 INFO L225 Difference]: With dead ends: 174747 [2025-03-08 02:21:35,852 INFO L226 Difference]: Without dead ends: 108580 [2025-03-08 02:21:35,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:35,893 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1549 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4245 mSolverCounterSat, 2310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 6555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2310 IncrementalHoareTripleChecker+Valid, 4245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:35,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 643 Invalid, 6555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2310 Valid, 4245 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:21:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108580 states. [2025-03-08 02:21:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108580 to 100293. [2025-03-08 02:21:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100293 states, 100292 states have (on average 1.2114625294141108) internal successors, (121500), 100292 states have internal predecessors, (121500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100293 states to 100293 states and 121500 transitions. [2025-03-08 02:21:36,780 INFO L78 Accepts]: Start accepts. Automaton has 100293 states and 121500 transitions. Word has length 869 [2025-03-08 02:21:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:36,781 INFO L471 AbstractCegarLoop]: Abstraction has 100293 states and 121500 transitions. [2025-03-08 02:21:36,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 100293 states and 121500 transitions. [2025-03-08 02:21:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2025-03-08 02:21:36,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:36,787 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:36,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:21:36,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:36,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:36,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1382716501, now seen corresponding path program 1 times [2025-03-08 02:21:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:36,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021928363] [2025-03-08 02:21:36,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:36,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 900 statements into 1 equivalence classes. [2025-03-08 02:21:36,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 900 of 900 statements. [2025-03-08 02:21:36,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:36,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 02:21:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021928363] [2025-03-08 02:21:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021928363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:37,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:37,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364139701] [2025-03-08 02:21:37,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:37,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:37,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:37,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:37,179 INFO L87 Difference]: Start difference. First operand 100293 states and 121500 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-08 02:21:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:41,503 INFO L93 Difference]: Finished difference Result 201959 states and 244458 transitions. [2025-03-08 02:21:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:41,504 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 900 [2025-03-08 02:21:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:41,828 INFO L225 Difference]: With dead ends: 201959 [2025-03-08 02:21:41,828 INFO L226 Difference]: Without dead ends: 104398 [2025-03-08 02:21:41,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:41,857 INFO L435 NwaCegarLoop]: 2870 mSDtfsCounter, 1501 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 1461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1461 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:41,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 3043 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1461 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 02:21:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104398 states. [2025-03-08 02:21:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104398 to 100291. [2025-03-08 02:21:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100291 states, 100290 states have (on average 1.153056137202114) internal successors, (115640), 100290 states have internal predecessors, (115640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:21:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100291 states to 100291 states and 115640 transitions. [2025-03-08 02:21:43,250 INFO L78 Accepts]: Start accepts. Automaton has 100291 states and 115640 transitions. Word has length 900 [2025-03-08 02:21:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:43,250 INFO L471 AbstractCegarLoop]: Abstraction has 100291 states and 115640 transitions. [2025-03-08 02:21:43,250 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-08 02:21:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 100291 states and 115640 transitions. [2025-03-08 02:21:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2025-03-08 02:21:43,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:43,274 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:43,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:21:43,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:43,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1034232299, now seen corresponding path program 1 times [2025-03-08 02:21:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:43,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080463422] [2025-03-08 02:21:43,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 967 statements into 1 equivalence classes. [2025-03-08 02:21:43,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 967 of 967 statements. [2025-03-08 02:21:43,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:43,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-08 02:21:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080463422] [2025-03-08 02:21:43,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080463422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:43,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:43,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:21:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262240129] [2025-03-08 02:21:43,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:43,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:43,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:43,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:43,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:43,819 INFO L87 Difference]: Start difference. First operand 100291 states and 115640 transitions. Second operand has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)