./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label16.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 12946011ae947529b791d0ea774eddb13cd60d584cd7e2008a422f41653953d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:08:50,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:08:50,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:08:50,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:08:50,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:08:50,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:08:50,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:08:50,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:08:50,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:08:50,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:08:50,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:08:50,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:08:50,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:08:50,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:08:50,831 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:08:50,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:08:50,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:08:50,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:08:50,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:08:50,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:08:50,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:08:50,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:08:50,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:08:50,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:08:50,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:08:50,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:08:50,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:08:50,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:08:50,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:08:50,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:08:50,833 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 -> 12946011ae947529b791d0ea774eddb13cd60d584cd7e2008a422f41653953d6 [2025-03-08 02:08:51,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:08:51,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:08:51,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:08:51,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:08:51,086 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:08:51,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label16.c [2025-03-08 02:08:52,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54404187d/1e135ef200844e64aff5b5a1632b3fa5/FLAG531a5ced3 [2025-03-08 02:08:52,567 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:08:52,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label16.c [2025-03-08 02:08:52,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54404187d/1e135ef200844e64aff5b5a1632b3fa5/FLAG531a5ced3 [2025-03-08 02:08:52,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54404187d/1e135ef200844e64aff5b5a1632b3fa5 [2025-03-08 02:08:52,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:08:52,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:08:52,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:08:52,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:08:52,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:08:52,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:08:52" (1/1) ... [2025-03-08 02:08:52,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ff2de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:52, skipping insertion in model container [2025-03-08 02:08:52,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:08:52" (1/1) ... [2025-03-08 02:08:52,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:08:52,802 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/Problem17_label16.c[3929,3942] [2025-03-08 02:08:53,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:08:53,132 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:08:53,148 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/Problem17_label16.c[3929,3942] [2025-03-08 02:08:53,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:08:53,342 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:08:53,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53 WrapperNode [2025-03-08 02:08:53,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:08:53,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:08:53,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:08:53,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:08:53,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,600 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:08:53,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:08:53,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:08:53,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:08:53,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:08:53,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,789 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:08:53,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:08:53,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:08:53,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:08:53,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:08:53,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:08:53,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:53,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:08:53,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:08:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:08:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:08:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:08:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:08:54,029 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:08:54,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:08:56,579 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:08:56,681 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:08:56,681 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:08:56,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:08:56,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:08:56,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:56 BoogieIcfgContainer [2025-03-08 02:08:56,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:08:56,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:08:56,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:08:56,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:08:56,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:08:52" (1/3) ... [2025-03-08 02:08:56,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e87ed2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:56, skipping insertion in model container [2025-03-08 02:08:56,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53" (2/3) ... [2025-03-08 02:08:56,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e87ed2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:56, skipping insertion in model container [2025-03-08 02:08:56,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:56" (3/3) ... [2025-03-08 02:08:56,714 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label16.c [2025-03-08 02:08:56,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:08:56,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label16.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:08:56,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:08:56,796 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;@27b281d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:08:56,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:08:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 02:08:56,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:56,808 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] [2025-03-08 02:08:56,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:56,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash -689698991, now seen corresponding path program 1 times [2025-03-08 02:08:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695748507] [2025-03-08 02:08:56,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 02:08:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 02:08:56,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:08:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695748507] [2025-03-08 02:08:57,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695748507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:57,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:57,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:08:57,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151455656] [2025-03-08 02:08:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:57,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:57,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:57,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:57,068 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:58,989 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-08 02:08:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-08 02:08:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:59,001 INFO L225 Difference]: With dead ends: 1644 [2025-03-08 02:08:59,001 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 02:08:59,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:59,006 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 463 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:59,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:08:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 02:08:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-08 02:08:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-08 02:08:59,079 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 25 [2025-03-08 02:08:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:59,080 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-08 02:08:59,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-08 02:08:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 02:08:59,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:59,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:59,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:08:59,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash 812773264, now seen corresponding path program 1 times [2025-03-08 02:08:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:59,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591439617] [2025-03-08 02:08:59,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:59,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:59,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 02:08:59,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 02:08:59,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:59,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:08:59,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:59,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591439617] [2025-03-08 02:08:59,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591439617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:59,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:59,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:08:59,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921883178] [2025-03-08 02:08:59,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:59,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:59,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:59,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:59,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:59,411 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:01,016 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-03-08 02:09:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-08 02:09:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:01,022 INFO L225 Difference]: With dead ends: 2813 [2025-03-08 02:09:01,022 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:09:01,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:01,024 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:01,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:09:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:09:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-03-08 02:09:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-03-08 02:09:01,071 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 92 [2025-03-08 02:09:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:01,072 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-03-08 02:09:01,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-03-08 02:09:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 02:09:01,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:01,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:01,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:09:01,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:01,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1956999816, now seen corresponding path program 1 times [2025-03-08 02:09:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588957868] [2025-03-08 02:09:01,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 02:09:01,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 02:09:01,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:01,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:01,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588957868] [2025-03-08 02:09:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588957868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:01,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109508705] [2025-03-08 02:09:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:01,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:01,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:01,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:01,379 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:03,982 INFO L93 Difference]: Finished difference Result 6767 states and 9259 transitions. [2025-03-08 02:09:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:03,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 02:09:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:04,013 INFO L225 Difference]: With dead ends: 6767 [2025-03-08 02:09:04,014 INFO L226 Difference]: Without dead ends: 4928 [2025-03-08 02:09:04,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:04,036 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 889 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:04,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 327 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 02:09:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-08 02:09:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4875. [2025-03-08 02:09:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.2866228970045137) internal successors, (6271), 4874 states have internal predecessors, (6271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6271 transitions. [2025-03-08 02:09:04,149 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6271 transitions. Word has length 95 [2025-03-08 02:09:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:04,149 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6271 transitions. [2025-03-08 02:09:04,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6271 transitions. [2025-03-08 02:09:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 02:09:04,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:04,152 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:09:04,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:04,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1377651134, now seen corresponding path program 1 times [2025-03-08 02:09:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288885623] [2025-03-08 02:09:04,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:04,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 02:09:04,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 02:09:04,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:04,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 02:09:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288885623] [2025-03-08 02:09:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288885623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:04,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046929501] [2025-03-08 02:09:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:04,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:04,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:04,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:04,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:04,383 INFO L87 Difference]: Start difference. First operand 4875 states and 6271 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:05,771 INFO L93 Difference]: Finished difference Result 14436 states and 18544 transitions. [2025-03-08 02:09:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 164 [2025-03-08 02:09:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:05,791 INFO L225 Difference]: With dead ends: 14436 [2025-03-08 02:09:05,792 INFO L226 Difference]: Without dead ends: 8277 [2025-03-08 02:09:05,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:05,799 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:05,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-03-08 02:09:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6576. [2025-03-08 02:09:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 1.1793155893536122) internal successors, (7754), 6575 states have internal predecessors, (7754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 7754 transitions. [2025-03-08 02:09:05,879 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 7754 transitions. Word has length 164 [2025-03-08 02:09:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:05,879 INFO L471 AbstractCegarLoop]: Abstraction has 6576 states and 7754 transitions. [2025-03-08 02:09:05,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 7754 transitions. [2025-03-08 02:09:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 02:09:05,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:05,881 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:05,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:09:05,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:05,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -727561876, now seen corresponding path program 1 times [2025-03-08 02:09:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471304831] [2025-03-08 02:09:05,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:05,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 02:09:05,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 02:09:05,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:05,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471304831] [2025-03-08 02:09:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471304831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:06,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63208287] [2025-03-08 02:09:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:06,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:06,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:06,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:06,058 INFO L87 Difference]: Start difference. First operand 6576 states and 7754 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:07,361 INFO L93 Difference]: Finished difference Result 16560 states and 19931 transitions. [2025-03-08 02:09:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:07,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2025-03-08 02:09:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:07,423 INFO L225 Difference]: With dead ends: 16560 [2025-03-08 02:09:07,423 INFO L226 Difference]: Without dead ends: 9986 [2025-03-08 02:09:07,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:07,437 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:07,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 801 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2025-03-08 02:09:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9986. [2025-03-08 02:09:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9985 states have (on average 1.1696544817225838) internal successors, (11679), 9985 states have internal predecessors, (11679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 11679 transitions. [2025-03-08 02:09:07,624 INFO L78 Accepts]: Start accepts. Automaton has 9986 states and 11679 transitions. Word has length 177 [2025-03-08 02:09:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:07,625 INFO L471 AbstractCegarLoop]: Abstraction has 9986 states and 11679 transitions. [2025-03-08 02:09:07,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9986 states and 11679 transitions. [2025-03-08 02:09:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 02:09:07,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:07,626 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:07,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:09:07,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:07,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 89165489, now seen corresponding path program 1 times [2025-03-08 02:09:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:07,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355265865] [2025-03-08 02:09:07,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:07,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 02:09:07,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 02:09:07,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:07,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:09:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355265865] [2025-03-08 02:09:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355265865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129306319] [2025-03-08 02:09:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:07,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:07,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:07,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:07,790 INFO L87 Difference]: Start difference. First operand 9986 states and 11679 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:09,192 INFO L93 Difference]: Finished difference Result 25067 states and 29587 transitions. [2025-03-08 02:09:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:09,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 179 [2025-03-08 02:09:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:09,216 INFO L225 Difference]: With dead ends: 25067 [2025-03-08 02:09:09,216 INFO L226 Difference]: Without dead ends: 15083 [2025-03-08 02:09:09,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:09,225 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 429 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:09,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 487 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15083 states. [2025-03-08 02:09:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15083 to 10384. [2025-03-08 02:09:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10384 states, 10383 states have (on average 1.1651738418568813) internal successors, (12098), 10383 states have internal predecessors, (12098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 12098 transitions. [2025-03-08 02:09:09,380 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 12098 transitions. Word has length 179 [2025-03-08 02:09:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 10384 states and 12098 transitions. [2025-03-08 02:09:09,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 12098 transitions. [2025-03-08 02:09:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 02:09:09,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:09,386 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:09,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:09:09,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2134093417, now seen corresponding path program 1 times [2025-03-08 02:09:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:09,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637019880] [2025-03-08 02:09:09,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:09,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 02:09:09,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 02:09:09,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:09,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:09,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637019880] [2025-03-08 02:09:09,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637019880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:09,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:09,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:09,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542536188] [2025-03-08 02:09:09,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:09,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:09,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:09,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:09,504 INFO L87 Difference]: Start difference. First operand 10384 states and 12098 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:11,072 INFO L93 Difference]: Finished difference Result 25874 states and 30417 transitions. [2025-03-08 02:09:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:11,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 192 [2025-03-08 02:09:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:11,099 INFO L225 Difference]: With dead ends: 25874 [2025-03-08 02:09:11,099 INFO L226 Difference]: Without dead ends: 15492 [2025-03-08 02:09:11,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:11,110 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 453 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:11,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 448 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:09:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2025-03-08 02:09:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 13778. [2025-03-08 02:09:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13777 states have (on average 1.166509399724178) internal successors, (16071), 13777 states have internal predecessors, (16071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 16071 transitions. [2025-03-08 02:09:11,240 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 16071 transitions. Word has length 192 [2025-03-08 02:09:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:11,240 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 16071 transitions. [2025-03-08 02:09:11,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 16071 transitions. [2025-03-08 02:09:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 02:09:11,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:11,243 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:09:11,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:11,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2008662383, now seen corresponding path program 1 times [2025-03-08 02:09:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907439022] [2025-03-08 02:09:11,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:11,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 02:09:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 02:09:11,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:11,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:11,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907439022] [2025-03-08 02:09:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907439022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:11,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239332541] [2025-03-08 02:09:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:11,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:11,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:11,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:11,375 INFO L87 Difference]: Start difference. First operand 13778 states and 16071 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:12,853 INFO L93 Difference]: Finished difference Result 32234 states and 37932 transitions. [2025-03-08 02:09:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 224 [2025-03-08 02:09:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:12,925 INFO L225 Difference]: With dead ends: 32234 [2025-03-08 02:09:12,926 INFO L226 Difference]: Without dead ends: 18458 [2025-03-08 02:09:12,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:12,933 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 467 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:12,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 416 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18458 states. [2025-03-08 02:09:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18458 to 17176. [2025-03-08 02:09:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17176 states, 17175 states have (on average 1.1833478893740903) internal successors, (20324), 17175 states have internal predecessors, (20324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 20324 transitions. [2025-03-08 02:09:13,077 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 20324 transitions. Word has length 224 [2025-03-08 02:09:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:13,077 INFO L471 AbstractCegarLoop]: Abstraction has 17176 states and 20324 transitions. [2025-03-08 02:09:13,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 20324 transitions. [2025-03-08 02:09:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-08 02:09:13,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:13,081 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:13,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:09:13,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:13,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -10086753, now seen corresponding path program 1 times [2025-03-08 02:09:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945723046] [2025-03-08 02:09:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:13,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-08 02:09:13,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-08 02:09:13,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:13,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:13,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945723046] [2025-03-08 02:09:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945723046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461330085] [2025-03-08 02:09:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:13,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:13,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:13,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:13,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:13,370 INFO L87 Difference]: Start difference. First operand 17176 states and 20324 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:14,900 INFO L93 Difference]: Finished difference Result 39057 states and 46415 transitions. [2025-03-08 02:09:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2025-03-08 02:09:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:14,924 INFO L225 Difference]: With dead ends: 39057 [2025-03-08 02:09:14,924 INFO L226 Difference]: Without dead ends: 21458 [2025-03-08 02:09:14,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:14,935 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 356 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:14,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 864 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21458 states. [2025-03-08 02:09:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21458 to 21025. [2025-03-08 02:09:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21025 states, 21024 states have (on average 1.1667142313546424) internal successors, (24529), 21024 states have internal predecessors, (24529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21025 states to 21025 states and 24529 transitions. [2025-03-08 02:09:15,107 INFO L78 Accepts]: Start accepts. Automaton has 21025 states and 24529 transitions. Word has length 241 [2025-03-08 02:09:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:15,107 INFO L471 AbstractCegarLoop]: Abstraction has 21025 states and 24529 transitions. [2025-03-08 02:09:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 21025 states and 24529 transitions. [2025-03-08 02:09:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 02:09:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:15,110 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:09:15,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -33820184, now seen corresponding path program 1 times [2025-03-08 02:09:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087455741] [2025-03-08 02:09:15,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:15,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 02:09:15,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 02:09:15,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 184 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:09:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087455741] [2025-03-08 02:09:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087455741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115019804] [2025-03-08 02:09:15,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:15,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:15,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:15,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:15,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:09:15,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 02:09:15,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 02:09:15,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:15,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:15,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:15,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 184 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:09:15,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:09:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115019804] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:15,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:15,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:09:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221340131] [2025-03-08 02:09:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:15,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:15,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:15,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:15,879 INFO L87 Difference]: Start difference. First operand 21025 states and 24529 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:18,334 INFO L93 Difference]: Finished difference Result 59100 states and 69388 transitions. [2025-03-08 02:09:18,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:18,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 249 [2025-03-08 02:09:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:18,373 INFO L225 Difference]: With dead ends: 59100 [2025-03-08 02:09:18,373 INFO L226 Difference]: Without dead ends: 37213 [2025-03-08 02:09:18,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:18,392 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 878 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:18,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 157 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 02:09:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37213 states. [2025-03-08 02:09:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37213 to 35506. [2025-03-08 02:09:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35506 states, 35505 states have (on average 1.1591043514997887) internal successors, (41154), 35505 states have internal predecessors, (41154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35506 states to 35506 states and 41154 transitions. [2025-03-08 02:09:18,719 INFO L78 Accepts]: Start accepts. Automaton has 35506 states and 41154 transitions. Word has length 249 [2025-03-08 02:09:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 35506 states and 41154 transitions. [2025-03-08 02:09:18,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35506 states and 41154 transitions. [2025-03-08 02:09:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-08 02:09:18,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:18,722 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:18,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:09:18,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 02:09:18,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:18,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2001871313, now seen corresponding path program 1 times [2025-03-08 02:09:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720207024] [2025-03-08 02:09:18,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:18,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-08 02:09:18,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-08 02:09:18,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:18,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 02:09:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720207024] [2025-03-08 02:09:19,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720207024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:19,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:19,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:19,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244482324] [2025-03-08 02:09:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:19,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:19,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:19,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:19,089 INFO L87 Difference]: Start difference. First operand 35506 states and 41154 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:20,383 INFO L93 Difference]: Finished difference Result 78654 states and 91329 transitions. [2025-03-08 02:09:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:20,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 257 [2025-03-08 02:09:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:20,432 INFO L225 Difference]: With dead ends: 78654 [2025-03-08 02:09:20,432 INFO L226 Difference]: Without dead ends: 42723 [2025-03-08 02:09:20,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:20,463 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 380 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:20,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 850 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:09:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42723 states. [2025-03-08 02:09:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42723 to 42723. [2025-03-08 02:09:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42723 states, 42722 states have (on average 1.1170825335892514) internal successors, (47724), 42722 states have internal predecessors, (47724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42723 states to 42723 states and 47724 transitions. [2025-03-08 02:09:21,061 INFO L78 Accepts]: Start accepts. Automaton has 42723 states and 47724 transitions. Word has length 257 [2025-03-08 02:09:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:21,062 INFO L471 AbstractCegarLoop]: Abstraction has 42723 states and 47724 transitions. [2025-03-08 02:09:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 42723 states and 47724 transitions. [2025-03-08 02:09:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-08 02:09:21,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:21,065 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:09:21,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:21,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1205771719, now seen corresponding path program 1 times [2025-03-08 02:09:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086456613] [2025-03-08 02:09:21,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:21,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 02:09:21,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 02:09:21,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 325 proven. 73 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 02:09:21,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:21,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086456613] [2025-03-08 02:09:21,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086456613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:21,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550120705] [2025-03-08 02:09:21,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:21,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:21,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:09:21,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-08 02:09:21,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-08 02:09:21,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:21,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:21,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:21,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 325 proven. 73 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 02:09:21,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 02:09:21,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550120705] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:21,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:09:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245749041] [2025-03-08 02:09:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:21,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:21,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:21,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:21,771 INFO L87 Difference]: Start difference. First operand 42723 states and 47724 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:24,009 INFO L93 Difference]: Finished difference Result 101643 states and 113664 transitions. [2025-03-08 02:09:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:24,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 323 [2025-03-08 02:09:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:24,069 INFO L225 Difference]: With dead ends: 101643 [2025-03-08 02:09:24,069 INFO L226 Difference]: Without dead ends: 58493 [2025-03-08 02:09:24,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:24,097 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 840 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:24,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 189 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:09:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58493 states. [2025-03-08 02:09:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58493 to 55940. [2025-03-08 02:09:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55940 states, 55939 states have (on average 1.1210604408373406) internal successors, (62711), 55939 states have internal predecessors, (62711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55940 states to 55940 states and 62711 transitions. [2025-03-08 02:09:24,621 INFO L78 Accepts]: Start accepts. Automaton has 55940 states and 62711 transitions. Word has length 323 [2025-03-08 02:09:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:24,621 INFO L471 AbstractCegarLoop]: Abstraction has 55940 states and 62711 transitions. [2025-03-08 02:09:24,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55940 states and 62711 transitions. [2025-03-08 02:09:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-08 02:09:24,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:24,629 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 02:09:24,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 02:09:24,833 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,SelfDestructingSolverStorable11 [2025-03-08 02:09:24,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1807568363, now seen corresponding path program 1 times [2025-03-08 02:09:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974016216] [2025-03-08 02:09:24,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:24,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-08 02:09:24,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-08 02:09:24,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:24,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 02:09:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974016216] [2025-03-08 02:09:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974016216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834875589] [2025-03-08 02:09:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:25,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:25,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:25,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:25,076 INFO L87 Difference]: Start difference. First operand 55940 states and 62711 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:26,527 INFO L93 Difference]: Finished difference Result 121241 states and 135987 transitions. [2025-03-08 02:09:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:26,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 420 [2025-03-08 02:09:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:26,600 INFO L225 Difference]: With dead ends: 121241 [2025-03-08 02:09:26,601 INFO L226 Difference]: Without dead ends: 64878 [2025-03-08 02:09:26,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:26,622 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 339 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:26,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 774 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64878 states. [2025-03-08 02:09:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64878 to 53350. [2025-03-08 02:09:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53350 states, 53349 states have (on average 1.1076871169094078) internal successors, (59094), 53349 states have internal predecessors, (59094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53350 states to 53350 states and 59094 transitions. [2025-03-08 02:09:27,164 INFO L78 Accepts]: Start accepts. Automaton has 53350 states and 59094 transitions. Word has length 420 [2025-03-08 02:09:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:27,164 INFO L471 AbstractCegarLoop]: Abstraction has 53350 states and 59094 transitions. [2025-03-08 02:09:27,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 53350 states and 59094 transitions. [2025-03-08 02:09:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-08 02:09:27,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:27,170 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 02:09:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:09:27,170 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1856031742, now seen corresponding path program 1 times [2025-03-08 02:09:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410647567] [2025-03-08 02:09:27,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:27,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-08 02:09:27,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-08 02:09:27,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:27,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 02:09:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:27,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410647567] [2025-03-08 02:09:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410647567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:27,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:27,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545610075] [2025-03-08 02:09:27,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:27,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:27,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:27,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:27,467 INFO L87 Difference]: Start difference. First operand 53350 states and 59094 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:28,983 INFO L93 Difference]: Finished difference Result 119901 states and 132834 transitions. [2025-03-08 02:09:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 421 [2025-03-08 02:09:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:29,065 INFO L225 Difference]: With dead ends: 119901 [2025-03-08 02:09:29,066 INFO L226 Difference]: Without dead ends: 63990 [2025-03-08 02:09:29,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:29,099 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 437 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:29,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 659 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63990 states. [2025-03-08 02:09:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63990 to 61851. [2025-03-08 02:09:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61851 states, 61850 states have (on average 1.0961196443007275) internal successors, (67795), 61850 states have internal predecessors, (67795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61851 states to 61851 states and 67795 transitions. [2025-03-08 02:09:29,637 INFO L78 Accepts]: Start accepts. Automaton has 61851 states and 67795 transitions. Word has length 421 [2025-03-08 02:09:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:29,637 INFO L471 AbstractCegarLoop]: Abstraction has 61851 states and 67795 transitions. [2025-03-08 02:09:29,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 61851 states and 67795 transitions. [2025-03-08 02:09:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-08 02:09:29,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:29,643 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 02:09:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:09:29,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2143754917, now seen corresponding path program 1 times [2025-03-08 02:09:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004440194] [2025-03-08 02:09:29,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:29,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-08 02:09:29,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-08 02:09:29,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:29,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:09:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004440194] [2025-03-08 02:09:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004440194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:30,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227232177] [2025-03-08 02:09:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:30,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:30,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:30,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:30,036 INFO L87 Difference]: Start difference. First operand 61851 states and 67795 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:32,044 INFO L93 Difference]: Finished difference Result 145471 states and 159571 transitions. [2025-03-08 02:09:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:32,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 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 425 [2025-03-08 02:09:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:32,136 INFO L225 Difference]: With dead ends: 145471 [2025-03-08 02:09:32,137 INFO L226 Difference]: Without dead ends: 83622 [2025-03-08 02:09:32,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:32,176 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 817 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:32,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 220 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:09:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83622 states. [2025-03-08 02:09:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83622 to 78925. [2025-03-08 02:09:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78925 states, 78924 states have (on average 1.097967665095535) internal successors, (86656), 78924 states have internal predecessors, (86656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78925 states to 78925 states and 86656 transitions. [2025-03-08 02:09:33,041 INFO L78 Accepts]: Start accepts. Automaton has 78925 states and 86656 transitions. Word has length 425 [2025-03-08 02:09:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:33,041 INFO L471 AbstractCegarLoop]: Abstraction has 78925 states and 86656 transitions. [2025-03-08 02:09:33,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 78925 states and 86656 transitions. [2025-03-08 02:09:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 02:09:33,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:33,046 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 02:09:33,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:09:33,046 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:33,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1077489511, now seen corresponding path program 1 times [2025-03-08 02:09:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110755527] [2025-03-08 02:09:33,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:33,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 02:09:33,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 02:09:33,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:33,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 02:09:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:33,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110755527] [2025-03-08 02:09:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110755527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611639286] [2025-03-08 02:09:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:33,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:33,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:33,385 INFO L87 Difference]: Start difference. First operand 78925 states and 86656 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:34,942 INFO L93 Difference]: Finished difference Result 167643 states and 184228 transitions. [2025-03-08 02:09:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:34,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 444 [2025-03-08 02:09:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:35,049 INFO L225 Difference]: With dead ends: 167643 [2025-03-08 02:09:35,049 INFO L226 Difference]: Without dead ends: 88720 [2025-03-08 02:09:35,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:35,101 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 387 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:35,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 328 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88720 states. [2025-03-08 02:09:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88720 to 88286. [2025-03-08 02:09:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88286 states, 88285 states have (on average 1.0953389590530667) internal successors, (96702), 88285 states have internal predecessors, (96702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88286 states to 88286 states and 96702 transitions. [2025-03-08 02:09:36,159 INFO L78 Accepts]: Start accepts. Automaton has 88286 states and 96702 transitions. Word has length 444 [2025-03-08 02:09:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 88286 states and 96702 transitions. [2025-03-08 02:09:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 88286 states and 96702 transitions. [2025-03-08 02:09:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 02:09:36,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:36,167 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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-08 02:09:36,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:09:36,167 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash -918018042, now seen corresponding path program 1 times [2025-03-08 02:09:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:36,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940708965] [2025-03-08 02:09:36,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:36,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 02:09:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 02:09:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-08 02:09:36,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:36,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940708965] [2025-03-08 02:09:36,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940708965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:36,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:36,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157267146] [2025-03-08 02:09:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:36,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:36,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:36,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:36,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:36,444 INFO L87 Difference]: Start difference. First operand 88286 states and 96702 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:37,885 INFO L93 Difference]: Finished difference Result 190190 states and 208577 transitions. [2025-03-08 02:09:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:37,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 468 [2025-03-08 02:09:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:38,031 INFO L225 Difference]: With dead ends: 190190 [2025-03-08 02:09:38,032 INFO L226 Difference]: Without dead ends: 101906 [2025-03-08 02:09:38,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:38,088 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 475 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:38,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 264 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101906 states. [2025-03-08 02:09:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101906 to 101449. [2025-03-08 02:09:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101449 states, 101448 states have (on average 1.0927963094393187) internal successors, (110862), 101448 states have internal predecessors, (110862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101449 states to 101449 states and 110862 transitions. [2025-03-08 02:09:39,258 INFO L78 Accepts]: Start accepts. Automaton has 101449 states and 110862 transitions. Word has length 468 [2025-03-08 02:09:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:39,259 INFO L471 AbstractCegarLoop]: Abstraction has 101449 states and 110862 transitions. [2025-03-08 02:09:39,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 101449 states and 110862 transitions. [2025-03-08 02:09:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 02:09:39,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:39,267 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:39,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:09:39,267 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:39,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2008661555, now seen corresponding path program 1 times [2025-03-08 02:09:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907724889] [2025-03-08 02:09:39,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:39,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 02:09:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 02:09:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:09:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907724889] [2025-03-08 02:09:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907724889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097192411] [2025-03-08 02:09:39,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:39,812 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-08 02:09:39,813 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-08 02:09:39,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 02:09:39,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 02:09:39,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:39,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:39,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:09:39,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:09:39,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:09:39,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097192411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:39,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:09:39,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:09:39,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274500749] [2025-03-08 02:09:39,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:39,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:39,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:39,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:39,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:39,961 INFO L87 Difference]: Start difference. First operand 101449 states and 110862 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:41,417 INFO L93 Difference]: Finished difference Result 199911 states and 218372 transitions. [2025-03-08 02:09:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:41,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 471 [2025-03-08 02:09:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:41,527 INFO L225 Difference]: With dead ends: 199911 [2025-03-08 02:09:41,527 INFO L226 Difference]: Without dead ends: 98033 [2025-03-08 02:09:41,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:41,566 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 451 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:41,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 331 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:09:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98033 states. [2025-03-08 02:09:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98033 to 97180. [2025-03-08 02:09:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97180 states, 97179 states have (on average 1.086479589211661) internal successors, (105583), 97179 states have internal predecessors, (105583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97180 states to 97180 states and 105583 transitions. [2025-03-08 02:09:42,656 INFO L78 Accepts]: Start accepts. Automaton has 97180 states and 105583 transitions. Word has length 471 [2025-03-08 02:09:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:42,656 INFO L471 AbstractCegarLoop]: Abstraction has 97180 states and 105583 transitions. [2025-03-08 02:09:42,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 97180 states and 105583 transitions. [2025-03-08 02:09:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-08 02:09:42,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:42,668 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:09:42,674 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-08 02:09:42,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 02:09:42,868 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:42,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:42,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1270961778, now seen corresponding path program 1 times [2025-03-08 02:09:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:42,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680939475] [2025-03-08 02:09:42,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:42,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-08 02:09:42,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-08 02:09:42,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:42,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 559 proven. 29 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 02:09:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680939475] [2025-03-08 02:09:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680939475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220818723] [2025-03-08 02:09:43,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:43,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:43,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:43,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:43,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:09:43,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-08 02:09:43,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-08 02:09:43,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:43,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:43,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 02:09:43,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 559 proven. 29 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 02:09:45,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 559 proven. 29 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 02:09:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220818723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:09:46,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:09:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-08 02:09:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709512624] [2025-03-08 02:09:46,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:09:46,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 02:09:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:46,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 02:09:46,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 02:09:46,893 INFO L87 Difference]: Start difference. First operand 97180 states and 105583 transitions. Second operand has 11 states, 11 states have (on average 77.36363636363636) internal successors, (851), 11 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:53,035 INFO L93 Difference]: Finished difference Result 198772 states and 215689 transitions. [2025-03-08 02:09:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 02:09:53,036 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 77.36363636363636) internal successors, (851), 11 states have internal predecessors, (851), 0 states have call successors, (0), 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 509 [2025-03-08 02:09:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:53,142 INFO L225 Difference]: With dead ends: 198772 [2025-03-08 02:09:53,142 INFO L226 Difference]: Without dead ends: 101593 [2025-03-08 02:09:53,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2025-03-08 02:09:53,173 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 3643 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 12528 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3643 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 13341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 12528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:53,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3643 Valid, 401 Invalid, 13341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 12528 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-08 02:09:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101593 states. [2025-03-08 02:09:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101593 to 90359. [2025-03-08 02:09:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90359 states, 90358 states have (on average 1.0860355474888777) internal successors, (98132), 90358 states have internal predecessors, (98132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90359 states to 90359 states and 98132 transitions. [2025-03-08 02:09:54,061 INFO L78 Accepts]: Start accepts. Automaton has 90359 states and 98132 transitions. Word has length 509 [2025-03-08 02:09:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:54,062 INFO L471 AbstractCegarLoop]: Abstraction has 90359 states and 98132 transitions. [2025-03-08 02:09:54,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.36363636363636) internal successors, (851), 11 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 90359 states and 98132 transitions. [2025-03-08 02:09:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 02:09:54,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:54,070 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:54,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:09:54,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:54,270 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:54,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1569873378, now seen corresponding path program 1 times [2025-03-08 02:09:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078697523] [2025-03-08 02:09:54,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:54,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:54,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 02:09:54,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 02:09:54,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:54,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:09:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078697523] [2025-03-08 02:09:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078697523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427172559] [2025-03-08 02:09:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:54,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:54,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:54,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:54,683 INFO L87 Difference]: Start difference. First operand 90359 states and 98132 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:56,182 INFO L93 Difference]: Finished difference Result 178158 states and 193418 transitions. [2025-03-08 02:09:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:56,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 529 [2025-03-08 02:09:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:56,266 INFO L225 Difference]: With dead ends: 178158 [2025-03-08 02:09:56,266 INFO L226 Difference]: Without dead ends: 87801 [2025-03-08 02:09:56,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:56,300 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 466 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:56,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 689 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87801 states. [2025-03-08 02:09:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87801 to 84822. [2025-03-08 02:09:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84822 states, 84821 states have (on average 1.0715506773086854) internal successors, (90890), 84821 states have internal predecessors, (90890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84822 states to 84822 states and 90890 transitions. [2025-03-08 02:09:57,309 INFO L78 Accepts]: Start accepts. Automaton has 84822 states and 90890 transitions. Word has length 529 [2025-03-08 02:09:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:57,310 INFO L471 AbstractCegarLoop]: Abstraction has 84822 states and 90890 transitions. [2025-03-08 02:09:57,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 84822 states and 90890 transitions. [2025-03-08 02:09:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 02:09:57,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:57,319 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:09:57,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:09:57,319 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:57,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash 498414074, now seen corresponding path program 1 times [2025-03-08 02:09:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:57,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223254148] [2025-03-08 02:09:57,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 02:09:57,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 02:09:57,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:57,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 580 proven. 141 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:09:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223254148] [2025-03-08 02:09:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223254148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731094471] [2025-03-08 02:09:57,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:57,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:57,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:57,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:09:57,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 02:09:57,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 02:09:57,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:57,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:58,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 02:09:58,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 416 proven. 305 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:09:58,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 639 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 02:09:58,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731094471] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:58,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-08 02:09:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31037449] [2025-03-08 02:09:58,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:58,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:58,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:58,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:58,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:09:58,452 INFO L87 Difference]: Start difference. First operand 84822 states and 90890 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:59,878 INFO L93 Difference]: Finished difference Result 170494 states and 182715 transitions. [2025-03-08 02:09:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:59,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 532 [2025-03-08 02:09:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:59,980 INFO L225 Difference]: With dead ends: 170494 [2025-03-08 02:09:59,980 INFO L226 Difference]: Without dead ends: 85674 [2025-03-08 02:10:00,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1060 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:10:00,036 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 360 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:00,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 642 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:10:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85674 states. [2025-03-08 02:10:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85674 to 84821. [2025-03-08 02:10:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84821 states, 84820 states have (on average 1.0666352275406743) internal successors, (90472), 84820 states have internal predecessors, (90472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84821 states to 84821 states and 90472 transitions. [2025-03-08 02:10:01,017 INFO L78 Accepts]: Start accepts. Automaton has 84821 states and 90472 transitions. Word has length 532 [2025-03-08 02:10:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:01,017 INFO L471 AbstractCegarLoop]: Abstraction has 84821 states and 90472 transitions. [2025-03-08 02:10:01,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 84821 states and 90472 transitions. [2025-03-08 02:10:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 02:10:01,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:01,026 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:01,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 02:10:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:01,228 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2077372902, now seen corresponding path program 1 times [2025-03-08 02:10:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725641599] [2025-03-08 02:10:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:01,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 02:10:01,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 02:10:01,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:01,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 02:10:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725641599] [2025-03-08 02:10:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725641599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508316795] [2025-03-08 02:10:01,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:01,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:01,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:01,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:01,654 INFO L87 Difference]: Start difference. First operand 84821 states and 90472 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:03,822 INFO L93 Difference]: Finished difference Result 176454 states and 188072 transitions. [2025-03-08 02:10:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 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 568 [2025-03-08 02:10:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:03,916 INFO L225 Difference]: With dead ends: 176454 [2025-03-08 02:10:03,917 INFO L226 Difference]: Without dead ends: 91635 [2025-03-08 02:10:03,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:03,968 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 741 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:03,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 160 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:10:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91635 states. [2025-03-08 02:10:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91635 to 83971. [2025-03-08 02:10:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83971 states, 83970 states have (on average 1.0587471716089079) internal successors, (88903), 83970 states have internal predecessors, (88903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83971 states to 83971 states and 88903 transitions. [2025-03-08 02:10:04,749 INFO L78 Accepts]: Start accepts. Automaton has 83971 states and 88903 transitions. Word has length 568 [2025-03-08 02:10:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:04,749 INFO L471 AbstractCegarLoop]: Abstraction has 83971 states and 88903 transitions. [2025-03-08 02:10:04,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 83971 states and 88903 transitions. [2025-03-08 02:10:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-03-08 02:10:04,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:04,762 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:10:04,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:10:04,762 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:04,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1772900767, now seen corresponding path program 1 times [2025-03-08 02:10:04,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:04,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282930888] [2025-03-08 02:10:04,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:04,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-03-08 02:10:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-03-08 02:10:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-08 02:10:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282930888] [2025-03-08 02:10:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282930888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:05,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597065084] [2025-03-08 02:10:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:05,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:05,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:05,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:05,397 INFO L87 Difference]: Start difference. First operand 83971 states and 88903 transitions. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:07,405 INFO L93 Difference]: Finished difference Result 184581 states and 195154 transitions. [2025-03-08 02:10:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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 600 [2025-03-08 02:10:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:07,513 INFO L225 Difference]: With dead ends: 184581 [2025-03-08 02:10:07,513 INFO L226 Difference]: Without dead ends: 100187 [2025-03-08 02:10:07,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:07,566 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 680 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:07,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 327 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:10:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100187 states. [2025-03-08 02:10:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100187 to 86952. [2025-03-08 02:10:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86952 states, 86951 states have (on average 1.0591827581051396) internal successors, (92097), 86951 states have internal predecessors, (92097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86952 states to 86952 states and 92097 transitions. [2025-03-08 02:10:08,380 INFO L78 Accepts]: Start accepts. Automaton has 86952 states and 92097 transitions. Word has length 600 [2025-03-08 02:10:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:08,381 INFO L471 AbstractCegarLoop]: Abstraction has 86952 states and 92097 transitions. [2025-03-08 02:10:08,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 86952 states and 92097 transitions. [2025-03-08 02:10:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-08 02:10:08,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:08,390 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:08,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:10:08,390 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:08,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1301602436, now seen corresponding path program 1 times [2025-03-08 02:10:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:08,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259428821] [2025-03-08 02:10:08,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:08,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-08 02:10:08,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-08 02:10:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:10:08,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:08,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259428821] [2025-03-08 02:10:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259428821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609217851] [2025-03-08 02:10:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:08,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:08,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:08,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:08,749 INFO L87 Difference]: Start difference. First operand 86952 states and 92097 transitions. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:10,767 INFO L93 Difference]: Finished difference Result 184967 states and 195765 transitions. [2025-03-08 02:10:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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 610 [2025-03-08 02:10:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:10,871 INFO L225 Difference]: With dead ends: 184967 [2025-03-08 02:10:10,871 INFO L226 Difference]: Without dead ends: 98017 [2025-03-08 02:10:10,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:10,929 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 530 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:10,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 685 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:10:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98017 states. [2025-03-08 02:10:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98017 to 93760. [2025-03-08 02:10:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93760 states, 93759 states have (on average 1.0589596732047057) internal successors, (99287), 93759 states have internal predecessors, (99287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93760 states to 93760 states and 99287 transitions. [2025-03-08 02:10:11,871 INFO L78 Accepts]: Start accepts. Automaton has 93760 states and 99287 transitions. Word has length 610 [2025-03-08 02:10:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:11,871 INFO L471 AbstractCegarLoop]: Abstraction has 93760 states and 99287 transitions. [2025-03-08 02:10:11,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 93760 states and 99287 transitions. [2025-03-08 02:10:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-08 02:10:11,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:11,882 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 02:10:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 02:10:11,882 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:11,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 463774167, now seen corresponding path program 1 times [2025-03-08 02:10:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:11,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66217507] [2025-03-08 02:10:11,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:11,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:11,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-08 02:10:11,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-08 02:10:11,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:11,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:10:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66217507] [2025-03-08 02:10:12,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66217507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:12,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:12,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:12,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473558633] [2025-03-08 02:10:12,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:12,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:12,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:12,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:12,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:12,304 INFO L87 Difference]: Start difference. First operand 93760 states and 99287 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)