./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_label01.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 25a329399ac3f0c42bfd0b3752cc2a04cb2662736babf7dc26be2e3a4966221c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:38:31,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:38:31,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:38:31,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:38:31,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:38:31,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:38:31,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:38:31,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:38:31,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:38:31,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:38:31,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:38:31,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:38:31,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:38:31,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:38:31,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:38:31,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:38:31,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:38:31,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:38:31,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:38:31,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:38:31,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:38:31,745 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 -> 25a329399ac3f0c42bfd0b3752cc2a04cb2662736babf7dc26be2e3a4966221c [2025-01-08 23:38:32,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:38:32,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:38:32,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:38:32,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:38:32,012 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:38:32,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label01.c [2025-01-08 23:38:33,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d16b5df5b/ceb70c6e25c24921b5a00c77a9ad1963/FLAG4289c33eb [2025-01-08 23:38:33,555 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:38:33,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c [2025-01-08 23:38:33,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d16b5df5b/ceb70c6e25c24921b5a00c77a9ad1963/FLAG4289c33eb [2025-01-08 23:38:33,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d16b5df5b/ceb70c6e25c24921b5a00c77a9ad1963 [2025-01-08 23:38:33,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:38:33,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:38:33,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:38:33,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:38:33,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:38:33,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:38:33" (1/1) ... [2025-01-08 23:38:33,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fc561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:33, skipping insertion in model container [2025-01-08 23:38:33,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:38:33" (1/1) ... [2025-01-08 23:38:33,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:38:33,948 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_label01.c[6098,6111] [2025-01-08 23:38:34,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:38:34,041 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:38:34,069 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_label01.c[6098,6111] [2025-01-08 23:38:34,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:38:34,121 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:38:34,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34 WrapperNode [2025-01-08 23:38:34,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:38:34,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:38:34,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:38:34,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:38:34,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,192 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-01-08 23:38:34,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:38:34,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:38:34,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:38:34,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:38:34,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,229 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-01-08 23:38:34,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:38:34,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:38:34,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:38:34,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:38:34,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (1/1) ... [2025-01-08 23:38:34,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:38:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:38:34,288 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-01-08 23:38:34,292 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-01-08 23:38:34,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:38:34,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:38:34,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:38:34,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:38:34,348 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:38:34,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:38:35,164 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 23:38:35,164 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:38:35,177 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:38:35,177 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:38:35,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:38:35 BoogieIcfgContainer [2025-01-08 23:38:35,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:38:35,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:38:35,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:38:35,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:38:35,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:38:33" (1/3) ... [2025-01-08 23:38:35,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:38:35, skipping insertion in model container [2025-01-08 23:38:35,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:38:34" (2/3) ... [2025-01-08 23:38:35,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:38:35, skipping insertion in model container [2025-01-08 23:38:35,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:38:35" (3/3) ... [2025-01-08 23:38:35,187 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label01.c [2025-01-08 23:38:35,197 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:38:35,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label01.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:38:35,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:38:35,258 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;@6b4f756c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:38:35,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:38:35,262 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-01-08 23:38:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 23:38:35,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:38:35,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:38:35,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:38:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:38:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1210903428, now seen corresponding path program 1 times [2025-01-08 23:38:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:38:35,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692831013] [2025-01-08 23:38:35,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:38:35,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-08 23:38:35,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 23:38:35,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:35,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:38:35,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:38:35,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692831013] [2025-01-08 23:38:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692831013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:38:35,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:38:35,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:38:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752174906] [2025-01-08 23:38:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:38:35,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:38:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:38:35,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:38:35,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:38:35,509 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 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:38:36,075 INFO L93 Difference]: Finished difference Result 567 states and 978 transitions. [2025-01-08 23:38:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:38:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-01-08 23:38:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:38:36,083 INFO L225 Difference]: With dead ends: 567 [2025-01-08 23:38:36,083 INFO L226 Difference]: Without dead ends: 282 [2025-01-08 23:38:36,085 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-01-08 23:38:36,087 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:38:36,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:38:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-08 23:38:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-08 23:38:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2025-01-08 23:38:36,119 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 53 [2025-01-08 23:38:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:38:36,120 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2025-01-08 23:38:36,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2025-01-08 23:38:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-08 23:38:36,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:38:36,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:38:36,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:38:36,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:38:36,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:38:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash -816637535, now seen corresponding path program 1 times [2025-01-08 23:38:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:38:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444974144] [2025-01-08 23:38:36,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:38:36,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-08 23:38:36,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-08 23:38:36,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:36,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:38:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:38:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444974144] [2025-01-08 23:38:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444974144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:38:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:38:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:38:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878785922] [2025-01-08 23:38:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:38:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:38:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:38:36,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:38:36,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:38:36,375 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:38:36,746 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2025-01-08 23:38:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:38:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-01-08 23:38:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:38:36,751 INFO L225 Difference]: With dead ends: 840 [2025-01-08 23:38:36,751 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:38:36,753 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-01-08 23:38:36,753 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:38:36,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 66 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:38:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:38:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:38:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3076923076923077) internal successors, (731), 559 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 731 transitions. [2025-01-08 23:38:36,773 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 731 transitions. Word has length 123 [2025-01-08 23:38:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:38:36,774 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 731 transitions. [2025-01-08 23:38:36,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 731 transitions. [2025-01-08 23:38:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-08 23:38:36,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:38:36,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:38:36,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:38:36,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:38:36,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:38:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1973684144, now seen corresponding path program 1 times [2025-01-08 23:38:36,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:38:36,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782542818] [2025-01-08 23:38:36,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:36,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:38:36,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 23:38:36,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 23:38:36,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:36,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:38:37,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:38:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782542818] [2025-01-08 23:38:37,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782542818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:38:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152901812] [2025-01-08 23:38:37,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:38:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:38:37,064 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-01-08 23:38:37,068 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-01-08 23:38:37,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 23:38:37,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 23:38:37,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:37,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:37,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:38:37,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:38:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:38:37,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:38:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152901812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:38:37,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:38:37,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:38:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466858129] [2025-01-08 23:38:37,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:38:37,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:38:37,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:38:37,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:38:37,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:38:37,203 INFO L87 Difference]: Start difference. First operand 560 states and 731 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:38:37,561 INFO L93 Difference]: Finished difference Result 1118 states and 1460 transitions. [2025-01-08 23:38:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:38:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-08 23:38:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:38:37,564 INFO L225 Difference]: With dead ends: 1118 [2025-01-08 23:38:37,564 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:38:37,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:38:37,565 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:38:37,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 170 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:38:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:38:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:38:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2701252236135958) internal successors, (710), 559 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 710 transitions. [2025-01-08 23:38:37,582 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 710 transitions. Word has length 128 [2025-01-08 23:38:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:38:37,582 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 710 transitions. [2025-01-08 23:38:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 710 transitions. [2025-01-08 23:38:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-08 23:38:37,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:38:37,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-08 23:38:37,592 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-01-08 23:38:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:38:37,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:38:37,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:38:37,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1066664062, now seen corresponding path program 1 times [2025-01-08 23:38:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:38:37,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109977766] [2025-01-08 23:38:37,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:38:37,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-08 23:38:37,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-08 23:38:37,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:37,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:38:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:38:37,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109977766] [2025-01-08 23:38:37,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109977766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:38:37,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:38:37,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:38:37,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500396207] [2025-01-08 23:38:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:38:37,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:38:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:38:37,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:38:37,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:38:37,908 INFO L87 Difference]: Start difference. First operand 560 states and 710 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:38:38,288 INFO L93 Difference]: Finished difference Result 1674 states and 2125 transitions. [2025-01-08 23:38:38,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:38:38,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-01-08 23:38:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:38:38,291 INFO L225 Difference]: With dead ends: 1674 [2025-01-08 23:38:38,292 INFO L226 Difference]: Without dead ends: 1116 [2025-01-08 23:38:38,292 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-01-08 23:38:38,293 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:38:38,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 34 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:38:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-01-08 23:38:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-01-08 23:38:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2260089686098654) internal successors, (1367), 1115 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1367 transitions. [2025-01-08 23:38:38,314 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1367 transitions. Word has length 149 [2025-01-08 23:38:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:38:38,314 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1367 transitions. [2025-01-08 23:38:38,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1367 transitions. [2025-01-08 23:38:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-08 23:38:38,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:38:38,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-08 23:38:38,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:38:38,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:38:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:38:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1960355025, now seen corresponding path program 1 times [2025-01-08 23:38:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:38:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562923395] [2025-01-08 23:38:38,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:38:38,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-08 23:38:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-08 23:38:38,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:38,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:38:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:38:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562923395] [2025-01-08 23:38:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562923395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:38:38,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:38:38,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:38:38,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736650314] [2025-01-08 23:38:38,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:38:38,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:38:38,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:38:38,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:38:38,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:38:38,592 INFO L87 Difference]: Start difference. First operand 1116 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:38:39,024 INFO L93 Difference]: Finished difference Result 2369 states and 2881 transitions. [2025-01-08 23:38:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:38:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-01-08 23:38:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:38:39,028 INFO L225 Difference]: With dead ends: 2369 [2025-01-08 23:38:39,029 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:38:39,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:38:39,030 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:38:39,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:38:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:38:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-01-08 23:38:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.2049441786283892) internal successors, (1511), 1254 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1511 transitions. [2025-01-08 23:38:39,048 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1511 transitions. Word has length 166 [2025-01-08 23:38:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:38:39,049 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1511 transitions. [2025-01-08 23:38:39,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1511 transitions. [2025-01-08 23:38:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-08 23:38:39,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:38:39,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:38:39,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:38:39,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:38:39,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:38:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1891846647, now seen corresponding path program 1 times [2025-01-08 23:38:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:38:39,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879827077] [2025-01-08 23:38:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:38:39,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-08 23:38:39,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-08 23:38:39,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:39,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 23:38:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:38:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879827077] [2025-01-08 23:38:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879827077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:38:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573390968] [2025-01-08 23:38:39,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:39,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:38:39,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:38:39,332 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-01-08 23:38:39,336 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-01-08 23:38:39,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-08 23:38:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-08 23:38:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:39,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:39,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:38:39,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:38:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 23:38:39,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:38:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573390968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:38:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:38:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:38:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572684948] [2025-01-08 23:38:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:38:39,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:38:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:38:39,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:38:39,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:38:39,689 INFO L87 Difference]: Start difference. First operand 1255 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:38:40,115 INFO L93 Difference]: Finished difference Result 1674 states and 2020 transitions. [2025-01-08 23:38:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:38:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 183 [2025-01-08 23:38:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:38:40,119 INFO L225 Difference]: With dead ends: 1674 [2025-01-08 23:38:40,120 INFO L226 Difference]: Without dead ends: 1672 [2025-01-08 23:38:40,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:38:40,120 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:38:40,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 21 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:38:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-01-08 23:38:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1255. [2025-01-08 23:38:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.20414673046252) internal successors, (1510), 1254 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1510 transitions. [2025-01-08 23:38:40,145 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1510 transitions. Word has length 183 [2025-01-08 23:38:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:38:40,145 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1510 transitions. [2025-01-08 23:38:40,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1510 transitions. [2025-01-08 23:38:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-08 23:38:40,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:38:40,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:38:40,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:38:40,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:38:40,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:38:40,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:38:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash -875817549, now seen corresponding path program 1 times [2025-01-08 23:38:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:38:40,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386388918] [2025-01-08 23:38:40,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:38:40,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:38:40,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 23:38:40,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 23:38:40,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:38:40,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:38:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:38:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:38:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386388918] [2025-01-08 23:38:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386388918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:38:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:38:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:38:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339307009] [2025-01-08 23:38:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:38:40,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:38:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:38:40,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:38:40,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:38:40,675 INFO L87 Difference]: Start difference. First operand 1255 states and 1510 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:38:41,243 INFO L93 Difference]: Finished difference Result 2290 states and 2785 transitions. [2025-01-08 23:38:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:38:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 227 [2025-01-08 23:38:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:38:41,244 INFO L225 Difference]: With dead ends: 2290 [2025-01-08 23:38:41,244 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:38:41,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:38:41,246 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 119 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:38:41,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 42 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:38:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:38:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:38:41,247 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-01-08 23:38:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:38:41,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2025-01-08 23:38:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:38:41,247 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:38:41,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:38:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:38:41,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:38:41,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:38:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:38:41,252 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:38:41,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:38:41,328 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:38:41,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:38:41 BoogieIcfgContainer [2025-01-08 23:38:41,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:38:41,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:38:41,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:38:41,338 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:38:41,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:38:35" (3/4) ... [2025-01-08 23:38:41,340 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:38:41,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:38:41,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:38:41,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:38:41,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:38:41,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:38:41,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:38:41,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:38:41,446 INFO L158 Benchmark]: Toolchain (without parser) took 7671.18ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 109.0MB in the beginning and 155.0MB in the end (delta: -45.9MB). Peak memory consumption was 180.3MB. Max. memory is 16.1GB. [2025-01-08 23:38:41,446 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:38:41,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.59ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 81.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:38:41,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.78ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 74.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:38:41,447 INFO L158 Benchmark]: Boogie Preprocessor took 60.22ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 65.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:38:41,447 INFO L158 Benchmark]: RCFGBuilder took 922.25ms. Allocated memory is still 142.6MB. Free memory was 65.0MB in the beginning and 98.7MB in the end (delta: -33.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2025-01-08 23:38:41,447 INFO L158 Benchmark]: TraceAbstraction took 6155.88ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 97.8MB in the beginning and 166.4MB in the end (delta: -68.6MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2025-01-08 23:38:41,447 INFO L158 Benchmark]: Witness Printer took 107.55ms. Allocated memory is still 369.1MB. Free memory was 166.4MB in the beginning and 155.0MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:38:41,448 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.22ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.59ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 81.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.78ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 74.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.22ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 65.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 922.25ms. Allocated memory is still 142.6MB. Free memory was 65.0MB in the beginning and 98.7MB in the end (delta: -33.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6155.88ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 97.8MB in the beginning and 166.4MB in the end (delta: -68.6MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. * Witness Printer took 107.55ms. Allocated memory is still 369.1MB. Free memory was 166.4MB in the beginning and 155.0MB in the end (delta: 11.5MB). 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: 173]: 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: 6.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 659 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 659 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3607 IncrementalHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 395 mSolverCounterUnsat, 424 mSDtfsCounter, 3607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 417 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1331 ConstructedInterpolants, 0 QuantifiedInterpolants, 7090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 469 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 457/516 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]: Loop Invariant Derived loop invariant: (((((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (a19 == 8)) || (((14 == a4) && (a12 == 0)) && (1 <= a10))) || (((a1 <= 23) && (14 == a4)) && (a12 == 0))) || (((14 == a4) && (a12 == 0)) && (9 <= a19))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:38:41,460 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