./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label52.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/Problem11_label52.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 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:52:23,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:52:23,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:52:23,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:52:23,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:52:24,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:52:24,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:52:24,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:52:24,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:52:24,025 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:52:24,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:52:24,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:52:24,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:52:24,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:52:24,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:52:24,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:24,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:52:24,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:52:24,027 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 -> 58258448060d1dd7e4bb5d8ae4d59fa53c9505b7e75cc42e4b9e13d20eabdbf0 [2025-03-16 14:52:24,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:52:24,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:52:24,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:52:24,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:52:24,292 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:52:24,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2025-03-16 14:52:25,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a445993/2292f649a2f24120bcfd31921a9d79c0/FLAGdcc0375b4 [2025-03-16 14:52:25,814 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:52:25,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2025-03-16 14:52:25,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a445993/2292f649a2f24120bcfd31921a9d79c0/FLAGdcc0375b4 [2025-03-16 14:52:26,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a445993/2292f649a2f24120bcfd31921a9d79c0 [2025-03-16 14:52:26,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:52:26,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:52:26,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:26,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:52:26,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:52:26,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26, skipping insertion in model container [2025-03-16 14:52:26,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:52:26,231 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/Problem11_label52.c[7609,7622] [2025-03-16 14:52:26,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:26,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:52:26,453 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/Problem11_label52.c[7609,7622] [2025-03-16 14:52:26,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:26,541 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:52:26,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26 WrapperNode [2025-03-16 14:52:26,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:26,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:26,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:52:26,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:52:26,548 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:52:26" (1/1) ... [2025-03-16 14:52:26,568 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:52:26" (1/1) ... [2025-03-16 14:52:26,638 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:52:26,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:26,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:52:26,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:52:26,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:52:26,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,699 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:52:26,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:52:26,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:52:26,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:52:26,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:52:26,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (1/1) ... [2025-03-16 14:52:26,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:26,800 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:52:26,830 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:52:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:52:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:52:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:52:26,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:52:26,899 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:52:26,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:52:27,965 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:52:27,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:52:27,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:52:27,980 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:52:27,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:27 BoogieIcfgContainer [2025-03-16 14:52:27,981 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:52:27,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:52:27,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:52:27,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:52:27,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:52:26" (1/3) ... [2025-03-16 14:52:27,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207fc12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:27, skipping insertion in model container [2025-03-16 14:52:27,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:26" (2/3) ... [2025-03-16 14:52:27,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207fc12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:27, skipping insertion in model container [2025-03-16 14:52:27,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:27" (3/3) ... [2025-03-16 14:52:27,989 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label52.c [2025-03-16 14:52:27,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:52:28,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label52.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:52:28,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:52:28,061 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;@6faf369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:52:28,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:52:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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:52:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 14:52:28,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:28,071 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] [2025-03-16 14:52:28,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 916315209, now seen corresponding path program 1 times [2025-03-16 14:52:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816904416] [2025-03-16 14:52:28,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:28,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:52:28,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:52:28,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:28,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:28,205 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:52:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816904416] [2025-03-16 14:52:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816904416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7020689] [2025-03-16 14:52:28,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:28,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:52:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:28,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:52:28,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:28,228 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:52:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:28,256 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:52:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:52:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 14:52:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:28,266 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:52:28,267 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:52:28,269 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:52:28,271 INFO L435 NwaCegarLoop]: 358 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, 358 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:52:28,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:52:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:52:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:52:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:52:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:52:28,315 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 51 [2025-03-16 14:52:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:28,316 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:52:28,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:52:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:52:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 14:52:28,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:28,317 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] [2025-03-16 14:52:28,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:52:28,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:28,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1956554223, now seen corresponding path program 1 times [2025-03-16 14:52:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078552166] [2025-03-16 14:52:28,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:28,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:52:28,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:52:28,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:28,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:28,533 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:52:28,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:28,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078552166] [2025-03-16 14:52:28,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078552166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:28,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:28,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490957226] [2025-03-16 14:52:28,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:28,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:28,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:28,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:28,536 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:52:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:29,264 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2025-03-16 14:52:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 14:52:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:29,266 INFO L225 Difference]: With dead ends: 630 [2025-03-16 14:52:29,266 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 14:52:29,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:29,268 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 172 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:29,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 14:52:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-16 14:52:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 0 states have call successors, (0), 0 states 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:52:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2025-03-16 14:52:29,282 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 51 [2025-03-16 14:52:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:29,283 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2025-03-16 14:52:29,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:52:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2025-03-16 14:52:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 14:52:29,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:29,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:29,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:52:29,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:29,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1782527102, now seen corresponding path program 1 times [2025-03-16 14:52:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943436202] [2025-03-16 14:52:29,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:29,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 14:52:29,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 14:52:29,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:29,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:29,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943436202] [2025-03-16 14:52:29,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943436202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:29,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627669241] [2025-03-16 14:52:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:29,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:29,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:29,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:29,498 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:52:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:30,100 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2025-03-16 14:52:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-16 14:52:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:30,103 INFO L225 Difference]: With dead ends: 1210 [2025-03-16 14:52:30,103 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 14:52:30,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:30,105 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:30,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 14:52:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2025-03-16 14:52:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states 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:52:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2025-03-16 14:52:30,126 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 119 [2025-03-16 14:52:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:30,126 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2025-03-16 14:52:30,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:52:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2025-03-16 14:52:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 14:52:30,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:30,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:30,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:52:30,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1038116995, now seen corresponding path program 1 times [2025-03-16 14:52:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168168791] [2025-03-16 14:52:30,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:30,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 14:52:30,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 14:52:30,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:30,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168168791] [2025-03-16 14:52:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168168791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:30,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719759310] [2025-03-16 14:52:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:30,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:30,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:30,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:30,402 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:52:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:31,006 INFO L93 Difference]: Finished difference Result 2313 states and 3180 transitions. [2025-03-16 14:52:31,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:31,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-16 14:52:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:31,014 INFO L225 Difference]: With dead ends: 2313 [2025-03-16 14:52:31,014 INFO L226 Difference]: Without dead ends: 1526 [2025-03-16 14:52:31,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:31,016 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:31,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 192 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-03-16 14:52:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1525. [2025-03-16 14:52:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2171916010498687) internal successors, (1855), 1524 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:52:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1855 transitions. [2025-03-16 14:52:31,048 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1855 transitions. Word has length 121 [2025-03-16 14:52:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:31,048 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1855 transitions. [2025-03-16 14:52:31,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:52:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1855 transitions. [2025-03-16 14:52:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 14:52:31,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:31,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:31,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:52:31,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:31,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash 890756246, now seen corresponding path program 1 times [2025-03-16 14:52:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:31,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472310479] [2025-03-16 14:52:31,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:31,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 14:52:31,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 14:52:31,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:31,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472310479] [2025-03-16 14:52:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472310479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:31,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:31,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451439154] [2025-03-16 14:52:31,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:31,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:31,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:31,257 INFO L87 Difference]: Start difference. First operand 1525 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:52:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:31,834 INFO L93 Difference]: Finished difference Result 3256 states and 4122 transitions. [2025-03-16 14:52:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:31,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-16 14:52:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:31,841 INFO L225 Difference]: With dead ends: 3256 [2025-03-16 14:52:31,841 INFO L226 Difference]: Without dead ends: 1916 [2025-03-16 14:52:31,842 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:52:31,844 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 183 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:31,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-16 14:52:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1913. [2025-03-16 14:52:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1912 states have (on average 1.2463389121338913) internal successors, (2383), 1912 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states 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:52:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2383 transitions. [2025-03-16 14:52:31,870 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2383 transitions. Word has length 178 [2025-03-16 14:52:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:31,871 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2383 transitions. [2025-03-16 14:52:31,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:52:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2383 transitions. [2025-03-16 14:52:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 14:52:31,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:31,875 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:31,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:52:31,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:31,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1201738008, now seen corresponding path program 1 times [2025-03-16 14:52:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:31,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883540255] [2025-03-16 14:52:31,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:31,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 14:52:31,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 14:52:31,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:31,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:52:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883540255] [2025-03-16 14:52:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883540255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597133941] [2025-03-16 14:52:32,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:32,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:32,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:32,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:32,091 INFO L87 Difference]: Start difference. First operand 1913 states and 2383 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:52:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:32,720 INFO L93 Difference]: Finished difference Result 4388 states and 5589 transitions. [2025-03-16 14:52:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:32,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 233 [2025-03-16 14:52:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:32,730 INFO L225 Difference]: With dead ends: 4388 [2025-03-16 14:52:32,730 INFO L226 Difference]: Without dead ends: 2660 [2025-03-16 14:52:32,732 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:52:32,732 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 145 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:32,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 390 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-16 14:52:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2466. [2025-03-16 14:52:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 1.2348884381338743) internal successors, (3044), 2465 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states 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:52:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3044 transitions. [2025-03-16 14:52:32,763 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3044 transitions. Word has length 233 [2025-03-16 14:52:32,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:32,764 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3044 transitions. [2025-03-16 14:52:32,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:52:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3044 transitions. [2025-03-16 14:52:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-16 14:52:32,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:32,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:32,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:52:32,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:32,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1165591351, now seen corresponding path program 1 times [2025-03-16 14:52:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395689861] [2025-03-16 14:52:32,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:32,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-16 14:52:32,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-16 14:52:32,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:32,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:52:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395689861] [2025-03-16 14:52:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395689861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539243868] [2025-03-16 14:52:33,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:33,276 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:52:33,278 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:52:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-16 14:52:33,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-16 14:52:33,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:33,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:33,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:52:33,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:52:33,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:33,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539243868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:33,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-16 14:52:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238669176] [2025-03-16 14:52:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:33,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:33,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:33,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:33,472 INFO L87 Difference]: Start difference. First operand 2466 states and 3044 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:52:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:34,092 INFO L93 Difference]: Finished difference Result 6588 states and 8261 transitions. [2025-03-16 14:52:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:34,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 239 [2025-03-16 14:52:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:34,103 INFO L225 Difference]: With dead ends: 6588 [2025-03-16 14:52:34,103 INFO L226 Difference]: Without dead ends: 4123 [2025-03-16 14:52:34,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:34,107 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 158 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:34,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4123 states. [2025-03-16 14:52:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4123 to 4123. [2025-03-16 14:52:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4123 states, 4122 states have (on average 1.227802037845706) internal successors, (5061), 4122 states have internal predecessors, (5061), 0 states have call successors, (0), 0 states 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:52:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5061 transitions. [2025-03-16 14:52:34,161 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5061 transitions. Word has length 239 [2025-03-16 14:52:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:34,162 INFO L471 AbstractCegarLoop]: Abstraction has 4123 states and 5061 transitions. [2025-03-16 14:52:34,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:52:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5061 transitions. [2025-03-16 14:52:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-16 14:52:34,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:34,166 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:34,175 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:52:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:34,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:34,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -642213354, now seen corresponding path program 1 times [2025-03-16 14:52:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162599125] [2025-03-16 14:52:34,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:34,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-16 14:52:34,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-16 14:52:34,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:34,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:52:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162599125] [2025-03-16 14:52:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162599125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108119520] [2025-03-16 14:52:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:34,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:34,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:34,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:34,574 INFO L87 Difference]: Start difference. First operand 4123 states and 5061 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:52:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:35,288 INFO L93 Difference]: Finished difference Result 9543 states and 11818 transitions. [2025-03-16 14:52:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:35,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 270 [2025-03-16 14:52:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:35,306 INFO L225 Difference]: With dead ends: 9543 [2025-03-16 14:52:35,306 INFO L226 Difference]: Without dead ends: 5421 [2025-03-16 14:52:35,311 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:52:35,312 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 144 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:35,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 388 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2025-03-16 14:52:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5412. [2025-03-16 14:52:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5411 states have (on average 1.2066161522823877) internal successors, (6529), 5411 states have internal predecessors, (6529), 0 states have call successors, (0), 0 states 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:52:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 6529 transitions. [2025-03-16 14:52:35,392 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 6529 transitions. Word has length 270 [2025-03-16 14:52:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:35,393 INFO L471 AbstractCegarLoop]: Abstraction has 5412 states and 6529 transitions. [2025-03-16 14:52:35,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:52:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 6529 transitions. [2025-03-16 14:52:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-16 14:52:35,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:35,402 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:35,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:52:35,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:35,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash 48106004, now seen corresponding path program 1 times [2025-03-16 14:52:35,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:35,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314687979] [2025-03-16 14:52:35,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-16 14:52:35,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-16 14:52:35,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:35,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-16 14:52:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314687979] [2025-03-16 14:52:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314687979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:35,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369774083] [2025-03-16 14:52:35,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:35,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:35,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:35,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:35,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:35,599 INFO L87 Difference]: Start difference. First operand 5412 states and 6529 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:52:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:36,205 INFO L93 Difference]: Finished difference Result 12294 states and 15021 transitions. [2025-03-16 14:52:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 316 [2025-03-16 14:52:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:36,221 INFO L225 Difference]: With dead ends: 12294 [2025-03-16 14:52:36,221 INFO L226 Difference]: Without dead ends: 6883 [2025-03-16 14:52:36,227 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:52:36,227 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 171 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:36,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 150 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2025-03-16 14:52:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 4853. [2025-03-16 14:52:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 4852 states have (on average 1.224855729596043) internal successors, (5943), 4852 states have internal predecessors, (5943), 0 states have call successors, (0), 0 states 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:52:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 5943 transitions. [2025-03-16 14:52:36,300 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 5943 transitions. Word has length 316 [2025-03-16 14:52:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:36,301 INFO L471 AbstractCegarLoop]: Abstraction has 4853 states and 5943 transitions. [2025-03-16 14:52:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:52:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 5943 transitions. [2025-03-16 14:52:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 14:52:36,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:36,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:36,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:52:36,308 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:36,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 489089215, now seen corresponding path program 1 times [2025-03-16 14:52:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101545015] [2025-03-16 14:52:36,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:36,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 14:52:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 14:52:36,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:36,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101545015] [2025-03-16 14:52:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101545015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404530723] [2025-03-16 14:52:36,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:36,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:36,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:36,768 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:52:36,771 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:52:36,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 14:52:36,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 14:52:36,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:36,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:36,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:52:36,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:38,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:52:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404530723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:52:39,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:52:39,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 14:52:39,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9074953] [2025-03-16 14:52:39,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:52:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:52:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:39,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:52:39,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:39,639 INFO L87 Difference]: Start difference. First operand 4853 states and 5943 transitions. Second operand has 8 states, 8 states have (on average 74.5) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:52:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:41,674 INFO L93 Difference]: Finished difference Result 14358 states and 17347 transitions. [2025-03-16 14:52:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 14:52:41,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 74.5) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 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 335 [2025-03-16 14:52:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:41,693 INFO L225 Difference]: With dead ends: 14358 [2025-03-16 14:52:41,693 INFO L226 Difference]: Without dead ends: 9506 [2025-03-16 14:52:41,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-16 14:52:41,696 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 985 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:41,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 161 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:52:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9506 states. [2025-03-16 14:52:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9506 to 5034. [2025-03-16 14:52:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5034 states, 5033 states have (on average 1.217762765746076) internal successors, (6129), 5033 states have internal predecessors, (6129), 0 states have call successors, (0), 0 states 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:52:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6129 transitions. [2025-03-16 14:52:41,773 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6129 transitions. Word has length 335 [2025-03-16 14:52:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:41,774 INFO L471 AbstractCegarLoop]: Abstraction has 5034 states and 6129 transitions. [2025-03-16 14:52:41,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.5) internal successors, (596), 7 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:52:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6129 transitions. [2025-03-16 14:52:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 14:52:41,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:41,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:52:41,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:52:41,990 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,SelfDestructingSolverStorable9 [2025-03-16 14:52:41,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:41,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash 460361789, now seen corresponding path program 1 times [2025-03-16 14:52:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261770559] [2025-03-16 14:52:41,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:42,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 14:52:42,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 14:52:42,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:42,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261770559] [2025-03-16 14:52:42,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261770559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:42,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:42,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:42,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238739463] [2025-03-16 14:52:42,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:42,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:42,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:42,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:42,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:42,260 INFO L87 Difference]: Start difference. First operand 5034 states and 6129 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:52:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:43,150 INFO L93 Difference]: Finished difference Result 13947 states and 17017 transitions. [2025-03-16 14:52:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-03-16 14:52:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:43,169 INFO L225 Difference]: With dead ends: 13947 [2025-03-16 14:52:43,169 INFO L226 Difference]: Without dead ends: 8914 [2025-03-16 14:52:43,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:43,176 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 237 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:43,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 62 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:52:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8914 states. [2025-03-16 14:52:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8914 to 7624. [2025-03-16 14:52:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7624 states, 7623 states have (on average 1.1892955529319165) internal successors, (9066), 7623 states have internal predecessors, (9066), 0 states have call successors, (0), 0 states 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:52:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7624 states to 7624 states and 9066 transitions. [2025-03-16 14:52:43,250 INFO L78 Accepts]: Start accepts. Automaton has 7624 states and 9066 transitions. Word has length 356 [2025-03-16 14:52:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:43,251 INFO L471 AbstractCegarLoop]: Abstraction has 7624 states and 9066 transitions. [2025-03-16 14:52:43,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:52:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7624 states and 9066 transitions. [2025-03-16 14:52:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-16 14:52:43,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:43,262 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:43,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:52:43,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:43,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:43,263 INFO L85 PathProgramCache]: Analyzing trace with hash 983081262, now seen corresponding path program 1 times [2025-03-16 14:52:43,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:43,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197475620] [2025-03-16 14:52:43,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:43,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-16 14:52:43,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-16 14:52:43,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 14:52:43,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197475620] [2025-03-16 14:52:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197475620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:43,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:43,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:43,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958251295] [2025-03-16 14:52:43,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:43,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:43,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:43,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:43,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:43,455 INFO L87 Difference]: Start difference. First operand 7624 states and 9066 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:52:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:44,316 INFO L93 Difference]: Finished difference Result 20970 states and 24862 transitions. [2025-03-16 14:52:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:44,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 430 [2025-03-16 14:52:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:44,337 INFO L225 Difference]: With dead ends: 20970 [2025-03-16 14:52:44,338 INFO L226 Difference]: Without dead ends: 13347 [2025-03-16 14:52:44,346 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:52:44,347 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 287 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:44,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 74 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:52:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13347 states. [2025-03-16 14:52:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13347 to 13160. [2025-03-16 14:52:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13160 states, 13159 states have (on average 1.1724295159206626) internal successors, (15428), 13159 states have internal predecessors, (15428), 0 states have call successors, (0), 0 states 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:52:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 15428 transitions. [2025-03-16 14:52:44,492 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 15428 transitions. Word has length 430 [2025-03-16 14:52:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:44,492 INFO L471 AbstractCegarLoop]: Abstraction has 13160 states and 15428 transitions. [2025-03-16 14:52:44,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:52:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 15428 transitions. [2025-03-16 14:52:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-16 14:52:44,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:44,506 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:44,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:52:44,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1169651223, now seen corresponding path program 1 times [2025-03-16 14:52:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338975967] [2025-03-16 14:52:44,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:44,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-16 14:52:44,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-16 14:52:44,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:44,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 14:52:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:44,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338975967] [2025-03-16 14:52:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338975967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:44,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307029545] [2025-03-16 14:52:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:44,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:44,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:44,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:44,799 INFO L87 Difference]: Start difference. First operand 13160 states and 15428 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:52:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:45,630 INFO L93 Difference]: Finished difference Result 28530 states and 33338 transitions. [2025-03-16 14:52:45,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 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 430 [2025-03-16 14:52:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:45,656 INFO L225 Difference]: With dead ends: 28530 [2025-03-16 14:52:45,656 INFO L226 Difference]: Without dead ends: 15371 [2025-03-16 14:52:45,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:45,668 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 251 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:45,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 58 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2025-03-16 14:52:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13160. [2025-03-16 14:52:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13160 states, 13159 states have (on average 1.1724295159206626) internal successors, (15428), 13159 states have internal predecessors, (15428), 0 states have call successors, (0), 0 states 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:52:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 15428 transitions. [2025-03-16 14:52:45,791 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 15428 transitions. Word has length 430 [2025-03-16 14:52:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:45,792 INFO L471 AbstractCegarLoop]: Abstraction has 13160 states and 15428 transitions. [2025-03-16 14:52:45,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:52:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 15428 transitions. [2025-03-16 14:52:45,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 14:52:45,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:45,803 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:45,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:52:45,803 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:45,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash 947009883, now seen corresponding path program 1 times [2025-03-16 14:52:45,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:45,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917178720] [2025-03-16 14:52:45,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:45,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 14:52:45,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 14:52:45,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:45,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 14:52:46,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:46,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917178720] [2025-03-16 14:52:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917178720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:46,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:46,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887299035] [2025-03-16 14:52:46,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:46,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:46,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:46,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:46,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:46,045 INFO L87 Difference]: Start difference. First operand 13160 states and 15428 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:52:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:46,558 INFO L93 Difference]: Finished difference Result 26522 states and 31078 transitions. [2025-03-16 14:52:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 475 [2025-03-16 14:52:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:46,583 INFO L225 Difference]: With dead ends: 26522 [2025-03-16 14:52:46,583 INFO L226 Difference]: Without dead ends: 13363 [2025-03-16 14:52:46,595 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:52:46,596 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 62 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:46,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 328 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13363 states. [2025-03-16 14:52:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13363 to 12608. [2025-03-16 14:52:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12608 states, 12607 states have (on average 1.1452367732212263) internal successors, (14438), 12607 states have internal predecessors, (14438), 0 states have call successors, (0), 0 states 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:52:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12608 states to 12608 states and 14438 transitions. [2025-03-16 14:52:46,714 INFO L78 Accepts]: Start accepts. Automaton has 12608 states and 14438 transitions. Word has length 475 [2025-03-16 14:52:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:46,715 INFO L471 AbstractCegarLoop]: Abstraction has 12608 states and 14438 transitions. [2025-03-16 14:52:46,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:52:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12608 states and 14438 transitions. [2025-03-16 14:52:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 14:52:46,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:46,724 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:46,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:52:46,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:46,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1136004386, now seen corresponding path program 1 times [2025-03-16 14:52:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644172033] [2025-03-16 14:52:46,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:46,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 14:52:46,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 14:52:46,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:46,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-16 14:52:46,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:46,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644172033] [2025-03-16 14:52:46,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644172033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:46,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:46,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364574399] [2025-03-16 14:52:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:46,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:46,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:46,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:46,914 INFO L87 Difference]: Start difference. First operand 12608 states and 14438 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:52:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:47,239 INFO L93 Difference]: Finished difference Result 24645 states and 28182 transitions. [2025-03-16 14:52:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 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 487 [2025-03-16 14:52:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:47,255 INFO L225 Difference]: With dead ends: 24645 [2025-03-16 14:52:47,255 INFO L226 Difference]: Without dead ends: 12038 [2025-03-16 14:52:47,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:47,267 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:47,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 36 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:52:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12038 states. [2025-03-16 14:52:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12038 to 12034. [2025-03-16 14:52:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12034 states, 12033 states have (on average 1.1411119421590625) internal successors, (13731), 12033 states have internal predecessors, (13731), 0 states have call successors, (0), 0 states 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:52:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12034 states to 12034 states and 13731 transitions. [2025-03-16 14:52:47,375 INFO L78 Accepts]: Start accepts. Automaton has 12034 states and 13731 transitions. Word has length 487 [2025-03-16 14:52:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:47,376 INFO L471 AbstractCegarLoop]: Abstraction has 12034 states and 13731 transitions. [2025-03-16 14:52:47,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:52:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 12034 states and 13731 transitions. [2025-03-16 14:52:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-16 14:52:47,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:47,385 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:52:47,385 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1897971958, now seen corresponding path program 1 times [2025-03-16 14:52:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053145] [2025-03-16 14:52:47,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:47,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-16 14:52:47,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-16 14:52:47,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:47,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:52:47,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:47,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053145] [2025-03-16 14:52:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:47,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773934424] [2025-03-16 14:52:47,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:47,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:47,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:47,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:47,543 INFO L87 Difference]: Start difference. First operand 12034 states and 13731 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:52:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:48,041 INFO L93 Difference]: Finished difference Result 22388 states and 25412 transitions. [2025-03-16 14:52:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:48,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 503 [2025-03-16 14:52:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:48,051 INFO L225 Difference]: With dead ends: 22388 [2025-03-16 14:52:48,051 INFO L226 Difference]: Without dead ends: 10355 [2025-03-16 14:52:48,058 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:52:48,059 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 79 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:48,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 122 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10355 states. [2025-03-16 14:52:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10355 to 9619. [2025-03-16 14:52:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9619 states, 9618 states have (on average 1.114368891661468) internal successors, (10718), 9618 states have internal predecessors, (10718), 0 states have call successors, (0), 0 states 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:52:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9619 states to 9619 states and 10718 transitions. [2025-03-16 14:52:48,177 INFO L78 Accepts]: Start accepts. Automaton has 9619 states and 10718 transitions. Word has length 503 [2025-03-16 14:52:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:48,177 INFO L471 AbstractCegarLoop]: Abstraction has 9619 states and 10718 transitions. [2025-03-16 14:52:48,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:52:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9619 states and 10718 transitions. [2025-03-16 14:52:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-03-16 14:52:48,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:48,194 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:48,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:52:48,194 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:48,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash 858522724, now seen corresponding path program 1 times [2025-03-16 14:52:48,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:48,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295452741] [2025-03-16 14:52:48,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:48,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-03-16 14:52:48,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-03-16 14:52:48,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:48,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-03-16 14:52:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:48,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295452741] [2025-03-16 14:52:48,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295452741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:48,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:48,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433151027] [2025-03-16 14:52:48,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:48,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:48,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:48,454 INFO L87 Difference]: Start difference. First operand 9619 states and 10718 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:52:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:48,933 INFO L93 Difference]: Finished difference Result 20892 states and 23288 transitions. [2025-03-16 14:52:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:48,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 759 [2025-03-16 14:52:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:48,941 INFO L225 Difference]: With dead ends: 20892 [2025-03-16 14:52:48,941 INFO L226 Difference]: Without dead ends: 10169 [2025-03-16 14:52:48,947 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:52:48,947 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 194 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:48,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 338 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10169 states. [2025-03-16 14:52:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10169 to 10169. [2025-03-16 14:52:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.0947088906372935) internal successors, (11131), 10168 states have internal predecessors, (11131), 0 states have call successors, (0), 0 states 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:52:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 11131 transitions. [2025-03-16 14:52:49,054 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 11131 transitions. Word has length 759 [2025-03-16 14:52:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:49,054 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 11131 transitions. [2025-03-16 14:52:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:52:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 11131 transitions. [2025-03-16 14:52:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-03-16 14:52:49,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:49,064 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:49,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:52:49,064 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:49,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1219242093, now seen corresponding path program 1 times [2025-03-16 14:52:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685829700] [2025-03-16 14:52:49,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:49,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-03-16 14:52:49,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-03-16 14:52:49,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:49,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1501 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-16 14:52:49,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:49,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685829700] [2025-03-16 14:52:49,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685829700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:49,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:49,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479854033] [2025-03-16 14:52:49,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:49,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:49,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:49,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:49,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:49,308 INFO L87 Difference]: Start difference. First operand 10169 states and 11131 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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:52:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:49,745 INFO L93 Difference]: Finished difference Result 21438 states and 23423 transitions. [2025-03-16 14:52:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:49,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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 849 [2025-03-16 14:52:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:49,746 INFO L225 Difference]: With dead ends: 21438 [2025-03-16 14:52:49,746 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:52:49,753 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:52:49,754 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 53 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:49,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 318 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:52:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:52:49,754 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:52:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:52:49,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 849 [2025-03-16 14:52:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:49,755 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:52:49,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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:52:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:52:49,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:52:49,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:52:49,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:52:49,764 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:49,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:52:51,435 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:52:51,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:52:51 BoogieIcfgContainer [2025-03-16 14:52:51,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:52:51,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:52:51,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:52:51,447 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:52:51,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:27" (3/4) ... [2025-03-16 14:52:51,451 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:52:51,465 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:52:51,466 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:52:51,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:52:51,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:52:51,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:52:51,577 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:52:51,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:52:51,578 INFO L158 Benchmark]: Toolchain (without parser) took 25551.30ms. Allocated memory was 167.8MB in the beginning and 838.9MB in the end (delta: 671.1MB). Free memory was 119.8MB in the beginning and 671.2MB in the end (delta: -551.4MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. [2025-03-16 14:52:51,580 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:52:51,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.19ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 76.9MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:52:51,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.86ms. Allocated memory is still 167.8MB. Free memory was 76.9MB in the beginning and 60.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:52:51,581 INFO L158 Benchmark]: Boogie Preprocessor took 133.57ms. Allocated memory is still 167.8MB. Free memory was 60.1MB in the beginning and 37.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:52:51,581 INFO L158 Benchmark]: IcfgBuilder took 1207.92ms. Allocated memory is still 167.8MB. Free memory was 37.0MB in the beginning and 108.0MB in the end (delta: -70.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:52:51,581 INFO L158 Benchmark]: TraceAbstraction took 23462.79ms. Allocated memory was 167.8MB in the beginning and 838.9MB in the end (delta: 671.1MB). Free memory was 108.0MB in the beginning and 687.9MB in the end (delta: -580.0MB). Peak memory consumption was 521.0MB. Max. memory is 16.1GB. [2025-03-16 14:52:51,581 INFO L158 Benchmark]: Witness Printer took 131.08ms. Allocated memory is still 838.9MB. Free memory was 687.9MB in the beginning and 671.2MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:52:51,582 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.38ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.19ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 76.9MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.86ms. Allocated memory is still 167.8MB. Free memory was 76.9MB in the beginning and 60.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.57ms. Allocated memory is still 167.8MB. Free memory was 60.1MB in the beginning and 37.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1207.92ms. Allocated memory is still 167.8MB. Free memory was 37.0MB in the beginning and 108.0MB in the end (delta: -70.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23462.79ms. Allocated memory was 167.8MB in the beginning and 838.9MB in the end (delta: 671.1MB). Free memory was 108.0MB in the beginning and 687.9MB in the end (delta: -580.0MB). Peak memory consumption was 521.0MB. Max. memory is 16.1GB. * Witness Printer took 131.08ms. Allocated memory is still 838.9MB. Free memory was 687.9MB in the beginning and 671.2MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. 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: 172]: 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, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3561 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3561 mSDsluCounter, 3716 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 400 mSDsCounter, 2217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12292 IncrementalHoareTripleChecker+Invalid, 14509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2217 mSolverCounterUnsat, 3316 mSDtfsCounter, 12292 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 968 GetRequests, 931 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13160occurred in iteration=12, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 11903 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 6776 NumberOfCodeBlocks, 6776 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 7090 ConstructedInterpolants, 0 QuantifiedInterpolants, 23880 SizeOfPredicates, 8 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 8352/8515 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: 1044]: Location Invariant Derived location invariant: ((((((((((((((((((((((a25 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || (((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a8 == 15))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (307 <= a23)) || ((a25 == 13) && (a3 == 1))) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (a8 == 15))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a8 == 15))) || (((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15))) || ((((((long long) a29 + 21) <= 0) && (a25 == 11)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 245)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:52:51,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE