./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label39.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/Problem10_label39.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 09088bf7df05fb0aeb7e867d28b9bd6e460902ff256d0b616aa1b0e915b11fad --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:30:25,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:30:25,769 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:30:25,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:30:25,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:30:25,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:30:25,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:30:25,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:30:25,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:30:25,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:30:25,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:30:25,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:30:25,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:30:25,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:30:25,792 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:30:25,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:30:25,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:30:25,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:30:25,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:25,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:30:25,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:30:25,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:30:25,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:30:25,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:30:25,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:30:25,795 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 -> 09088bf7df05fb0aeb7e867d28b9bd6e460902ff256d0b616aa1b0e915b11fad [2025-02-05 11:30:25,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:30:25,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:30:25,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:30:25,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:30:25,982 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:30:25,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label39.c [2025-02-05 11:30:27,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a70f5ba41/b660bbc6d3b346b28f3b397683151f7f/FLAG0b8b922e4 [2025-02-05 11:30:27,488 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:30:27,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label39.c [2025-02-05 11:30:27,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a70f5ba41/b660bbc6d3b346b28f3b397683151f7f/FLAG0b8b922e4 [2025-02-05 11:30:27,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a70f5ba41/b660bbc6d3b346b28f3b397683151f7f [2025-02-05 11:30:27,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:30:27,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:30:27,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:27,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:30:27,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:30:27,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:27" (1/1) ... [2025-02-05 11:30:27,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69df3533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:27, skipping insertion in model container [2025-02-05 11:30:27,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:27" (1/1) ... [2025-02-05 11:30:27,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:30:27,881 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/Problem10_label39.c[3149,3162] [2025-02-05 11:30:27,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:27,980 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:30:27,993 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/Problem10_label39.c[3149,3162] [2025-02-05 11:30:28,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:28,057 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:30:28,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28 WrapperNode [2025-02-05 11:30:28,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:28,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:28,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:30:28,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:30:28,063 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:30:28" (1/1) ... [2025-02-05 11:30:28,079 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:30:28" (1/1) ... [2025-02-05 11:30:28,111 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-02-05 11:30:28,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:28,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:30:28,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:30:28,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:30:28,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,165 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:30:28,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:30:28,211 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:30:28,211 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:30:28,211 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:30:28,212 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (1/1) ... [2025-02-05 11:30:28,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:28,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:30:28,240 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:30:28,243 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:30:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:30:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:30:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:30:28,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:30:28,320 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:30:28,322 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:30:29,100 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 11:30:29,100 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:30:29,110 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:30:29,110 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:30:29,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:29 BoogieIcfgContainer [2025-02-05 11:30:29,110 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:30:29,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:30:29,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:30:29,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:30:29,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:30:27" (1/3) ... [2025-02-05 11:30:29,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d2a05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:29, skipping insertion in model container [2025-02-05 11:30:29,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:28" (2/3) ... [2025-02-05 11:30:29,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d2a05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:29, skipping insertion in model container [2025-02-05 11:30:29,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:29" (3/3) ... [2025-02-05 11:30:29,117 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label39.c [2025-02-05 11:30:29,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:30:29,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label39.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:30:29,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:30:29,194 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;@11e42a72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:30:29,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:30:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:30:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 11:30:29,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:29,204 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] [2025-02-05 11:30:29,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash 314578752, now seen corresponding path program 1 times [2025-02-05 11:30:29,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:29,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987177106] [2025-02-05 11:30:29,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:29,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 11:30:29,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 11:30:29,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:29,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:29,455 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:30:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987177106] [2025-02-05 11:30:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987177106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:29,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204918044] [2025-02-05 11:30:29,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:29,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:29,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:29,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:29,477 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 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:30:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:30,010 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2025-02-05 11:30:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:30,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-02-05 11:30:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:30,018 INFO L225 Difference]: With dead ends: 552 [2025-02-05 11:30:30,019 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 11:30:30,021 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:30:30,023 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:30,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:30:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 11:30:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-02-05 11:30:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:30:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2025-02-05 11:30:30,059 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 26 [2025-02-05 11:30:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:30,060 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2025-02-05 11:30:30,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 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:30:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2025-02-05 11:30:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 11:30:30,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:30,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:30,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:30:30,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:30,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash 614712086, now seen corresponding path program 1 times [2025-02-05 11:30:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:30,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115138657] [2025-02-05 11:30:30,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:30,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 11:30:30,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 11:30:30,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:30,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115138657] [2025-02-05 11:30:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115138657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:30,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665056830] [2025-02-05 11:30:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:30,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:30,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:30,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:30,298 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:30,734 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2025-02-05 11:30:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 11:30:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:30,737 INFO L225 Difference]: With dead ends: 701 [2025-02-05 11:30:30,737 INFO L226 Difference]: Without dead ends: 421 [2025-02-05 11:30:30,738 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:30:30,738 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:30,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-05 11:30:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-02-05 11:30:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4190476190476191) internal successors, (596), 420 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2025-02-05 11:30:30,752 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 95 [2025-02-05 11:30:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:30,752 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2025-02-05 11:30:30,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2025-02-05 11:30:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 11:30:30,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:30,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:30:30,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:30,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash -144890681, now seen corresponding path program 1 times [2025-02-05 11:30:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:30,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6518047] [2025-02-05 11:30:30,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:30,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:30,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 11:30:30,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 11:30:30,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:30,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:30,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:30,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6518047] [2025-02-05 11:30:30,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6518047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:30,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:30,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577267101] [2025-02-05 11:30:30,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:30,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:30,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:30,861 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:30:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:31,264 INFO L93 Difference]: Finished difference Result 1257 states and 1783 transitions. [2025-02-05 11:30:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:31,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-02-05 11:30:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:31,267 INFO L225 Difference]: With dead ends: 1257 [2025-02-05 11:30:31,267 INFO L226 Difference]: Without dead ends: 838 [2025-02-05 11:30:31,268 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:30:31,268 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:31,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 205 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-02-05 11:30:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2025-02-05 11:30:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.32378223495702) internal successors, (924), 698 states have internal predecessors, (924), 0 states have call successors, (0), 0 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:30:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 924 transitions. [2025-02-05 11:30:31,286 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 924 transitions. Word has length 101 [2025-02-05 11:30:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:31,286 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 924 transitions. [2025-02-05 11:30:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:30:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 924 transitions. [2025-02-05 11:30:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 11:30:31,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:31,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:31,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:30:31,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:31,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash -919659064, now seen corresponding path program 1 times [2025-02-05 11:30:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:31,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886511576] [2025-02-05 11:30:31,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 11:30:31,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 11:30:31,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:31,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:31,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:31,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886511576] [2025-02-05 11:30:31,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886511576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:31,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819882514] [2025-02-05 11:30:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:31,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:31,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:31,381 INFO L87 Difference]: Start difference. First operand 699 states and 924 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:30:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:31,839 INFO L93 Difference]: Finished difference Result 1674 states and 2225 transitions. [2025-02-05 11:30:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:31,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-02-05 11:30:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:31,843 INFO L225 Difference]: With dead ends: 1674 [2025-02-05 11:30:31,843 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 11:30:31,844 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:30:31,845 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 61 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:31,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 70 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 11:30:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-02-05 11:30:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1967213114754098) internal successors, (1168), 976 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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:30:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1168 transitions. [2025-02-05 11:30:31,862 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1168 transitions. Word has length 112 [2025-02-05 11:30:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:31,862 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1168 transitions. [2025-02-05 11:30:31,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:30:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1168 transitions. [2025-02-05 11:30:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 11:30:31,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:31,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:31,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:30:31,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:31,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1111878104, now seen corresponding path program 1 times [2025-02-05 11:30:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840361447] [2025-02-05 11:30:31,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:31,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 11:30:31,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 11:30:31,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:32,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:32,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840361447] [2025-02-05 11:30:32,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840361447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:32,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:32,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771075600] [2025-02-05 11:30:32,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:32,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:32,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:32,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:32,048 INFO L87 Difference]: Start difference. First operand 977 states and 1168 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:30:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:32,435 INFO L93 Difference]: Finished difference Result 2091 states and 2483 transitions. [2025-02-05 11:30:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-05 11:30:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:32,441 INFO L225 Difference]: With dead ends: 2091 [2025-02-05 11:30:32,441 INFO L226 Difference]: Without dead ends: 1116 [2025-02-05 11:30:32,442 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:30:32,442 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:32,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 82 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-02-05 11:30:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-02-05 11:30:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1766816143497758) internal successors, (1312), 1115 states have internal predecessors, (1312), 0 states have call successors, (0), 0 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:30:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1312 transitions. [2025-02-05 11:30:32,458 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1312 transitions. Word has length 139 [2025-02-05 11:30:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:32,458 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1312 transitions. [2025-02-05 11:30:32,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:30:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1312 transitions. [2025-02-05 11:30:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 11:30:32,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:32,464 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:32,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:30:32,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:32,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:32,465 INFO L85 PathProgramCache]: Analyzing trace with hash 641832898, now seen corresponding path program 1 times [2025-02-05 11:30:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:32,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193807249] [2025-02-05 11:30:32,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:32,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 11:30:32,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 11:30:32,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:32,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193807249] [2025-02-05 11:30:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193807249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:32,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955945654] [2025-02-05 11:30:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:32,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:32,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:32,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:32,645 INFO L87 Difference]: Start difference. First operand 1116 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:33,088 INFO L93 Difference]: Finished difference Result 2369 states and 2857 transitions. [2025-02-05 11:30:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:33,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2025-02-05 11:30:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:33,093 INFO L225 Difference]: With dead ends: 2369 [2025-02-05 11:30:33,093 INFO L226 Difference]: Without dead ends: 1394 [2025-02-05 11:30:33,094 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:30:33,095 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:33,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-02-05 11:30:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2025-02-05 11:30:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 0 states have call successors, (0), 0 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:30:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2025-02-05 11:30:33,119 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 178 [2025-02-05 11:30:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:33,120 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2025-02-05 11:30:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2025-02-05 11:30:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 11:30:33,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:33,122 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:30:33,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:30:33,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:33,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash 989052267, now seen corresponding path program 1 times [2025-02-05 11:30:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290414795] [2025-02-05 11:30:33,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:33,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 11:30:33,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 11:30:33,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:33,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 11:30:33,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:33,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290414795] [2025-02-05 11:30:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290414795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:33,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:33,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713225107] [2025-02-05 11:30:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:33,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:33,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:33,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:33,329 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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:30:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:33,740 INFO L93 Difference]: Finished difference Result 3342 states and 3931 transitions. [2025-02-05 11:30:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 200 [2025-02-05 11:30:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:33,746 INFO L225 Difference]: With dead ends: 3342 [2025-02-05 11:30:33,746 INFO L226 Difference]: Without dead ends: 2228 [2025-02-05 11:30:33,748 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:30:33,748 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:33,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 196 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-02-05 11:30:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1672. [2025-02-05 11:30:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.1717534410532615) internal successors, (1958), 1671 states have internal predecessors, (1958), 0 states have call successors, (0), 0 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:30:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2025-02-05 11:30:33,773 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 200 [2025-02-05 11:30:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:33,773 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2025-02-05 11:30:33,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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:30:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2025-02-05 11:30:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 11:30:33,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:33,775 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:33,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:30:33,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:33,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash 810285953, now seen corresponding path program 1 times [2025-02-05 11:30:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327943310] [2025-02-05 11:30:33,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:33,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 11:30:33,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 11:30:33,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:33,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327943310] [2025-02-05 11:30:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327943310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:30:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711360825] [2025-02-05 11:30:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 11:30:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:34,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 11:30:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:30:34,151 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:30:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:35,081 INFO L93 Difference]: Finished difference Result 3258 states and 3825 transitions. [2025-02-05 11:30:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 11:30:35,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2025-02-05 11:30:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:35,085 INFO L225 Difference]: With dead ends: 3258 [2025-02-05 11:30:35,085 INFO L226 Difference]: Without dead ends: 1672 [2025-02-05 11:30:35,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:30:35,087 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:35,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:30:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-02-05 11:30:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2025-02-05 11:30:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.1675643327348892) internal successors, (1951), 1671 states have internal predecessors, (1951), 0 states have call successors, (0), 0 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:30:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1951 transitions. [2025-02-05 11:30:35,108 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1951 transitions. Word has length 214 [2025-02-05 11:30:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:35,109 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1951 transitions. [2025-02-05 11:30:35,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:30:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1951 transitions. [2025-02-05 11:30:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-05 11:30:35,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:35,111 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:30:35,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:30:35,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:35,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1915380197, now seen corresponding path program 1 times [2025-02-05 11:30:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:35,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30103559] [2025-02-05 11:30:35,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:35,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-05 11:30:35,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-05 11:30:35,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:35,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 74 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30103559] [2025-02-05 11:30:35,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30103559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:30:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408837017] [2025-02-05 11:30:35,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:30:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:30:35,930 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:30:35,931 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:30:35,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-05 11:30:36,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-05 11:30:36,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:36,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:36,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:30:36,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:30:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:36,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:30:36,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408837017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:36,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:30:36,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:30:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577799333] [2025-02-05 11:30:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:36,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:30:36,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:36,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:30:36,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:30:36,450 INFO L87 Difference]: Start difference. First operand 1672 states and 1951 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:30:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:37,075 INFO L93 Difference]: Finished difference Result 4732 states and 5558 transitions. [2025-02-05 11:30:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:30:37,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-02-05 11:30:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:37,083 INFO L225 Difference]: With dead ends: 4732 [2025-02-05 11:30:37,083 INFO L226 Difference]: Without dead ends: 3201 [2025-02-05 11:30:37,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:30:37,086 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:37,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 53 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:30:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-02-05 11:30:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 2506. [2025-02-05 11:30:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1528942115768464) internal successors, (2888), 2505 states have internal predecessors, (2888), 0 states have call successors, (0), 0 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:30:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2888 transitions. [2025-02-05 11:30:37,123 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2888 transitions. Word has length 250 [2025-02-05 11:30:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:37,124 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2888 transitions. [2025-02-05 11:30:37,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:30:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2888 transitions. [2025-02-05 11:30:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-05 11:30:37,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:37,127 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:37,137 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:30:37,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:30:37,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:37,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1697774625, now seen corresponding path program 1 times [2025-02-05 11:30:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:37,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753617877] [2025-02-05 11:30:37,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:37,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 11:30:37,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 11:30:37,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:37,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 11:30:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:37,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753617877] [2025-02-05 11:30:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753617877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:30:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601275754] [2025-02-05 11:30:37,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:30:37,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:30:37,600 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:30:37,605 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:30:37,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-05 11:30:37,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-05 11:30:37,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:37,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:37,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:30:37,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:30:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 11:30:37,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:30:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601275754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:37,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:30:37,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:30:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312288659] [2025-02-05 11:30:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:37,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:37,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:37,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:37,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:30:37,760 INFO L87 Difference]: Start difference. First operand 2506 states and 2888 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:38,166 INFO L93 Difference]: Finished difference Result 5427 states and 6355 transitions. [2025-02-05 11:30:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-02-05 11:30:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:38,185 INFO L225 Difference]: With dead ends: 5427 [2025-02-05 11:30:38,185 INFO L226 Difference]: Without dead ends: 3062 [2025-02-05 11:30:38,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:30:38,188 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:38,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-02-05 11:30:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2645. [2025-02-05 11:30:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1376701966717095) internal successors, (3008), 2644 states have internal predecessors, (3008), 0 states have call successors, (0), 0 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:30:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3008 transitions. [2025-02-05 11:30:38,267 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3008 transitions. Word has length 274 [2025-02-05 11:30:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:38,268 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3008 transitions. [2025-02-05 11:30:38,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3008 transitions. [2025-02-05 11:30:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 11:30:38,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:38,276 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:38,285 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:30:38,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:30:38,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:38,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2111459559, now seen corresponding path program 1 times [2025-02-05 11:30:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:38,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314872696] [2025-02-05 11:30:38,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:38,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 11:30:38,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 11:30:38,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:38,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-02-05 11:30:38,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314872696] [2025-02-05 11:30:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314872696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:38,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730511818] [2025-02-05 11:30:38,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:38,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:38,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:38,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:38,704 INFO L87 Difference]: Start difference. First operand 2645 states and 3008 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:30:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:39,133 INFO L93 Difference]: Finished difference Result 5286 states and 6024 transitions. [2025-02-05 11:30:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:39,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 340 [2025-02-05 11:30:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:39,134 INFO L225 Difference]: With dead ends: 5286 [2025-02-05 11:30:39,134 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:30:39,137 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:30:39,139 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 116 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:39,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 222 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:30:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:30:39,140 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:30:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:30:39,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 340 [2025-02-05 11:30:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:39,141 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:30:39,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:30:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:30:39,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:30:39,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:30:39,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:30:39,145 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:39,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:30:39,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:30:39,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:30:39 BoogieIcfgContainer [2025-02-05 11:30:39,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:30:39,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:30:39,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:30:39,374 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:30:39,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:30:29" (3/4) ... [2025-02-05 11:30:39,378 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:30:39,394 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:30:39,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:30:39,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:30:39,396 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:30:39,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:30:39,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:30:39,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:30:39,487 INFO L158 Benchmark]: Toolchain (without parser) took 11733.60ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 122.4MB in the beginning and 182.6MB in the end (delta: -60.2MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. [2025-02-05 11:30:39,487 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:30:39,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.63ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 95.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 11:30:39,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.29ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 88.2MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:39,488 INFO L158 Benchmark]: Boogie Preprocessor took 98.39ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 79.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:39,489 INFO L158 Benchmark]: IcfgBuilder took 899.86ms. Allocated memory is still 167.8MB. Free memory was 79.8MB in the beginning and 72.1MB in the end (delta: 7.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2025-02-05 11:30:39,489 INFO L158 Benchmark]: TraceAbstraction took 10261.66ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 72.1MB in the beginning and 194.6MB in the end (delta: -122.5MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2025-02-05 11:30:39,489 INFO L158 Benchmark]: Witness Printer took 112.05ms. Allocated memory is still 402.7MB. Free memory was 194.6MB in the beginning and 182.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:39,490 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.63ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 95.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.29ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 88.2MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.39ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 79.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 899.86ms. Allocated memory is still 167.8MB. Free memory was 79.8MB in the beginning and 72.1MB in the end (delta: 7.8MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10261.66ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 72.1MB in the beginning and 194.6MB in the end (delta: -122.5MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Witness Printer took 112.05ms. Allocated memory is still 402.7MB. Free memory was 194.6MB in the beginning and 182.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 92]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1107 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1107 mSDsluCounter, 1408 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 658 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4967 IncrementalHoareTripleChecker+Invalid, 5625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 658 mSolverCounterUnsat, 1338 mSDtfsCounter, 4967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2645occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1946 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2453 NumberOfCodeBlocks, 2453 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2440 ConstructedInterpolants, 0 QuantifiedInterpolants, 10557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1308/1407 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: 592]: Location Invariant Derived location invariant: ((((((((((a10 <= 0) && (14 == a4)) && (a12 == 0)) && (9 <= a19)) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (23 <= a1))) || (((a19 == 9) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((14 == a4) && (a12 == 0)) && (a19 == 6))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:30:39,505 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