./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem01_label14.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:07:16,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:07:16,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:07:16,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:07:16,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:07:16,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:07:16,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:07:16,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:07:16,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:07:16,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:07:16,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:07:16,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:07:16,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:07:16,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:07:16,692 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:07:16,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:07:16,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:07:16,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:07:16,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:07:16,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:07:16,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:07:16,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:07:16,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:07:16,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:16,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:07:16,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:07:16,695 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 -> 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf [2025-03-16 14:07:16,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:07:16,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:07:16,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:07:16,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:07:16,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:07:16,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2025-03-16 14:07:17,992 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26ac5f0f/c05e86f1f28642df848d4ce38266e10e/FLAG500ed282d [2025-03-16 14:07:18,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:07:18,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2025-03-16 14:07:18,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26ac5f0f/c05e86f1f28642df848d4ce38266e10e/FLAG500ed282d [2025-03-16 14:07:18,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26ac5f0f/c05e86f1f28642df848d4ce38266e10e [2025-03-16 14:07:18,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:07:18,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:07:18,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:18,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:07:18,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:07:18,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:18,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14894776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18, skipping insertion in model container [2025-03-16 14:07:18,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:18,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:07:18,836 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/Problem01_label14.c[21834,21847] [2025-03-16 14:07:18,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:18,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:07:18,927 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/Problem01_label14.c[21834,21847] [2025-03-16 14:07:18,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:07:18,943 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:07:18,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18 WrapperNode [2025-03-16 14:07:18,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:07:18,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:18,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:07:18,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:07:18,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:18,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:18,985 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-16 14:07:18,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:07:18,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:07:18,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:07:18,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:07:18,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:18,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:18,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,011 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-16 14:07:19,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:07:19,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:07:19,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:07:19,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:07:19,052 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (1/1) ... [2025-03-16 14:07:19,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:07:19,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:19,074 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-16 14:07:19,080 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-16 14:07:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:07:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:07:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:07:19,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:07:19,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:07:19,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:07:19,732 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 14:07:19,733 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:07:19,744 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:07:19,746 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:07:19,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:19 BoogieIcfgContainer [2025-03-16 14:07:19,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:07:19,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:07:19,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:07:19,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:07:19,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:07:18" (1/3) ... [2025-03-16 14:07:19,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f86c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:19, skipping insertion in model container [2025-03-16 14:07:19,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:07:18" (2/3) ... [2025-03-16 14:07:19,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f86c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:07:19, skipping insertion in model container [2025-03-16 14:07:19,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:19" (3/3) ... [2025-03-16 14:07:19,752 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2025-03-16 14:07:19,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:07:19,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label14.c that has 1 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:07:19,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:07:19,805 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;@6918480c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:07:19,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:07:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 14:07:19,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:19,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:19,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1360103161, now seen corresponding path program 1 times [2025-03-16 14:07:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988993784] [2025-03-16 14:07:19,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:19,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:19,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 14:07:19,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 14:07:19,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:19,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:20,148 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-16 14:07:20,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:20,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988993784] [2025-03-16 14:07:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988993784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:20,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:20,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:07:20,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234465694] [2025-03-16 14:07:20,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:20,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:07:20,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:20,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:07:20,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:07:20,170 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.962962962962963) internal successors, (265), 136 states have internal predecessors, (265), 0 states have call successors, (0), 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 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:20,193 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2025-03-16 14:07:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:07:20,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-16 14:07:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:20,200 INFO L225 Difference]: With dead ends: 273 [2025-03-16 14:07:20,200 INFO L226 Difference]: Without dead ends: 134 [2025-03-16 14:07:20,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:07:20,206 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:20,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:07:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-16 14:07:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-16 14:07:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2025-03-16 14:07:20,239 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 130 [2025-03-16 14:07:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:20,239 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2025-03-16 14:07:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2025-03-16 14:07:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 14:07:20,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:20,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:20,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:07:20,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:20,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1586172698, now seen corresponding path program 1 times [2025-03-16 14:07:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:20,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529408146] [2025-03-16 14:07:20,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:20,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:20,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 14:07:20,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 14:07:20,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:20,742 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-16 14:07:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529408146] [2025-03-16 14:07:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529408146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:20,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:20,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:07:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274472022] [2025-03-16 14:07:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:20,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:07:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:20,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:07:20,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:20,748 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:21,419 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2025-03-16 14:07:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-16 14:07:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:21,422 INFO L225 Difference]: With dead ends: 529 [2025-03-16 14:07:21,422 INFO L226 Difference]: Without dead ends: 396 [2025-03-16 14:07:21,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:21,423 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 155 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:21,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 34 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:07:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-16 14:07:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-16 14:07:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.321518987341772) internal successors, (522), 395 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 522 transitions. [2025-03-16 14:07:21,439 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 522 transitions. Word has length 130 [2025-03-16 14:07:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:21,440 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 522 transitions. [2025-03-16 14:07:21,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 522 transitions. [2025-03-16 14:07:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 14:07:21,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:21,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:07:21,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:21,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash -231136653, now seen corresponding path program 1 times [2025-03-16 14:07:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:21,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75962829] [2025-03-16 14:07:21,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:21,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 14:07:21,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 14:07:21,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:21,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75962829] [2025-03-16 14:07:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75962829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:21,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005588966] [2025-03-16 14:07:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:21,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:21,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:21,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:21,804 INFO L87 Difference]: Start difference. First operand 396 states and 522 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:22,334 INFO L93 Difference]: Finished difference Result 1017 states and 1450 transitions. [2025-03-16 14:07:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 14:07:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:22,338 INFO L225 Difference]: With dead ends: 1017 [2025-03-16 14:07:22,338 INFO L226 Difference]: Without dead ends: 658 [2025-03-16 14:07:22,339 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-16 14:07:22,339 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:22,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 81 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:07:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-16 14:07:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 396. [2025-03-16 14:07:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.230379746835443) internal successors, (486), 395 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 486 transitions. [2025-03-16 14:07:22,351 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 486 transitions. Word has length 137 [2025-03-16 14:07:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:22,351 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 486 transitions. [2025-03-16 14:07:22,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 486 transitions. [2025-03-16 14:07:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 14:07:22,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:22,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-16 14:07:22,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:07:22,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:22,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash 960989537, now seen corresponding path program 1 times [2025-03-16 14:07:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342765479] [2025-03-16 14:07:22,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:22,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:22,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 14:07:22,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 14:07:22,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:22,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:22,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342765479] [2025-03-16 14:07:22,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342765479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:22,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:22,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530863218] [2025-03-16 14:07:22,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:22,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:22,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:22,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:22,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:22,496 INFO L87 Difference]: Start difference. First operand 396 states and 486 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:22,965 INFO L93 Difference]: Finished difference Result 1315 states and 1671 transitions. [2025-03-16 14:07:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-16 14:07:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:22,968 INFO L225 Difference]: With dead ends: 1315 [2025-03-16 14:07:22,968 INFO L226 Difference]: Without dead ends: 920 [2025-03-16 14:07:22,969 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-16 14:07:22,969 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 251 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:22,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 55 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-16 14:07:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 658. [2025-03-16 14:07:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.2115677321156773) internal successors, (796), 657 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 796 transitions. [2025-03-16 14:07:22,993 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 796 transitions. Word has length 147 [2025-03-16 14:07:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:22,994 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 796 transitions. [2025-03-16 14:07:22,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2025-03-16 14:07:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 14:07:22,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:22,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:07:22,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:22,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1239161083, now seen corresponding path program 1 times [2025-03-16 14:07:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072569624] [2025-03-16 14:07:22,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:23,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 14:07:23,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 14:07:23,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:23,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 14:07:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072569624] [2025-03-16 14:07:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072569624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187893216] [2025-03-16 14:07:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:23,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:23,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:23,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:23,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:23,093 INFO L87 Difference]: Start difference. First operand 658 states and 796 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:23,389 INFO L93 Difference]: Finished difference Result 1708 states and 2040 transitions. [2025-03-16 14:07:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:23,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 156 [2025-03-16 14:07:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:23,393 INFO L225 Difference]: With dead ends: 1708 [2025-03-16 14:07:23,393 INFO L226 Difference]: Without dead ends: 1051 [2025-03-16 14:07:23,394 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-16 14:07:23,394 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:23,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 40 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-16 14:07:23,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 920. [2025-03-16 14:07:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.2045701849836778) internal successors, (1107), 919 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1107 transitions. [2025-03-16 14:07:23,412 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1107 transitions. Word has length 156 [2025-03-16 14:07:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:23,412 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1107 transitions. [2025-03-16 14:07:23,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1107 transitions. [2025-03-16 14:07:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 14:07:23,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:23,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:23,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:07:23,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1310728010, now seen corresponding path program 1 times [2025-03-16 14:07:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099387094] [2025-03-16 14:07:23,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:23,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 14:07:23,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 14:07:23,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:23,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 14:07:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099387094] [2025-03-16 14:07:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099387094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:23,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362368638] [2025-03-16 14:07:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:23,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:23,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:23,552 INFO L87 Difference]: Start difference. First operand 920 states and 1107 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:23,973 INFO L93 Difference]: Finished difference Result 2232 states and 2655 transitions. [2025-03-16 14:07:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 162 [2025-03-16 14:07:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:23,977 INFO L225 Difference]: With dead ends: 2232 [2025-03-16 14:07:23,977 INFO L226 Difference]: Without dead ends: 1313 [2025-03-16 14:07:23,978 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-16 14:07:23,978 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 369 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:23,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 55 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2025-03-16 14:07:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1182. [2025-03-16 14:07:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.1778154106689247) internal successors, (1391), 1181 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1391 transitions. [2025-03-16 14:07:23,995 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1391 transitions. Word has length 162 [2025-03-16 14:07:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:23,995 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1391 transitions. [2025-03-16 14:07:23,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1391 transitions. [2025-03-16 14:07:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 14:07:23,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:23,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:23,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:07:23,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash -747451938, now seen corresponding path program 1 times [2025-03-16 14:07:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792721800] [2025-03-16 14:07:23,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:24,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 14:07:24,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 14:07:24,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:24,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:07:24,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:24,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792721800] [2025-03-16 14:07:24,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792721800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:24,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:24,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:24,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446591011] [2025-03-16 14:07:24,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:24,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:07:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:24,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:07:24,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:07:24,115 INFO L87 Difference]: Start difference. First operand 1182 states and 1391 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:24,554 INFO L93 Difference]: Finished difference Result 3280 states and 3987 transitions. [2025-03-16 14:07:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:07:24,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2025-03-16 14:07:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:24,560 INFO L225 Difference]: With dead ends: 3280 [2025-03-16 14:07:24,560 INFO L226 Difference]: Without dead ends: 2099 [2025-03-16 14:07:24,561 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-16 14:07:24,561 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 313 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:24,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 55 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:07:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2025-03-16 14:07:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1706. [2025-03-16 14:07:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.1671554252199414) internal successors, (1990), 1705 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1990 transitions. [2025-03-16 14:07:24,585 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1990 transitions. Word has length 180 [2025-03-16 14:07:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:24,585 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 1990 transitions. [2025-03-16 14:07:24,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1990 transitions. [2025-03-16 14:07:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 14:07:24,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:24,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:07:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:07:24,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:24,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1329514246, now seen corresponding path program 1 times [2025-03-16 14:07:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:24,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070005794] [2025-03-16 14:07:24,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:24,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:07:24,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:07:24,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:24,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 14:07:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070005794] [2025-03-16 14:07:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070005794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956530687] [2025-03-16 14:07:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:24,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:24,679 INFO L87 Difference]: Start difference. First operand 1706 states and 1990 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:24,949 INFO L93 Difference]: Finished difference Result 3673 states and 4327 transitions. [2025-03-16 14:07:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:24,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 196 [2025-03-16 14:07:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:24,954 INFO L225 Difference]: With dead ends: 3673 [2025-03-16 14:07:24,955 INFO L226 Difference]: Without dead ends: 1968 [2025-03-16 14:07:24,956 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-16 14:07:24,957 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:24,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-03-16 14:07:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1968. [2025-03-16 14:07:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.1606507371631927) internal successors, (2283), 1967 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2283 transitions. [2025-03-16 14:07:24,982 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2283 transitions. Word has length 196 [2025-03-16 14:07:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:24,982 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2283 transitions. [2025-03-16 14:07:24,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2283 transitions. [2025-03-16 14:07:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 14:07:24,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:24,986 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:24,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:07:24,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:24,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1590466014, now seen corresponding path program 1 times [2025-03-16 14:07:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68775428] [2025-03-16 14:07:24,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:24,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:25,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 14:07:25,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 14:07:25,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:25,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 14:07:25,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:25,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68775428] [2025-03-16 14:07:25,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68775428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:25,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:25,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605418140] [2025-03-16 14:07:25,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:25,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:25,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:25,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:25,126 INFO L87 Difference]: Start difference. First operand 1968 states and 2283 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:25,393 INFO L93 Difference]: Finished difference Result 4197 states and 4837 transitions. [2025-03-16 14:07:25,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:25,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-03-16 14:07:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:25,398 INFO L225 Difference]: With dead ends: 4197 [2025-03-16 14:07:25,398 INFO L226 Difference]: Without dead ends: 2230 [2025-03-16 14:07:25,400 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-16 14:07:25,400 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 92 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:25,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 41 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2025-03-16 14:07:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1968. [2025-03-16 14:07:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.1545500762582612) internal successors, (2271), 1967 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2271 transitions. [2025-03-16 14:07:25,428 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2271 transitions. Word has length 212 [2025-03-16 14:07:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:25,428 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2271 transitions. [2025-03-16 14:07:25,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2271 transitions. [2025-03-16 14:07:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 14:07:25,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:25,432 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2025-03-16 14:07:25,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:07:25,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:25,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1430442415, now seen corresponding path program 1 times [2025-03-16 14:07:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:25,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982454546] [2025-03-16 14:07:25,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:25,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 14:07:25,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 14:07:25,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:25,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 14:07:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982454546] [2025-03-16 14:07:25,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982454546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870692966] [2025-03-16 14:07:25,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:25,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:25,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:25,803 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-16 14:07:25,804 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-16 14:07:25,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 14:07:25,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 14:07:25,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:25,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:25,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:25,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-16 14:07:26,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870692966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:26,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:07:26,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783606191] [2025-03-16 14:07:26,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:26,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:26,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:26,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:26,093 INFO L87 Difference]: Start difference. First operand 1968 states and 2271 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:26,368 INFO L93 Difference]: Finished difference Result 3935 states and 4541 transitions. [2025-03-16 14:07:26,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:26,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 277 [2025-03-16 14:07:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:26,374 INFO L225 Difference]: With dead ends: 3935 [2025-03-16 14:07:26,374 INFO L226 Difference]: Without dead ends: 1968 [2025-03-16 14:07:26,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:07:26,376 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:26,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-03-16 14:07:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1968. [2025-03-16 14:07:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.1209964412811388) internal successors, (2205), 1967 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2205 transitions. [2025-03-16 14:07:26,416 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2205 transitions. Word has length 277 [2025-03-16 14:07:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:26,417 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2205 transitions. [2025-03-16 14:07:26,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2205 transitions. [2025-03-16 14:07:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 14:07:26,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:26,421 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:07:26,428 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-16 14:07:26,625 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-16 14:07:26,625 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:26,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash -410750343, now seen corresponding path program 1 times [2025-03-16 14:07:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129456852] [2025-03-16 14:07:26,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:26,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 14:07:26,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 14:07:26,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:26,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 168 proven. 92 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-16 14:07:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129456852] [2025-03-16 14:07:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129456852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574189585] [2025-03-16 14:07:26,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:26,775 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-16 14:07:26,776 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-16 14:07:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 14:07:26,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 14:07:26,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:26,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:26,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:26,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 14:07:27,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:27,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574189585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:27,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:27,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:07:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701674507] [2025-03-16 14:07:27,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:27,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:27,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:27,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:27,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:27,057 INFO L87 Difference]: Start difference. First operand 1968 states and 2205 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:27,357 INFO L93 Difference]: Finished difference Result 4328 states and 4886 transitions. [2025-03-16 14:07:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 281 [2025-03-16 14:07:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:27,364 INFO L225 Difference]: With dead ends: 4328 [2025-03-16 14:07:27,364 INFO L226 Difference]: Without dead ends: 2361 [2025-03-16 14:07:27,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:27,367 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:27,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 177 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-16 14:07:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2230. [2025-03-16 14:07:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 1.1215791834903543) internal successors, (2500), 2229 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2500 transitions. [2025-03-16 14:07:27,395 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2500 transitions. Word has length 281 [2025-03-16 14:07:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:27,396 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 2500 transitions. [2025-03-16 14:07:27,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2500 transitions. [2025-03-16 14:07:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 14:07:27,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:27,400 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:27,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:07:27,601 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,SelfDestructingSolverStorable10 [2025-03-16 14:07:27,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:27,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1875355422, now seen corresponding path program 1 times [2025-03-16 14:07:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:27,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27767703] [2025-03-16 14:07:27,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:27,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 14:07:27,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 14:07:27,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:27,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 273 proven. 64 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-16 14:07:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27767703] [2025-03-16 14:07:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27767703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:07:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013966595] [2025-03-16 14:07:27,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:27,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:27,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:07:27,776 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-16 14:07:27,779 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-16 14:07:27,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 14:07:27,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 14:07:27,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:27,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:27,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:07:27,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:07:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-16 14:07:27,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:07:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013966595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:27,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:07:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:07:27,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608197444] [2025-03-16 14:07:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:27,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:27,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:27,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:27,924 INFO L87 Difference]: Start difference. First operand 2230 states and 2500 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:28,198 INFO L93 Difference]: Finished difference Result 4721 states and 5316 transitions. [2025-03-16 14:07:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:28,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 300 [2025-03-16 14:07:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:28,204 INFO L225 Difference]: With dead ends: 4721 [2025-03-16 14:07:28,204 INFO L226 Difference]: Without dead ends: 1837 [2025-03-16 14:07:28,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:07:28,207 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:28,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 161 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:07:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2025-03-16 14:07:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1575. [2025-03-16 14:07:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.0914866581956797) internal successors, (1718), 1574 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1718 transitions. [2025-03-16 14:07:28,224 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1718 transitions. Word has length 300 [2025-03-16 14:07:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:28,224 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1718 transitions. [2025-03-16 14:07:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1718 transitions. [2025-03-16 14:07:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-16 14:07:28,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:28,228 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 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] [2025-03-16 14:07:28,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:07:28,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:07:28,433 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:28,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1646537888, now seen corresponding path program 1 times [2025-03-16 14:07:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616401961] [2025-03-16 14:07:28,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:28,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-16 14:07:28,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-16 14:07:28,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:28,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-16 14:07:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616401961] [2025-03-16 14:07:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616401961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:28,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:28,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177783589] [2025-03-16 14:07:28,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:28,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:28,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:28,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:28,594 INFO L87 Difference]: Start difference. First operand 1575 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:28,812 INFO L93 Difference]: Finished difference Result 3542 states and 3842 transitions. [2025-03-16 14:07:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:28,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 311 [2025-03-16 14:07:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:28,816 INFO L225 Difference]: With dead ends: 3542 [2025-03-16 14:07:28,816 INFO L226 Difference]: Without dead ends: 1968 [2025-03-16 14:07:28,817 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-16 14:07:28,817 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:28,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 28 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-03-16 14:07:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1575. [2025-03-16 14:07:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.0914866581956797) internal successors, (1718), 1574 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1718 transitions. [2025-03-16 14:07:28,835 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1718 transitions. Word has length 311 [2025-03-16 14:07:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1718 transitions. [2025-03-16 14:07:28,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1718 transitions. [2025-03-16 14:07:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-16 14:07:28,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:07:28,838 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:07:28,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:07:28,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:07:28,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:07:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 905427496, now seen corresponding path program 1 times [2025-03-16 14:07:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:07:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538744842] [2025-03-16 14:07:28,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:07:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:07:28,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-16 14:07:28,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-16 14:07:28,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:07:28,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:07:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-16 14:07:28,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:07:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538744842] [2025-03-16 14:07:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538744842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:07:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:07:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:07:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914189594] [2025-03-16 14:07:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:07:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:07:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:07:28,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:07:28,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:07:28,944 INFO L87 Difference]: Start difference. First operand 1575 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:07:29,193 INFO L93 Difference]: Finished difference Result 3147 states and 3393 transitions. [2025-03-16 14:07:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:07:29,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 314 [2025-03-16 14:07:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:07:29,194 INFO L225 Difference]: With dead ends: 3147 [2025-03-16 14:07:29,194 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:07:29,195 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-16 14:07:29,196 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 121 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:07:29,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 25 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:07:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:07:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:07:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:07:29,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 314 [2025-03-16 14:07:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:07:29,197 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:07:29,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:07:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:07:29,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:07:29,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:07:29,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:07:29,202 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:07:29,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:07:29,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:07:29,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:07:29 BoogieIcfgContainer [2025-03-16 14:07:29,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:07:29,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:07:29,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:07:29,740 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:07:29,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:07:19" (3/4) ... [2025-03-16 14:07:29,742 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:07:29,754 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:07:29,754 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:07:29,755 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:07:29,755 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:07:29,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:07:29,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:07:29,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:07:29,849 INFO L158 Benchmark]: Toolchain (without parser) took 11290.67ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 103.6MB in the beginning and 182.1MB in the end (delta: -78.5MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. [2025-03-16 14:07:29,849 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:29,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.34ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 76.5MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:07:29,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.70ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 71.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:07:29,850 INFO L158 Benchmark]: Boogie Preprocessor took 62.96ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 67.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:29,850 INFO L158 Benchmark]: IcfgBuilder took 696.31ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 60.2MB in the end (delta: 7.4MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2025-03-16 14:07:29,850 INFO L158 Benchmark]: TraceAbstraction took 9991.90ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 59.7MB in the beginning and 194.8MB in the end (delta: -135.1MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2025-03-16 14:07:29,850 INFO L158 Benchmark]: Witness Printer took 108.05ms. Allocated memory is still 369.1MB. Free memory was 194.8MB in the beginning and 182.1MB in the end (delta: 12.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:07:29,852 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.34ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 76.5MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.70ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 71.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.96ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 67.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 696.31ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 60.2MB in the end (delta: 7.4MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9991.90ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 59.7MB in the beginning and 194.8MB in the end (delta: -135.1MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 108.05ms. Allocated memory is still 369.1MB. Free memory was 194.8MB in the beginning and 182.1MB in the end (delta: 12.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 579]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 265 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 14, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1836 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1836 mSDsluCounter, 1147 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 722 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5262 IncrementalHoareTripleChecker+Invalid, 5984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 722 mSolverCounterUnsat, 1053 mSDtfsCounter, 5262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2230occurred in iteration=11, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2227 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3791 NumberOfCodeBlocks, 3791 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3774 ConstructedInterpolants, 0 QuantifiedInterpolants, 12523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1497 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 3093/3337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: (((((((((((((a7 != 1) && (a17 <= 0)) && (a20 == 1)) || ((((a17 <= 0) && (14 <= a8)) && (a20 == 1)) && (a16 != 4))) || (((((a20 <= 0) && (a17 == 1)) && (a16 <= 5)) || (((a20 <= 0) && (a17 <= 0)) && (a16 <= 5))) && (14 <= a8))) || ((((a20 <= 0) && (a7 != 1)) && (a17 <= 0)) && (15 <= a8))) || ((a21 <= 0) && (a20 == 1))) || ((((a20 <= 0) && (a21 <= 0)) && (a17 == 1)) && (a16 <= 5))) || ((((((a12 == 8) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || ((((a20 <= 0) && (a7 != 1)) && (a17 == 1)) && (15 <= a8))) || ((((a20 <= 0) && (a7 != 1)) && (a17 <= 0)) && (a16 <= 5))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((((a20 <= 0) && (a7 != 1)) && (a17 == 1)) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:07:29,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE