./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label58.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d01c93de245456455f0527bcf882987e2bed2e3604b850da24f21647f0ce8431 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:55:57,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:55:57,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:55:57,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:55:57,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:55:57,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:55:57,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:55:57,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:55:57,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:55:57,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:55:57,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:55:57,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:55:57,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:55:57,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:55:57,943 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:55:57,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:55:57,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:55:57,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:55:57,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:55:57,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:55:57,945 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-jdk21/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 -> d01c93de245456455f0527bcf882987e2bed2e3604b850da24f21647f0ce8431 [2025-02-05 11:55:58,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:55:58,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:55:58,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:55:58,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:55:58,163 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:55:58,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label58.c [2025-02-05 11:55:59,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef36fc3d0/57865d453b0241629d54bbc9a4f9a79b/FLAG6de9ebd8f [2025-02-05 11:55:59,782 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:55:59,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label58.c [2025-02-05 11:55:59,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef36fc3d0/57865d453b0241629d54bbc9a4f9a79b/FLAG6de9ebd8f [2025-02-05 11:55:59,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef36fc3d0/57865d453b0241629d54bbc9a4f9a79b [2025-02-05 11:55:59,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:55:59,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:55:59,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:55:59,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:55:59,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:55:59,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:59" (1/1) ... [2025-02-05 11:55:59,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f677aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:55:59, skipping insertion in model container [2025-02-05 11:55:59,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:55:59" (1/1) ... [2025-02-05 11:56:00,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:56:00,189 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label58.c[6184,6197] [2025-02-05 11:56:00,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:56:00,643 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:56:00,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label58.c[6184,6197] [2025-02-05 11:56:00,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:56:00,805 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:56:00,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00 WrapperNode [2025-02-05 11:56:00,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:56:00,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:56:00,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:56:00,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:56:00,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:00,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,006 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-02-05 11:56:01,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:56:01,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:56:01,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:56:01,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:56:01,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,094 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-02-05 11:56:01,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:56:01,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:56:01,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:56:01,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:56:01,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (1/1) ... [2025-02-05 11:56:01,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:56:01,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:01,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:56:01,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:56:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:56:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:56:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:56:01,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:56:01,302 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:56:01,304 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:56:03,070 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-02-05 11:56:03,148 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-02-05 11:56:03,149 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:56:03,162 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:56:03,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:56:03,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:03 BoogieIcfgContainer [2025-02-05 11:56:03,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:56:03,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:56:03,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:56:03,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:56:03,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:55:59" (1/3) ... [2025-02-05 11:56:03,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584466e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:03, skipping insertion in model container [2025-02-05 11:56:03,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:00" (2/3) ... [2025-02-05 11:56:03,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584466e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:03, skipping insertion in model container [2025-02-05 11:56:03,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:03" (3/3) ... [2025-02-05 11:56:03,170 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label58.c [2025-02-05 11:56:03,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:56:03,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label58.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:56:03,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:56:03,227 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;@44c174e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:56:03,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:56:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 11:56:03,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:03,236 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] [2025-02-05 11:56:03,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:03,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -719310916, now seen corresponding path program 1 times [2025-02-05 11:56:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:03,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86209277] [2025-02-05 11:56:03,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 11:56:03,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 11:56:03,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:03,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:03,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86209277] [2025-02-05 11:56:03,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86209277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:03,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:03,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395997667] [2025-02-05 11:56:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:03,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:03,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:03,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:03,580 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:04,980 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-02-05 11:56:04,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-02-05 11:56:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:04,989 INFO L225 Difference]: With dead ends: 1155 [2025-02-05 11:56:04,990 INFO L226 Difference]: Without dead ends: 667 [2025-02-05 11:56:04,992 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-02-05 11:56:04,994 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 294 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:04,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:56:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-05 11:56:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-02-05 11:56:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-02-05 11:56:05,036 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 50 [2025-02-05 11:56:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:05,037 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-02-05 11:56:05,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-02-05 11:56:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 11:56:05,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:05,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:05,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:56:05,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:05,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -972857276, now seen corresponding path program 1 times [2025-02-05 11:56:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:05,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518405134] [2025-02-05 11:56:05,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:05,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 11:56:05,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 11:56:05,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:05,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518405134] [2025-02-05 11:56:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518405134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:05,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866103178] [2025-02-05 11:56:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:05,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:05,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:05,205 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:06,880 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2025-02-05 11:56:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:06,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-05 11:56:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:06,885 INFO L225 Difference]: With dead ends: 1953 [2025-02-05 11:56:06,885 INFO L226 Difference]: Without dead ends: 1290 [2025-02-05 11:56:06,886 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-02-05 11:56:06,887 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:06,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 324 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:56:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-05 11:56:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2025-02-05 11:56:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3981264637002342) internal successors, (1791), 1281 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1791 transitions. [2025-02-05 11:56:06,915 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1791 transitions. Word has length 125 [2025-02-05 11:56:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:06,915 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1791 transitions. [2025-02-05 11:56:06,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1791 transitions. [2025-02-05 11:56:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 11:56:06,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:06,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:06,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:56:06,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:06,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1157976762, now seen corresponding path program 1 times [2025-02-05 11:56:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529224237] [2025-02-05 11:56:06,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:06,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 11:56:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 11:56:06,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:06,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529224237] [2025-02-05 11:56:07,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529224237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:07,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:07,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335925046] [2025-02-05 11:56:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:07,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:07,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:07,087 INFO L87 Difference]: Start difference. First operand 1282 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:08,470 INFO L93 Difference]: Finished difference Result 3766 states and 5261 transitions. [2025-02-05 11:56:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:08,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-02-05 11:56:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:08,477 INFO L225 Difference]: With dead ends: 3766 [2025-02-05 11:56:08,477 INFO L226 Difference]: Without dead ends: 2486 [2025-02-05 11:56:08,479 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-02-05 11:56:08,479 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:08,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:56:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-02-05 11:56:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182. [2025-02-05 11:56:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2025-02-05 11:56:08,517 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 129 [2025-02-05 11:56:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:08,518 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2025-02-05 11:56:08,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2025-02-05 11:56:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-05 11:56:08,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:08,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:08,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:56:08,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:08,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1909675953, now seen corresponding path program 1 times [2025-02-05 11:56:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:08,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430924785] [2025-02-05 11:56:08,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:08,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-05 11:56:08,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-05 11:56:08,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:08,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:08,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430924785] [2025-02-05 11:56:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430924785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14332050] [2025-02-05 11:56:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:08,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:08,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:08,874 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:10,045 INFO L93 Difference]: Finished difference Result 5567 states and 7266 transitions. [2025-02-05 11:56:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:10,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-02-05 11:56:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:10,054 INFO L225 Difference]: With dead ends: 5567 [2025-02-05 11:56:10,054 INFO L226 Difference]: Without dead ends: 3387 [2025-02-05 11:56:10,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:10,056 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 278 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:10,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 614 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:56:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-02-05 11:56:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385. [2025-02-05 11:56:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.216016548463357) internal successors, (4115), 3384 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4115 transitions. [2025-02-05 11:56:10,106 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4115 transitions. Word has length 246 [2025-02-05 11:56:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:10,107 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 4115 transitions. [2025-02-05 11:56:10,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4115 transitions. [2025-02-05 11:56:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-05 11:56:10,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:10,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:56:10,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash -15070973, now seen corresponding path program 1 times [2025-02-05 11:56:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551198486] [2025-02-05 11:56:10,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:10,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 11:56:10,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 11:56:10,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:10,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:10,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551198486] [2025-02-05 11:56:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551198486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:10,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365532882] [2025-02-05 11:56:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:10,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:10,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:10,372 INFO L87 Difference]: Start difference. First operand 3385 states and 4115 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:11,673 INFO L93 Difference]: Finished difference Result 7972 states and 9907 transitions. [2025-02-05 11:56:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 332 [2025-02-05 11:56:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:11,699 INFO L225 Difference]: With dead ends: 7972 [2025-02-05 11:56:11,699 INFO L226 Difference]: Without dead ends: 4589 [2025-02-05 11:56:11,707 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-02-05 11:56:11,708 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 279 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:11,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 631 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:56:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2025-02-05 11:56:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4285. [2025-02-05 11:56:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 4284 states have (on average 1.1993464052287581) internal successors, (5138), 4284 states have internal predecessors, (5138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 5138 transitions. [2025-02-05 11:56:11,766 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 5138 transitions. Word has length 332 [2025-02-05 11:56:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:11,766 INFO L471 AbstractCegarLoop]: Abstraction has 4285 states and 5138 transitions. [2025-02-05 11:56:11,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 5138 transitions. [2025-02-05 11:56:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-05 11:56:11,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:11,770 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:11,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:56:11,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:11,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1449772157, now seen corresponding path program 1 times [2025-02-05 11:56:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:11,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632859003] [2025-02-05 11:56:11,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:11,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-05 11:56:11,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-05 11:56:11,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:11,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 11:56:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632859003] [2025-02-05 11:56:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632859003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937209587] [2025-02-05 11:56:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:12,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:12,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:12,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:12,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:12,385 INFO L87 Difference]: Start difference. First operand 4285 states and 5138 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:13,725 INFO L93 Difference]: Finished difference Result 8867 states and 10585 transitions. [2025-02-05 11:56:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:13,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 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 410 [2025-02-05 11:56:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:13,747 INFO L225 Difference]: With dead ends: 8867 [2025-02-05 11:56:13,747 INFO L226 Difference]: Without dead ends: 4584 [2025-02-05 11:56:13,755 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-02-05 11:56:13,755 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:13,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:56:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2025-02-05 11:56:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4584. [2025-02-05 11:56:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 1.1876500109098844) internal successors, (5443), 4583 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 5443 transitions. [2025-02-05 11:56:13,852 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 5443 transitions. Word has length 410 [2025-02-05 11:56:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 4584 states and 5443 transitions. [2025-02-05 11:56:13,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 5443 transitions. [2025-02-05 11:56:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-02-05 11:56:13,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:13,860 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:56:13,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:56:13,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:13,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash -185261512, now seen corresponding path program 1 times [2025-02-05 11:56:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088228087] [2025-02-05 11:56:13,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:13,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-02-05 11:56:13,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-02-05 11:56:13,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:13,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-05 11:56:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088228087] [2025-02-05 11:56:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088228087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722151785] [2025-02-05 11:56:14,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:14,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:14,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:14,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:14,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:14,209 INFO L87 Difference]: Start difference. First operand 4584 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:15,866 INFO L93 Difference]: Finished difference Result 11558 states and 13806 transitions. [2025-02-05 11:56:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:15,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 501 [2025-02-05 11:56:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:15,882 INFO L225 Difference]: With dead ends: 11558 [2025-02-05 11:56:15,882 INFO L226 Difference]: Without dead ends: 7275 [2025-02-05 11:56:15,885 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-02-05 11:56:15,885 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:15,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:56:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2025-02-05 11:56:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 6079. [2025-02-05 11:56:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6079 states, 6078 states have (on average 1.1661730832510695) internal successors, (7088), 6078 states have internal predecessors, (7088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6079 states to 6079 states and 7088 transitions. [2025-02-05 11:56:15,952 INFO L78 Accepts]: Start accepts. Automaton has 6079 states and 7088 transitions. Word has length 501 [2025-02-05 11:56:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:15,952 INFO L471 AbstractCegarLoop]: Abstraction has 6079 states and 7088 transitions. [2025-02-05 11:56:15,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6079 states and 7088 transitions. [2025-02-05 11:56:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-02-05 11:56:15,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:15,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:15,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:56:15,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash -652450868, now seen corresponding path program 1 times [2025-02-05 11:56:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828269307] [2025-02-05 11:56:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:16,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-02-05 11:56:16,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-02-05 11:56:16,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:16,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 505 proven. 39 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-02-05 11:56:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828269307] [2025-02-05 11:56:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828269307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556012565] [2025-02-05 11:56:16,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:16,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:16,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:16,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:16,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:56:16,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-02-05 11:56:16,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-02-05 11:56:16,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:16,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:16,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:16,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-02-05 11:56:16,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556012565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:56:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905674928] [2025-02-05 11:56:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:16,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:16,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:16,868 INFO L87 Difference]: Start difference. First operand 6079 states and 7088 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:17,915 INFO L93 Difference]: Finished difference Result 13949 states and 16592 transitions. [2025-02-05 11:56:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:17,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 534 [2025-02-05 11:56:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:17,931 INFO L225 Difference]: With dead ends: 13949 [2025-02-05 11:56:17,931 INFO L226 Difference]: Without dead ends: 8171 [2025-02-05 11:56:17,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:17,935 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 367 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:17,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:56:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2025-02-05 11:56:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 8171. [2025-02-05 11:56:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 8170 states have (on average 1.1799265605875153) internal successors, (9640), 8170 states have internal predecessors, (9640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 9640 transitions. [2025-02-05 11:56:18,008 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 9640 transitions. Word has length 534 [2025-02-05 11:56:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:18,009 INFO L471 AbstractCegarLoop]: Abstraction has 8171 states and 9640 transitions. [2025-02-05 11:56:18,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 9640 transitions. [2025-02-05 11:56:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-05 11:56:18,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:18,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:18,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:56:18,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:18,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:18,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1432441410, now seen corresponding path program 1 times [2025-02-05 11:56:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092877824] [2025-02-05 11:56:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:18,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-05 11:56:18,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-05 11:56:18,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:18,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-05 11:56:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092877824] [2025-02-05 11:56:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092877824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:18,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479353503] [2025-02-05 11:56:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:18,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:18,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:18,623 INFO L87 Difference]: Start difference. First operand 8171 states and 9640 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:19,999 INFO L93 Difference]: Finished difference Result 19943 states and 23711 transitions. [2025-02-05 11:56:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:20,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 538 [2025-02-05 11:56:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:20,031 INFO L225 Difference]: With dead ends: 19943 [2025-02-05 11:56:20,031 INFO L226 Difference]: Without dead ends: 12073 [2025-02-05 11:56:20,039 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-02-05 11:56:20,040 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 247 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:20,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 622 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:56:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12073 states. [2025-02-05 11:56:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12073 to 12062. [2025-02-05 11:56:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12062 states, 12061 states have (on average 1.1563717768012602) internal successors, (13947), 12061 states have internal predecessors, (13947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12062 states to 12062 states and 13947 transitions. [2025-02-05 11:56:20,150 INFO L78 Accepts]: Start accepts. Automaton has 12062 states and 13947 transitions. Word has length 538 [2025-02-05 11:56:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:20,151 INFO L471 AbstractCegarLoop]: Abstraction has 12062 states and 13947 transitions. [2025-02-05 11:56:20,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 12062 states and 13947 transitions. [2025-02-05 11:56:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-02-05 11:56:20,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:20,157 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:20,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:56:20,157 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:20,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1379145353, now seen corresponding path program 1 times [2025-02-05 11:56:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:20,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108055926] [2025-02-05 11:56:20,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:20,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-02-05 11:56:20,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-02-05 11:56:20,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:20,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-02-05 11:56:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:20,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108055926] [2025-02-05 11:56:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108055926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:20,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879297717] [2025-02-05 11:56:20,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:20,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:20,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:20,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:20,722 INFO L87 Difference]: Start difference. First operand 12062 states and 13947 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:22,071 INFO L93 Difference]: Finished difference Result 26517 states and 31124 transitions. [2025-02-05 11:56:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:22,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 577 [2025-02-05 11:56:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:22,094 INFO L225 Difference]: With dead ends: 26517 [2025-02-05 11:56:22,094 INFO L226 Difference]: Without dead ends: 14756 [2025-02-05 11:56:22,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-05 11:56:22,106 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 319 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:22,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 212 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:56:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14756 states. [2025-02-05 11:56:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14756 to 14158. [2025-02-05 11:56:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14157 states have (on average 1.1734830825739917) internal successors, (16613), 14157 states have internal predecessors, (16613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16613 transitions. [2025-02-05 11:56:22,233 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16613 transitions. Word has length 577 [2025-02-05 11:56:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:22,233 INFO L471 AbstractCegarLoop]: Abstraction has 14158 states and 16613 transitions. [2025-02-05 11:56:22,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16613 transitions. [2025-02-05 11:56:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-02-05 11:56:22,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:22,240 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:22,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:56:22,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:22,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1439806888, now seen corresponding path program 1 times [2025-02-05 11:56:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:22,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380300150] [2025-02-05 11:56:22,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:22,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-02-05 11:56:22,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-02-05 11:56:22,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:22,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-02-05 11:56:22,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:22,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380300150] [2025-02-05 11:56:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380300150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615813566] [2025-02-05 11:56:22,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:22,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:22,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:22,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:22,529 INFO L87 Difference]: Start difference. First operand 14158 states and 16613 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:23,447 INFO L93 Difference]: Finished difference Result 29211 states and 34188 transitions. [2025-02-05 11:56:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 592 [2025-02-05 11:56:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:23,493 INFO L225 Difference]: With dead ends: 29211 [2025-02-05 11:56:23,493 INFO L226 Difference]: Without dead ends: 14158 [2025-02-05 11:56:23,517 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-02-05 11:56:23,518 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 252 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:23,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 666 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:56:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2025-02-05 11:56:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 14158. [2025-02-05 11:56:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14157 states have (on average 1.1704457159002613) internal successors, (16570), 14157 states have internal predecessors, (16570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16570 transitions. [2025-02-05 11:56:23,665 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16570 transitions. Word has length 592 [2025-02-05 11:56:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 14158 states and 16570 transitions. [2025-02-05 11:56:23,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16570 transitions. [2025-02-05 11:56:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-02-05 11:56:23,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:23,673 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:23,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:56:23,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:23,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2037447850, now seen corresponding path program 1 times [2025-02-05 11:56:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:23,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357995907] [2025-02-05 11:56:23,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:23,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-02-05 11:56:23,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-02-05 11:56:23,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:23,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 662 proven. 39 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-02-05 11:56:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:24,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357995907] [2025-02-05 11:56:24,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357995907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484519096] [2025-02-05 11:56:24,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:24,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:24,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:24,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:24,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:56:24,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-02-05 11:56:24,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-02-05 11:56:24,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:24,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:24,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:24,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-02-05 11:56:24,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484519096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:24,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:56:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069507483] [2025-02-05 11:56:24,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:24,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:24,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:24,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:24,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:24,548 INFO L87 Difference]: Start difference. First operand 14158 states and 16570 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:25,702 INFO L93 Difference]: Finished difference Result 28014 states and 32752 transitions. [2025-02-05 11:56:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 613 [2025-02-05 11:56:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:25,716 INFO L225 Difference]: With dead ends: 28014 [2025-02-05 11:56:25,717 INFO L226 Difference]: Without dead ends: 14157 [2025-02-05 11:56:25,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:25,727 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 252 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:25,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:56:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2025-02-05 11:56:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 14156. [2025-02-05 11:56:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14156 states, 14155 states have (on average 1.111833274461321) internal successors, (15738), 14155 states have internal predecessors, (15738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 15738 transitions. [2025-02-05 11:56:25,838 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 15738 transitions. Word has length 613 [2025-02-05 11:56:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:25,838 INFO L471 AbstractCegarLoop]: Abstraction has 14156 states and 15738 transitions. [2025-02-05 11:56:25,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 15738 transitions. [2025-02-05 11:56:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-02-05 11:56:25,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:25,845 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:25,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:56:26,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:26,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:26,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1822738118, now seen corresponding path program 1 times [2025-02-05 11:56:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063245180] [2025-02-05 11:56:26,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-02-05 11:56:26,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-02-05 11:56:26,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:26,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 589 proven. 39 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-02-05 11:56:26,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:26,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063245180] [2025-02-05 11:56:26,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063245180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:26,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350654955] [2025-02-05 11:56:26,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:26,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:26,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:26,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:56:26,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:56:26,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-02-05 11:56:26,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-02-05 11:56:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:26,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:56:26,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 589 proven. 39 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-02-05 11:56:27,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:56:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 589 proven. 39 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-02-05 11:56:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350654955] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:56:27,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:56:27,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-05 11:56:27,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093081997] [2025-02-05 11:56:27,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:56:27,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 11:56:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:27,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 11:56:27,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:56:27,876 INFO L87 Difference]: Start difference. First operand 14156 states and 15738 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:32,260 INFO L93 Difference]: Finished difference Result 36046 states and 40035 transitions. [2025-02-05 11:56:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 11:56:32,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 614 [2025-02-05 11:56:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:32,272 INFO L225 Difference]: With dead ends: 36046 [2025-02-05 11:56:32,272 INFO L226 Difference]: Without dead ends: 16250 [2025-02-05 11:56:32,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1237 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-02-05 11:56:32,281 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 3061 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5961 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3061 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 6648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 5961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:32,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3061 Valid, 249 Invalid, 6648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 5961 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 11:56:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16250 states. [2025-02-05 11:56:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16250 to 12659. [2025-02-05 11:56:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.056565018170327) internal successors, (13374), 12658 states have internal predecessors, (13374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13374 transitions. [2025-02-05 11:56:32,365 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13374 transitions. Word has length 614 [2025-02-05 11:56:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:32,365 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13374 transitions. [2025-02-05 11:56:32,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13374 transitions. [2025-02-05 11:56:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-02-05 11:56:32,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:32,370 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:32,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:56:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:32,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:32,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1232567689, now seen corresponding path program 1 times [2025-02-05 11:56:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626283810] [2025-02-05 11:56:32,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:32,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-02-05 11:56:32,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-02-05 11:56:32,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:32,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 11:56:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:32,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626283810] [2025-02-05 11:56:32,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626283810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:32,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172433846] [2025-02-05 11:56:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:32,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:32,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:32,907 INFO L87 Difference]: Start difference. First operand 12659 states and 13374 transitions. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:33,768 INFO L93 Difference]: Finished difference Result 28908 states and 30614 transitions. [2025-02-05 11:56:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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 646 [2025-02-05 11:56:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:33,783 INFO L225 Difference]: With dead ends: 28908 [2025-02-05 11:56:33,784 INFO L226 Difference]: Without dead ends: 16251 [2025-02-05 11:56:33,793 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-02-05 11:56:33,793 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 121 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:33,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 509 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:56:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16251 states. [2025-02-05 11:56:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16251 to 15952. [2025-02-05 11:56:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15952 states, 15951 states have (on average 1.049213215472384) internal successors, (16736), 15951 states have internal predecessors, (16736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15952 states to 15952 states and 16736 transitions. [2025-02-05 11:56:33,919 INFO L78 Accepts]: Start accepts. Automaton has 15952 states and 16736 transitions. Word has length 646 [2025-02-05 11:56:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:33,919 INFO L471 AbstractCegarLoop]: Abstraction has 15952 states and 16736 transitions. [2025-02-05 11:56:33,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 15952 states and 16736 transitions. [2025-02-05 11:56:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-02-05 11:56:33,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:33,927 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:56:33,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:56:33,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:33,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 577949682, now seen corresponding path program 1 times [2025-02-05 11:56:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:33,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204321778] [2025-02-05 11:56:33,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:33,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:33,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-02-05 11:56:33,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-02-05 11:56:33,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:33,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-02-05 11:56:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204321778] [2025-02-05 11:56:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204321778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369239161] [2025-02-05 11:56:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:34,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:34,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:34,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:34,305 INFO L87 Difference]: Start difference. First operand 15952 states and 16736 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:35,126 INFO L93 Difference]: Finished difference Result 34291 states and 36013 transitions. [2025-02-05 11:56:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 710 [2025-02-05 11:56:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:35,144 INFO L225 Difference]: With dead ends: 34291 [2025-02-05 11:56:35,144 INFO L226 Difference]: Without dead ends: 18341 [2025-02-05 11:56:35,155 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-02-05 11:56:35,155 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 151 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:35,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 467 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18341 states. [2025-02-05 11:56:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18341 to 15041. [2025-02-05 11:56:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15041 states, 15040 states have (on average 1.0496010638297872) internal successors, (15786), 15040 states have internal predecessors, (15786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15041 states to 15041 states and 15786 transitions. [2025-02-05 11:56:35,290 INFO L78 Accepts]: Start accepts. Automaton has 15041 states and 15786 transitions. Word has length 710 [2025-02-05 11:56:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:35,291 INFO L471 AbstractCegarLoop]: Abstraction has 15041 states and 15786 transitions. [2025-02-05 11:56:35,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15041 states and 15786 transitions. [2025-02-05 11:56:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-02-05 11:56:35,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:35,300 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-02-05 11:56:35,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:56:35,301 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:35,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1227509031, now seen corresponding path program 1 times [2025-02-05 11:56:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746364482] [2025-02-05 11:56:35,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:35,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-02-05 11:56:35,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-02-05 11:56:35,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:35,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-02-05 11:56:35,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:35,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746364482] [2025-02-05 11:56:35,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746364482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:35,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:35,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097703571] [2025-02-05 11:56:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:35,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:35,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:35,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:35,714 INFO L87 Difference]: Start difference. First operand 15041 states and 15786 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:36,508 INFO L93 Difference]: Finished difference Result 33667 states and 35330 transitions. [2025-02-05 11:56:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:36,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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 835 [2025-02-05 11:56:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:36,524 INFO L225 Difference]: With dead ends: 33667 [2025-02-05 11:56:36,524 INFO L226 Difference]: Without dead ends: 18927 [2025-02-05 11:56:36,542 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-02-05 11:56:36,543 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 313 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:36,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 522 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18927 states. [2025-02-05 11:56:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18927 to 17731. [2025-02-05 11:56:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17731 states, 17730 states have (on average 1.045910885504794) internal successors, (18544), 17730 states have internal predecessors, (18544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17731 states to 17731 states and 18544 transitions. [2025-02-05 11:56:36,679 INFO L78 Accepts]: Start accepts. Automaton has 17731 states and 18544 transitions. Word has length 835 [2025-02-05 11:56:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:36,679 INFO L471 AbstractCegarLoop]: Abstraction has 17731 states and 18544 transitions. [2025-02-05 11:56:36,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 17731 states and 18544 transitions. [2025-02-05 11:56:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2025-02-05 11:56:36,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:36,693 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:36,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:56:36,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -906150408, now seen corresponding path program 1 times [2025-02-05 11:56:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383026080] [2025-02-05 11:56:36,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:36,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 856 statements into 1 equivalence classes. [2025-02-05 11:56:36,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 856 of 856 statements. [2025-02-05 11:56:36,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:36,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-02-05 11:56:37,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383026080] [2025-02-05 11:56:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383026080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:37,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41788342] [2025-02-05 11:56:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:37,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:37,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:37,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:37,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:37,164 INFO L87 Difference]: Start difference. First operand 17731 states and 18544 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:38,107 INFO L93 Difference]: Finished difference Result 40262 states and 42158 transitions. [2025-02-05 11:56:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:38,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 856 [2025-02-05 11:56:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:38,129 INFO L225 Difference]: With dead ends: 40262 [2025-02-05 11:56:38,129 INFO L226 Difference]: Without dead ends: 22832 [2025-02-05 11:56:38,141 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-02-05 11:56:38,142 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 295 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:38,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 163 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:56:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22832 states. [2025-02-05 11:56:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22832 to 19231. [2025-02-05 11:56:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19231 states, 19230 states have (on average 1.0471138845553822) internal successors, (20136), 19230 states have internal predecessors, (20136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19231 states to 19231 states and 20136 transitions. [2025-02-05 11:56:38,305 INFO L78 Accepts]: Start accepts. Automaton has 19231 states and 20136 transitions. Word has length 856 [2025-02-05 11:56:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:38,305 INFO L471 AbstractCegarLoop]: Abstraction has 19231 states and 20136 transitions. [2025-02-05 11:56:38,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 19231 states and 20136 transitions. [2025-02-05 11:56:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2025-02-05 11:56:38,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:38,318 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:56:38,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:56:38,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:38,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash 903059069, now seen corresponding path program 1 times [2025-02-05 11:56:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:38,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820068269] [2025-02-05 11:56:38,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:38,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 926 statements into 1 equivalence classes. [2025-02-05 11:56:38,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 926 of 926 statements. [2025-02-05 11:56:38,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:38,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 1095 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-05 11:56:38,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820068269] [2025-02-05 11:56:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820068269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:38,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:38,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324408503] [2025-02-05 11:56:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:38,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:38,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:38,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:38,884 INFO L87 Difference]: Start difference. First operand 19231 states and 20136 transitions. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:39,685 INFO L93 Difference]: Finished difference Result 37858 states and 39651 transitions. [2025-02-05 11:56:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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 926 [2025-02-05 11:56:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:39,704 INFO L225 Difference]: With dead ends: 37858 [2025-02-05 11:56:39,704 INFO L226 Difference]: Without dead ends: 18928 [2025-02-05 11:56:39,716 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-02-05 11:56:39,716 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 79 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:39,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 507 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18928 states. [2025-02-05 11:56:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18928 to 18629. [2025-02-05 11:56:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18629 states, 18628 states have (on average 1.0316190680695727) internal successors, (19217), 18628 states have internal predecessors, (19217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18629 states to 18629 states and 19217 transitions. [2025-02-05 11:56:39,865 INFO L78 Accepts]: Start accepts. Automaton has 18629 states and 19217 transitions. Word has length 926 [2025-02-05 11:56:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:39,866 INFO L471 AbstractCegarLoop]: Abstraction has 18629 states and 19217 transitions. [2025-02-05 11:56:39,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18629 states and 19217 transitions. [2025-02-05 11:56:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2025-02-05 11:56:39,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:39,878 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:56:39,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:56:39,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:39,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1376378177, now seen corresponding path program 1 times [2025-02-05 11:56:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:39,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717717087] [2025-02-05 11:56:39,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:39,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 945 statements into 1 equivalence classes. [2025-02-05 11:56:39,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 945 of 945 statements. [2025-02-05 11:56:39,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:39,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2025-02-05 11:56:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717717087] [2025-02-05 11:56:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717717087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621897988] [2025-02-05 11:56:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:40,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:40,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:40,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:40,346 INFO L87 Difference]: Start difference. First operand 18629 states and 19217 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:41,052 INFO L93 Difference]: Finished difference Result 30635 states and 31526 transitions. [2025-02-05 11:56:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:41,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 945 [2025-02-05 11:56:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:41,053 INFO L225 Difference]: With dead ends: 30635 [2025-02-05 11:56:41,053 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:56:41,062 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-02-05 11:56:41,063 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 273 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:41,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 84 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:56:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:56:41,064 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-02-05 11:56:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:56:41,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 945 [2025-02-05 11:56:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:41,064 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:56:41,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:56:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:56:41,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:56:41,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:56:41,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:56:41,070 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:41,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:56:42,352 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:56:42,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:56:42 BoogieIcfgContainer [2025-02-05 11:56:42,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:56:42,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:56:42,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:56:42,375 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:56:42,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:03" (3/4) ... [2025-02-05 11:56:42,380 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:56:42,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 11:56:42,411 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:56:42,413 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:56:42,414 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:56:42,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:56:42,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:56:42,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:56:42,570 INFO L158 Benchmark]: Toolchain (without parser) took 42595.50ms. Allocated memory was 201.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 150.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 378.5MB. Max. memory is 16.1GB. [2025-02-05 11:56:42,570 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:56:42,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 831.66ms. Allocated memory is still 201.3MB. Free memory was 150.1MB in the beginning and 77.5MB in the end (delta: 72.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-05 11:56:42,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 200.20ms. Allocated memory is still 201.3MB. Free memory was 77.5MB in the beginning and 125.6MB in the end (delta: -48.1MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-02-05 11:56:42,571 INFO L158 Benchmark]: Boogie Preprocessor took 199.53ms. Allocated memory is still 201.3MB. Free memory was 125.6MB in the beginning and 70.0MB in the end (delta: 55.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-05 11:56:42,571 INFO L158 Benchmark]: IcfgBuilder took 1954.22ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 70.0MB in the beginning and 172.7MB in the end (delta: -102.6MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-02-05 11:56:42,572 INFO L158 Benchmark]: TraceAbstraction took 39209.58ms. Allocated memory was 302.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 172.7MB in the beginning and 1.0GB in the end (delta: -856.7MB). Peak memory consumption was 657.1MB. Max. memory is 16.1GB. [2025-02-05 11:56:42,572 INFO L158 Benchmark]: Witness Printer took 194.40ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.4GB in the end (delta: -326.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:56:42,574 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.18ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 831.66ms. Allocated memory is still 201.3MB. Free memory was 150.1MB in the beginning and 77.5MB in the end (delta: 72.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 200.20ms. Allocated memory is still 201.3MB. Free memory was 77.5MB in the beginning and 125.6MB in the end (delta: -48.1MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 199.53ms. Allocated memory is still 201.3MB. Free memory was 125.6MB in the beginning and 70.0MB in the end (delta: 55.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1954.22ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 70.0MB in the beginning and 172.7MB in the end (delta: -102.6MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * TraceAbstraction took 39209.58ms. Allocated memory was 302.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 172.7MB in the beginning and 1.0GB in the end (delta: -856.7MB). Peak memory consumption was 657.1MB. Max. memory is 16.1GB. * Witness Printer took 194.40ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.4GB in the end (delta: -326.1MB). Peak memory consumption was 25.2MB. 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: 167]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.9s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7361 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7361 mSDsluCounter, 7995 SdHoareTripleChecker+Invalid, 20.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 773 mSDsCounter, 3674 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21390 IncrementalHoareTripleChecker+Invalid, 25064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3674 mSolverCounterUnsat, 7222 mSDtfsCounter, 21390 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2436 GetRequests, 2398 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19231occurred in iteration=17, 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.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 14712 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 11940 NumberOfCodeBlocks, 11940 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 12531 ConstructedInterpolants, 0 QuantifiedInterpolants, 30126 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2190 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 14913/15108 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: 1776]: Location Invariant Derived location invariant: (((((((((((((((((((((((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (3 == a2)) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (a2 == 4))) || (((2 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || ((((long long) a0 + 99) <= 0) && (a2 == 4))) || ((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (a29 <= 42))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0))) || ((((long long) 98 + a0) <= 0) && (3 == a2))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || (((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((44 <= a29) && (((long long) a0 + 99) <= 0)) && (5 <= a2))) || ((a2 == 1) && (((long long) a29 + 144) <= 0))) || ((((0 <= ((long long) a4 + 85)) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 61) <= 0)) && (5 != a2))) || (((((long long) 98 + a0) <= 0) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || (((44 <= a29) && (((long long) a0 + 99) <= 0)) && (a2 == 1))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (a29 <= 42)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (a29 <= 36))) || ((((44 <= a29) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || ((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:56:42,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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