./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label23.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 0ce888a9129ad33560fa4014264bdc8a732894a2cafd0839341c70c58fdd8f98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:36:16,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:36:16,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:36:16,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:36:16,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:36:16,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:36:16,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:36:16,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:36:16,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:36:16,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:36:16,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:36:16,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:36:16,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:36:16,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:36:16,720 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:36:16,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:36:16,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:36:16,720 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:36:16,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:36:16,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:36:16,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:36:16,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:36:16,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:36:16,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:36:16,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:16,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:36:16,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:36:16,722 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:36:16,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:36:16,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:36:16,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:36:16,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:36:16,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:36:16,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:36:16,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:36:16,723 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 -> 0ce888a9129ad33560fa4014264bdc8a732894a2cafd0839341c70c58fdd8f98 [2025-03-03 10:36:16,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:36:16,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:36:16,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:36:16,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:36:16,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:36:16,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label23.c [2025-03-03 10:36:18,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e24d9ce/0b422bea71ce44c0919b19fe959cabec/FLAG40a946559 [2025-03-03 10:36:18,502 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:36:18,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label23.c [2025-03-03 10:36:18,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e24d9ce/0b422bea71ce44c0919b19fe959cabec/FLAG40a946559 [2025-03-03 10:36:18,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e24d9ce/0b422bea71ce44c0919b19fe959cabec [2025-03-03 10:36:18,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:36:18,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:36:18,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:18,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:36:18,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:36:18,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:18" (1/1) ... [2025-03-03 10:36:18,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240f8d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18, skipping insertion in model container [2025-03-03 10:36:18,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:18" (1/1) ... [2025-03-03 10:36:18,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:36:18,864 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/Problem12_label23.c[4581,4594] [2025-03-03 10:36:19,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:19,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:36:19,286 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/Problem12_label23.c[4581,4594] [2025-03-03 10:36:19,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:36:19,547 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:36:19,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19 WrapperNode [2025-03-03 10:36:19,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:36:19,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:19,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:36:19,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:36:19,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:19,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:19,822 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:36:19,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:36:19,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:36:19,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:36:19,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:36:19,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:19,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:19,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:19,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:36:19,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:19,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:20,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:20,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:20,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:20,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:20,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:36:20,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:36:20,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:36:20,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:36:20,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (1/1) ... [2025-03-03 10:36:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:36:20,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:20,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:36:20,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:36:20,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:36:20,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:36:20,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:36:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:36:20,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:36:20,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:36:23,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:36:23,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:36:23,662 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:36:23,782 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:36:23,783 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:36:23,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:36:23,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:36:23,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:23 BoogieIcfgContainer [2025-03-03 10:36:23,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:36:23,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:36:23,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:36:23,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:36:23,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:18" (1/3) ... [2025-03-03 10:36:23,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d0b739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:23, skipping insertion in model container [2025-03-03 10:36:23,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:19" (2/3) ... [2025-03-03 10:36:23,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d0b739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:23, skipping insertion in model container [2025-03-03 10:36:23,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:23" (3/3) ... [2025-03-03 10:36:23,821 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label23.c [2025-03-03 10:36:23,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:36:23,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label23.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:36:23,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:36:23,905 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;@4b3a42f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:36:23,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:36:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 10:36:23,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:23,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:23,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:23,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash -215076475, now seen corresponding path program 1 times [2025-03-03 10:36:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:23,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107540050] [2025-03-03 10:36:23,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 10:36:24,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 10:36:24,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:24,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:24,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:24,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107540050] [2025-03-03 10:36:24,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107540050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559216964] [2025-03-03 10:36:24,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:24,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:24,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:24,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:24,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:24,195 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:27,013 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:36:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-03 10:36:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:27,026 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:36:27,026 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:36:27,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:27,031 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 801 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:27,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 112 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:36:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:36:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:36:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.86578073089701) internal successors, (2808), 1505 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2808 transitions. [2025-03-03 10:36:27,126 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2808 transitions. Word has length 35 [2025-03-03 10:36:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:27,126 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2808 transitions. [2025-03-03 10:36:27,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2808 transitions. [2025-03-03 10:36:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 10:36:27,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:27,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:36:27,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:27,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1849057011, now seen corresponding path program 1 times [2025-03-03 10:36:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:27,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982026463] [2025-03-03 10:36:27,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:27,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 10:36:27,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 10:36:27,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:27,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:27,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982026463] [2025-03-03 10:36:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982026463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:27,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:27,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:27,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846695003] [2025-03-03 10:36:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:27,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:27,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:27,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:27,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:27,327 INFO L87 Difference]: Start difference. First operand 1506 states and 2808 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:29,965 INFO L93 Difference]: Finished difference Result 4514 states and 8420 transitions. [2025-03-03 10:36:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 10:36:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:29,975 INFO L225 Difference]: With dead ends: 4514 [2025-03-03 10:36:29,976 INFO L226 Difference]: Without dead ends: 3010 [2025-03-03 10:36:29,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:29,979 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:29,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 353 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:36:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-03-03 10:36:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-03-03 10:36:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.6511473229132025) internal successors, (4965), 3007 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4965 transitions. [2025-03-03 10:36:30,033 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4965 transitions. Word has length 100 [2025-03-03 10:36:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:30,033 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4965 transitions. [2025-03-03 10:36:30,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4965 transitions. [2025-03-03 10:36:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 10:36:30,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:30,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:30,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:36:30,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash 280455778, now seen corresponding path program 1 times [2025-03-03 10:36:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957294660] [2025-03-03 10:36:30,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:30,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 10:36:30,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 10:36:30,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:30,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957294660] [2025-03-03 10:36:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957294660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:30,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329660867] [2025-03-03 10:36:30,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:30,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:30,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:30,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:30,176 INFO L87 Difference]: Start difference. First operand 3008 states and 4965 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:32,346 INFO L93 Difference]: Finished difference Result 9018 states and 14890 transitions. [2025-03-03 10:36:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-03 10:36:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:32,363 INFO L225 Difference]: With dead ends: 9018 [2025-03-03 10:36:32,364 INFO L226 Difference]: Without dead ends: 6012 [2025-03-03 10:36:32,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:32,372 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 728 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:32,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1439 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [760 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-03 10:36:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012. [2025-03-03 10:36:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.4435202129429379) internal successors, (8677), 6011 states have internal predecessors, (8677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 8677 transitions. [2025-03-03 10:36:32,489 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 8677 transitions. Word has length 106 [2025-03-03 10:36:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:32,491 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 8677 transitions. [2025-03-03 10:36:32,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 8677 transitions. [2025-03-03 10:36:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 10:36:32,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:32,494 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:32,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:36:32,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:32,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1872905676, now seen corresponding path program 1 times [2025-03-03 10:36:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:32,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625278229] [2025-03-03 10:36:32,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:32,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 10:36:32,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 10:36:32,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:32,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625278229] [2025-03-03 10:36:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625278229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:32,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:32,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618387189] [2025-03-03 10:36:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:32,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:32,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:32,601 INFO L87 Difference]: Start difference. First operand 6012 states and 8677 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:34,643 INFO L93 Difference]: Finished difference Result 18030 states and 26026 transitions. [2025-03-03 10:36:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:34,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-03 10:36:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:34,672 INFO L225 Difference]: With dead ends: 18030 [2025-03-03 10:36:34,672 INFO L226 Difference]: Without dead ends: 12020 [2025-03-03 10:36:34,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:34,681 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 769 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:34,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12020 states. [2025-03-03 10:36:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 11269. [2025-03-03 10:36:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.2996095136670216) internal successors, (14644), 11268 states have internal predecessors, (14644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 14644 transitions. [2025-03-03 10:36:34,820 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 14644 transitions. Word has length 115 [2025-03-03 10:36:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:34,821 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 14644 transitions. [2025-03-03 10:36:34,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 14644 transitions. [2025-03-03 10:36:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 10:36:34,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:34,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:34,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:36:34,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:34,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash 212294843, now seen corresponding path program 1 times [2025-03-03 10:36:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314980470] [2025-03-03 10:36:34,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:34,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 10:36:34,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 10:36:34,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:34,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:36:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314980470] [2025-03-03 10:36:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314980470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237235843] [2025-03-03 10:36:35,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:35,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:36:35,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:36:35,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 10:36:35,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 10:36:35,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:35,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:35,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:36:35,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 10:36:35,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:35,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237235843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:35,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:35,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:36:35,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696934462] [2025-03-03 10:36:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:35,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:35,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:35,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:35,569 INFO L87 Difference]: Start difference. First operand 11269 states and 14644 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:37,510 INFO L93 Difference]: Finished difference Result 27793 states and 35253 transitions. [2025-03-03 10:36:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:37,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 180 [2025-03-03 10:36:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:37,538 INFO L225 Difference]: With dead ends: 27793 [2025-03-03 10:36:37,538 INFO L226 Difference]: Without dead ends: 16526 [2025-03-03 10:36:37,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:37,549 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 687 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:37,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 218 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:36:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2025-03-03 10:36:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 15024. [2025-03-03 10:36:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15024 states, 15023 states have (on average 1.2357718165479599) internal successors, (18565), 15023 states have internal predecessors, (18565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15024 states to 15024 states and 18565 transitions. [2025-03-03 10:36:37,747 INFO L78 Accepts]: Start accepts. Automaton has 15024 states and 18565 transitions. Word has length 180 [2025-03-03 10:36:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:37,749 INFO L471 AbstractCegarLoop]: Abstraction has 15024 states and 18565 transitions. [2025-03-03 10:36:37,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15024 states and 18565 transitions. [2025-03-03 10:36:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 10:36:37,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:37,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:36:37,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:36:37,954 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-03 10:36:37,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:37,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:37,956 INFO L85 PathProgramCache]: Analyzing trace with hash 239381911, now seen corresponding path program 1 times [2025-03-03 10:36:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652483414] [2025-03-03 10:36:37,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:37,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 10:36:37,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 10:36:37,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 10:36:38,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:38,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652483414] [2025-03-03 10:36:38,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652483414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:38,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:38,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:36:38,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915420698] [2025-03-03 10:36:38,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:38,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:38,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:38,131 INFO L87 Difference]: Start difference. First operand 15024 states and 18565 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:40,501 INFO L93 Difference]: Finished difference Result 43566 states and 54104 transitions. [2025-03-03 10:36:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:40,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 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 230 [2025-03-03 10:36:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:40,545 INFO L225 Difference]: With dead ends: 43566 [2025-03-03 10:36:40,545 INFO L226 Difference]: Without dead ends: 28544 [2025-03-03 10:36:40,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:40,558 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:40,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 601 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:36:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28544 states. [2025-03-03 10:36:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28544 to 28542. [2025-03-03 10:36:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28542 states, 28541 states have (on average 1.1676535510318489) internal successors, (33326), 28541 states have internal predecessors, (33326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28542 states to 28542 states and 33326 transitions. [2025-03-03 10:36:40,885 INFO L78 Accepts]: Start accepts. Automaton has 28542 states and 33326 transitions. Word has length 230 [2025-03-03 10:36:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:40,885 INFO L471 AbstractCegarLoop]: Abstraction has 28542 states and 33326 transitions. [2025-03-03 10:36:40,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28542 states and 33326 transitions. [2025-03-03 10:36:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 10:36:40,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:40,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:40,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:36:40,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:40,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1169900778, now seen corresponding path program 1 times [2025-03-03 10:36:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:40,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278843336] [2025-03-03 10:36:40,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:40,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 10:36:40,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 10:36:40,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:40,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 10:36:41,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:41,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278843336] [2025-03-03 10:36:41,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278843336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:41,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:41,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:36:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111426915] [2025-03-03 10:36:41,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:41,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:36:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:41,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:36:41,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:41,673 INFO L87 Difference]: Start difference. First operand 28542 states and 33326 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:45,554 INFO L93 Difference]: Finished difference Result 62339 states and 72339 transitions. [2025-03-03 10:36:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:36:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 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 338 [2025-03-03 10:36:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:45,597 INFO L225 Difference]: With dead ends: 62339 [2025-03-03 10:36:45,597 INFO L226 Difference]: Without dead ends: 33799 [2025-03-03 10:36:45,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:36:45,619 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5277 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 5277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:45,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 672 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 5277 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:36:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33799 states. [2025-03-03 10:36:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33799 to 32297. [2025-03-03 10:36:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32297 states, 32296 states have (on average 1.1550346792172406) internal successors, (37303), 32296 states have internal predecessors, (37303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32297 states to 32297 states and 37303 transitions. [2025-03-03 10:36:45,919 INFO L78 Accepts]: Start accepts. Automaton has 32297 states and 37303 transitions. Word has length 338 [2025-03-03 10:36:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:45,919 INFO L471 AbstractCegarLoop]: Abstraction has 32297 states and 37303 transitions. [2025-03-03 10:36:45,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 32297 states and 37303 transitions. [2025-03-03 10:36:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 10:36:45,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:45,924 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:45,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:36:45,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:45,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 108849451, now seen corresponding path program 1 times [2025-03-03 10:36:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728113814] [2025-03-03 10:36:45,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:45,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 10:36:45,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 10:36:45,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:45,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 98 proven. 14 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-03 10:36:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728113814] [2025-03-03 10:36:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728113814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193464136] [2025-03-03 10:36:46,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:46,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:36:46,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:36:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 10:36:46,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 10:36:46,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:46,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:46,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:36:46,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:36:46,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:46,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193464136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:46,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:46,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:36:46,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573062649] [2025-03-03 10:36:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:46,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:46,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:46,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:46,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:46,756 INFO L87 Difference]: Start difference. First operand 32297 states and 37303 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:48,998 INFO L93 Difference]: Finished difference Result 81114 states and 94746 transitions. [2025-03-03 10:36:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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 371 [2025-03-03 10:36:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:49,055 INFO L225 Difference]: With dead ends: 81114 [2025-03-03 10:36:49,055 INFO L226 Difference]: Without dead ends: 48819 [2025-03-03 10:36:49,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:49,073 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 654 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:49,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 534 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48819 states. [2025-03-03 10:36:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48819 to 46566. [2025-03-03 10:36:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46566 states, 46565 states have (on average 1.141715881026522) internal successors, (53164), 46565 states have internal predecessors, (53164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 53164 transitions. [2025-03-03 10:36:49,575 INFO L78 Accepts]: Start accepts. Automaton has 46566 states and 53164 transitions. Word has length 371 [2025-03-03 10:36:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:49,575 INFO L471 AbstractCegarLoop]: Abstraction has 46566 states and 53164 transitions. [2025-03-03 10:36:49,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 46566 states and 53164 transitions. [2025-03-03 10:36:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-03 10:36:49,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:49,582 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:49,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:36:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 10:36:49,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash 10637725, now seen corresponding path program 1 times [2025-03-03 10:36:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760286516] [2025-03-03 10:36:49,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:49,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:36:49,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:36:49,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:49,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 10:36:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760286516] [2025-03-03 10:36:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760286516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552593193] [2025-03-03 10:36:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:49,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:49,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:49,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:49,975 INFO L87 Difference]: Start difference. First operand 46566 states and 53164 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:52,492 INFO L93 Difference]: Finished difference Result 111154 states and 128604 transitions. [2025-03-03 10:36:52,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 391 [2025-03-03 10:36:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:52,578 INFO L225 Difference]: With dead ends: 111154 [2025-03-03 10:36:52,578 INFO L226 Difference]: Without dead ends: 64590 [2025-03-03 10:36:52,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:52,628 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 754 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 887 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 887 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:52,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 279 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [887 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:36:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64590 states. [2025-03-03 10:36:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64590 to 63839. [2025-03-03 10:36:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63839 states, 63838 states have (on average 1.1385225101037) internal successors, (72681), 63838 states have internal predecessors, (72681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63839 states to 63839 states and 72681 transitions. [2025-03-03 10:36:53,344 INFO L78 Accepts]: Start accepts. Automaton has 63839 states and 72681 transitions. Word has length 391 [2025-03-03 10:36:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:53,345 INFO L471 AbstractCegarLoop]: Abstraction has 63839 states and 72681 transitions. [2025-03-03 10:36:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 63839 states and 72681 transitions. [2025-03-03 10:36:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-03 10:36:53,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:53,352 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:53,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:36:53,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1833181031, now seen corresponding path program 1 times [2025-03-03 10:36:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100149171] [2025-03-03 10:36:53,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:53,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-03 10:36:53,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-03 10:36:53,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:53,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-03 10:36:53,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100149171] [2025-03-03 10:36:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100149171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:53,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:53,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:53,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242721430] [2025-03-03 10:36:53,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:53,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:53,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:53,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:53,807 INFO L87 Difference]: Start difference. First operand 63839 states and 72681 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:56,160 INFO L93 Difference]: Finished difference Result 137476 states and 155742 transitions. [2025-03-03 10:36:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:56,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 409 [2025-03-03 10:36:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:56,229 INFO L225 Difference]: With dead ends: 137476 [2025-03-03 10:36:56,230 INFO L226 Difference]: Without dead ends: 73602 [2025-03-03 10:36:56,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:36:56,260 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:56,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73602 states. [2025-03-03 10:36:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73602 to 73602. [2025-03-03 10:36:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73602 states, 73601 states have (on average 1.1199983695873696) internal successors, (82433), 73601 states have internal predecessors, (82433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73602 states to 73602 states and 82433 transitions. [2025-03-03 10:36:56,903 INFO L78 Accepts]: Start accepts. Automaton has 73602 states and 82433 transitions. Word has length 409 [2025-03-03 10:36:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:56,903 INFO L471 AbstractCegarLoop]: Abstraction has 73602 states and 82433 transitions. [2025-03-03 10:36:56,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 73602 states and 82433 transitions. [2025-03-03 10:36:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-03 10:36:56,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:56,908 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-03-03 10:36:56,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:36:56,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2031130265, now seen corresponding path program 1 times [2025-03-03 10:36:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560094168] [2025-03-03 10:36:56,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:56,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-03 10:36:56,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-03 10:36:56,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:56,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 10:36:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560094168] [2025-03-03 10:36:57,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560094168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:57,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:57,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783810740] [2025-03-03 10:36:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:57,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:57,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:57,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:57,249 INFO L87 Difference]: Start difference. First operand 73602 states and 82433 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:59,733 INFO L93 Difference]: Finished difference Result 180246 states and 201632 transitions. [2025-03-03 10:36:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:59,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 452 [2025-03-03 10:36:59,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:59,945 INFO L225 Difference]: With dead ends: 180246 [2025-03-03 10:36:59,945 INFO L226 Difference]: Without dead ends: 106646 [2025-03-03 10:36:59,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:59,982 INFO L435 NwaCegarLoop]: 1245 mSDtfsCounter, 642 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:59,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1253 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:37:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106646 states. [2025-03-03 10:37:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106646 to 99887. [2025-03-03 10:37:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99887 states, 99886 states have (on average 1.1150411469074746) internal successors, (111377), 99886 states have internal predecessors, (111377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99887 states to 99887 states and 111377 transitions. [2025-03-03 10:37:01,177 INFO L78 Accepts]: Start accepts. Automaton has 99887 states and 111377 transitions. Word has length 452 [2025-03-03 10:37:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:01,178 INFO L471 AbstractCegarLoop]: Abstraction has 99887 states and 111377 transitions. [2025-03-03 10:37:01,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 99887 states and 111377 transitions. [2025-03-03 10:37:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 10:37:01,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:01,185 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-03-03 10:37:01,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:37:01,185 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1221118947, now seen corresponding path program 1 times [2025-03-03 10:37:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924310834] [2025-03-03 10:37:01,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:01,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 10:37:01,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 10:37:01,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:01,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:37:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924310834] [2025-03-03 10:37:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924310834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:01,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847692856] [2025-03-03 10:37:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:01,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:01,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:01,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:01,532 INFO L87 Difference]: Start difference. First operand 99887 states and 111377 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:03,819 INFO L93 Difference]: Finished difference Result 202025 states and 225082 transitions. [2025-03-03 10:37:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 456 [2025-03-03 10:37:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:03,922 INFO L225 Difference]: With dead ends: 202025 [2025-03-03 10:37:03,922 INFO L226 Difference]: Without dead ends: 98385 [2025-03-03 10:37:03,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:03,968 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 725 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:03,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1237 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:37:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98385 states. [2025-03-03 10:37:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98385 to 86369. [2025-03-03 10:37:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86369 states, 86368 states have (on average 1.0741594108929233) internal successors, (92773), 86368 states have internal predecessors, (92773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86369 states to 86369 states and 92773 transitions. [2025-03-03 10:37:04,754 INFO L78 Accepts]: Start accepts. Automaton has 86369 states and 92773 transitions. Word has length 456 [2025-03-03 10:37:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:04,755 INFO L471 AbstractCegarLoop]: Abstraction has 86369 states and 92773 transitions. [2025-03-03 10:37:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 86369 states and 92773 transitions. [2025-03-03 10:37:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 10:37:04,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:04,768 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:37:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:37:04,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:04,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -671734303, now seen corresponding path program 1 times [2025-03-03 10:37:04,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:04,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155839935] [2025-03-03 10:37:04,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:04,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 10:37:04,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 10:37:04,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 474 proven. 229 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 10:37:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:05,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155839935] [2025-03-03 10:37:05,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155839935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:37:05,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796063526] [2025-03-03 10:37:05,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:05,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:05,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:37:05,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:37:05,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:37:05,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 10:37:05,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 10:37:05,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:05,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:05,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:37:05,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:37:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-03 10:37:05,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:37:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796063526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:05,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:37:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:37:05,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337345297] [2025-03-03 10:37:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:05,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:05,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:05,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:37:05,589 INFO L87 Difference]: Start difference. First operand 86369 states and 92773 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:08,013 INFO L93 Difference]: Finished difference Result 190760 states and 206270 transitions. [2025-03-03 10:37:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 532 [2025-03-03 10:37:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:08,146 INFO L225 Difference]: With dead ends: 190760 [2025-03-03 10:37:08,146 INFO L226 Difference]: Without dead ends: 104393 [2025-03-03 10:37:08,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:37:08,190 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 654 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:08,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1391 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104393 states. [2025-03-03 10:37:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104393 to 98385. [2025-03-03 10:37:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.0667384940640754) internal successors, (104950), 98384 states have internal predecessors, (104950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 104950 transitions. [2025-03-03 10:37:09,472 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 104950 transitions. Word has length 532 [2025-03-03 10:37:09,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:09,473 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 104950 transitions. [2025-03-03 10:37:09,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 104950 transitions. [2025-03-03 10:37:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2025-03-03 10:37:09,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:09,494 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:09,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:37:09,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:37:09,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:09,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:09,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1214687263, now seen corresponding path program 1 times [2025-03-03 10:37:09,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:09,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683640351] [2025-03-03 10:37:09,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:09,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:09,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-03-03 10:37:09,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-03-03 10:37:09,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:09,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 10:37:10,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:10,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683640351] [2025-03-03 10:37:10,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683640351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:10,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:10,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:10,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645183112] [2025-03-03 10:37:10,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:10,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:10,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:10,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:10,093 INFO L87 Difference]: Start difference. First operand 98385 states and 104950 transitions. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:12,823 INFO L93 Difference]: Finished difference Result 235820 states and 252438 transitions. [2025-03-03 10:37:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 619 [2025-03-03 10:37:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:12,984 INFO L225 Difference]: With dead ends: 235820 [2025-03-03 10:37:12,984 INFO L226 Difference]: Without dead ends: 138188 [2025-03-03 10:37:13,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:13,056 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 483 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:13,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 569 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:37:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138188 states. [2025-03-03 10:37:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138188 to 130678. [2025-03-03 10:37:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130678 states, 130677 states have (on average 1.065520328749512) internal successors, (139239), 130677 states have internal predecessors, (139239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130678 states to 130678 states and 139239 transitions. [2025-03-03 10:37:14,729 INFO L78 Accepts]: Start accepts. Automaton has 130678 states and 139239 transitions. Word has length 619 [2025-03-03 10:37:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:14,730 INFO L471 AbstractCegarLoop]: Abstraction has 130678 states and 139239 transitions. [2025-03-03 10:37:14,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 130678 states and 139239 transitions. [2025-03-03 10:37:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-03-03 10:37:14,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:14,750 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:37:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:37:14,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:14,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash 69144487, now seen corresponding path program 1 times [2025-03-03 10:37:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490118095] [2025-03-03 10:37:14,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:14,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-03 10:37:14,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-03 10:37:14,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:14,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-03 10:37:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490118095] [2025-03-03 10:37:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490118095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735902359] [2025-03-03 10:37:14,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:14,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:14,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:14,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:14,933 INFO L87 Difference]: Start difference. First operand 130678 states and 139239 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:17,699 INFO L93 Difference]: Finished difference Result 299655 states and 320258 transitions. [2025-03-03 10:37:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:17,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 648 [2025-03-03 10:37:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:17,932 INFO L225 Difference]: With dead ends: 299655 [2025-03-03 10:37:17,932 INFO L226 Difference]: Without dead ends: 169730 [2025-03-03 10:37:17,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:18,000 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 481 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:18,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1303 Invalid, 2832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:37:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169730 states. [2025-03-03 10:37:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169730 to 157714. [2025-03-03 10:37:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157714 states, 157713 states have (on average 1.0612885431131232) internal successors, (167379), 157713 states have internal predecessors, (167379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157714 states to 157714 states and 167379 transitions. [2025-03-03 10:37:19,796 INFO L78 Accepts]: Start accepts. Automaton has 157714 states and 167379 transitions. Word has length 648 [2025-03-03 10:37:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:19,797 INFO L471 AbstractCegarLoop]: Abstraction has 157714 states and 167379 transitions. [2025-03-03 10:37:19,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 157714 states and 167379 transitions. [2025-03-03 10:37:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-03 10:37:19,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:19,821 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:19,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:37:19,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:19,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1857087264, now seen corresponding path program 1 times [2025-03-03 10:37:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:19,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187062418] [2025-03-03 10:37:19,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:19,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:19,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-03-03 10:37:19,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-03-03 10:37:19,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-03 10:37:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:20,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187062418] [2025-03-03 10:37:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187062418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:20,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606949184] [2025-03-03 10:37:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:20,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:20,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:20,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:20,386 INFO L87 Difference]: Start difference. First operand 157714 states and 167379 transitions. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:23,015 INFO L93 Difference]: Finished difference Result 314675 states and 334000 transitions. [2025-03-03 10:37:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 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 764 [2025-03-03 10:37:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:23,212 INFO L225 Difference]: With dead ends: 314675 [2025-03-03 10:37:23,212 INFO L226 Difference]: Without dead ends: 157714 [2025-03-03 10:37:23,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:23,304 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 405 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1270 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:37:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157714 states. [2025-03-03 10:37:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157714 to 155461. [2025-03-03 10:37:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155461 states, 155460 states have (on average 1.0425061108966938) internal successors, (162068), 155460 states have internal predecessors, (162068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155461 states to 155461 states and 162068 transitions. [2025-03-03 10:37:24,991 INFO L78 Accepts]: Start accepts. Automaton has 155461 states and 162068 transitions. Word has length 764 [2025-03-03 10:37:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:24,991 INFO L471 AbstractCegarLoop]: Abstraction has 155461 states and 162068 transitions. [2025-03-03 10:37:24,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 155461 states and 162068 transitions. [2025-03-03 10:37:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 10:37:25,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:25,015 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:37:25,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:37:25,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:25,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash 14433275, now seen corresponding path program 1 times [2025-03-03 10:37:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:25,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232673900] [2025-03-03 10:37:25,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:25,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 10:37:25,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 10:37:25,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:25,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 685 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-03 10:37:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:25,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232673900] [2025-03-03 10:37:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232673900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731862418] [2025-03-03 10:37:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:25,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:37:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:25,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:37:25,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:25,511 INFO L87 Difference]: Start difference. First operand 155461 states and 162068 transitions. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:27,993 INFO L93 Difference]: Finished difference Result 336454 states and 350353 transitions. [2025-03-03 10:37:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:37:27,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 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 779 [2025-03-03 10:37:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:28,187 INFO L225 Difference]: With dead ends: 336454 [2025-03-03 10:37:28,187 INFO L226 Difference]: Without dead ends: 181746 [2025-03-03 10:37:28,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:37:28,272 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 449 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:28,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 202 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:37:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181746 states. [2025-03-03 10:37:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181746 to 157714. [2025-03-03 10:37:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157714 states, 157713 states have (on average 1.040345437598676) internal successors, (164076), 157713 states have internal predecessors, (164076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157714 states to 157714 states and 164076 transitions. [2025-03-03 10:37:30,285 INFO L78 Accepts]: Start accepts. Automaton has 157714 states and 164076 transitions. Word has length 779 [2025-03-03 10:37:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:30,285 INFO L471 AbstractCegarLoop]: Abstraction has 157714 states and 164076 transitions. [2025-03-03 10:37:30,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 157714 states and 164076 transitions. [2025-03-03 10:37:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-03-03 10:37:30,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:30,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:37:30,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:37:30,323 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:30,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1688538423, now seen corresponding path program 1 times [2025-03-03 10:37:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216797003] [2025-03-03 10:37:30,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:30,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-03-03 10:37:30,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-03-03 10:37:30,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:30,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:37:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:37:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:37:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216797003] [2025-03-03 10:37:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216797003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:37:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:37:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:37:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772135027] [2025-03-03 10:37:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:37:31,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:37:31,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:37:31,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:37:31,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:37:31,464 INFO L87 Difference]: Start difference. First operand 157714 states and 164076 transitions. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:37:35,854 INFO L93 Difference]: Finished difference Result 478393 states and 498661 transitions. [2025-03-03 10:37:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:37:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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 796 [2025-03-03 10:37:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:37:36,238 INFO L225 Difference]: With dead ends: 478393 [2025-03-03 10:37:36,238 INFO L226 Difference]: Without dead ends: 321432 [2025-03-03 10:37:36,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:37:36,304 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1450 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4821 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 5319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 4821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:37:36,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 89 Invalid, 5319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 4821 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 10:37:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321432 states. [2025-03-03 10:37:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321432 to 319930. [2025-03-03 10:37:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319930 states, 319929 states have (on average 1.0399432374057993) internal successors, (332708), 319929 states have internal predecessors, (332708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319930 states to 319930 states and 332708 transitions. [2025-03-03 10:37:39,971 INFO L78 Accepts]: Start accepts. Automaton has 319930 states and 332708 transitions. Word has length 796 [2025-03-03 10:37:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:37:39,972 INFO L471 AbstractCegarLoop]: Abstraction has 319930 states and 332708 transitions. [2025-03-03 10:37:39,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:37:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 319930 states and 332708 transitions. [2025-03-03 10:37:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-03-03 10:37:40,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:37:40,017 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:37:40,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:37:40,018 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:37:40,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:37:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2129116781, now seen corresponding path program 1 times [2025-03-03 10:37:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:37:40,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928376422] [2025-03-03 10:37:40,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:37:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:37:40,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-03-03 10:37:40,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-03-03 10:37:40,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:37:40,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat