./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i -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 a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:08:53,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:08:53,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:08:53,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:08:53,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:08:53,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:08:53,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:08:53,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:08:53,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:08:53,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:08:53,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:08:53,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:08:53,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:08:53,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:08:53,145 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:08:53,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:08:53,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:08:53,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:08:53,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:08:53,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:08:53,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:08:53,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:08:53,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:08:53,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:08:53,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:08:53,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:53,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:08:53,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:08:53,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:08:53,148 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 -> a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725 [2025-02-06 01:08:53,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:08:53,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:08:53,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:08:53,409 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:08:53,409 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:08:53,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i [2025-02-06 01:08:54,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aebcb25f/a6de048be7d74d0e87dbfad7eef7615c/FLAGc260a2f55 [2025-02-06 01:08:54,821 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:08:54,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i [2025-02-06 01:08:54,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aebcb25f/a6de048be7d74d0e87dbfad7eef7615c/FLAGc260a2f55 [2025-02-06 01:08:55,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aebcb25f/a6de048be7d74d0e87dbfad7eef7615c [2025-02-06 01:08:55,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:08:55,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:08:55,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:55,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:08:55,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:08:55,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39aa3f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55, skipping insertion in model container [2025-02-06 01:08:55,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:08:55,242 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928] [2025-02-06 01:08:55,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:55,281 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:08:55,290 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928] [2025-02-06 01:08:55,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:08:55,327 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:08:55,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55 WrapperNode [2025-02-06 01:08:55,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:08:55,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:55,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:08:55,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:08:55,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,373 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-02-06 01:08:55,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:08:55,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:08:55,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:08:55,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:08:55,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:08:55,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:08:55,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:08:55,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:08:55,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:08:55,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (1/1) ... [2025-02-06 01:08:55,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:08:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:55,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:08:55,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:08:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:08:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:08:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:08:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:08:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:08:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:08:55,500 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:08:55,501 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:08:55,700 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-06 01:08:55,700 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:08:55,707 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:08:55,708 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:08:55,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:55 BoogieIcfgContainer [2025-02-06 01:08:55,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:08:55,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:08:55,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:08:55,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:08:55,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:08:55" (1/3) ... [2025-02-06 01:08:55,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ff04ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:55, skipping insertion in model container [2025-02-06 01:08:55,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:08:55" (2/3) ... [2025-02-06 01:08:55,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ff04ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:08:55, skipping insertion in model container [2025-02-06 01:08:55,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:55" (3/3) ... [2025-02-06 01:08:55,716 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i [2025-02-06 01:08:55,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:08:55,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:08:55,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:08:55,766 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;@6e64583e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:08:55,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:08:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 01:08:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 01:08:55,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:55,774 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:08:55,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:55,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1307823667, now seen corresponding path program 1 times [2025-02-06 01:08:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604415901] [2025-02-06 01:08:55,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:55,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 01:08:55,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 01:08:55,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:55,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 01:08:55,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:55,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604415901] [2025-02-06 01:08:55,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604415901] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:08:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706661627] [2025-02-06 01:08:55,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:55,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:55,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:08:55,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:08:55,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 01:08:56,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 01:08:56,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:56,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:56,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:08:56,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:08:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 01:08:56,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:08:56,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706661627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:56,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:08:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:08:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127679234] [2025-02-06 01:08:56,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:56,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:08:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:56,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:08:56,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:08:56,047 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 01:08:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:56,058 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2025-02-06 01:08:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:08:56,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-02-06 01:08:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:56,063 INFO L225 Difference]: With dead ends: 77 [2025-02-06 01:08:56,064 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 01:08:56,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:08:56,070 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:56,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:08:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 01:08:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 01:08:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 01:08:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-02-06 01:08:56,095 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2025-02-06 01:08:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:56,095 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-02-06 01:08:56,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 01:08:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-02-06 01:08:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 01:08:56,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:56,097 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:08:56,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:08:56,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:08:56,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2118536880, now seen corresponding path program 1 times [2025-02-06 01:08:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127717470] [2025-02-06 01:08:56,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:56,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 01:08:56,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 01:08:56,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:56,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 01:08:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:56,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127717470] [2025-02-06 01:08:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127717470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:56,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:08:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240799977] [2025-02-06 01:08:56,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:08:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:56,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:08:56,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:08:56,488 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:08:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:56,505 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2025-02-06 01:08:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:08:56,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-02-06 01:08:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:56,507 INFO L225 Difference]: With dead ends: 71 [2025-02-06 01:08:56,508 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 01:08:56,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:08:56,508 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:56,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:08:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 01:08:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 01:08:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 01:08:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-02-06 01:08:56,517 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 64 [2025-02-06 01:08:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:56,518 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-02-06 01:08:56,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:08:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-02-06 01:08:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 01:08:56,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:56,521 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:08:56,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:08:56,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2147166031, now seen corresponding path program 1 times [2025-02-06 01:08:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:56,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016405855] [2025-02-06 01:08:56,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:56,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 01:08:56,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 01:08:56,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:56,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 01:08:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016405855] [2025-02-06 01:08:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016405855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:57,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:57,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:08:57,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536061800] [2025-02-06 01:08:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:57,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:08:57,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:57,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:08:57,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:08:57,839 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:08:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:58,017 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2025-02-06 01:08:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:08:58,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-02-06 01:08:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:58,019 INFO L225 Difference]: With dead ends: 84 [2025-02-06 01:08:58,019 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 01:08:58,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:08:58,020 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 58 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:58,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 289 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:08:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 01:08:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2025-02-06 01:08:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:08:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-02-06 01:08:58,039 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 64 [2025-02-06 01:08:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:58,040 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-02-06 01:08:58,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:08:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-02-06 01:08:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 01:08:58,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:58,042 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:08:58,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:08:58,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:58,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2126792041, now seen corresponding path program 1 times [2025-02-06 01:08:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:58,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058204797] [2025-02-06 01:08:58,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:58,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:08:58,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:08:58,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:58,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:08:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 01:08:58,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:08:58,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058204797] [2025-02-06 01:08:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058204797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:08:58,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:08:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:08:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301864699] [2025-02-06 01:08:58,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:08:58,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:08:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:08:58,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:08:58,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:08:58,624 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:08:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:08:58,865 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2025-02-06 01:08:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:08:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2025-02-06 01:08:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:08:58,866 INFO L225 Difference]: With dead ends: 88 [2025-02-06 01:08:58,868 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 01:08:58,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:08:58,869 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 61 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:08:58,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 303 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:08:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 01:08:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2025-02-06 01:08:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:08:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2025-02-06 01:08:58,880 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 65 [2025-02-06 01:08:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:08:58,880 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2025-02-06 01:08:58,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:08:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2025-02-06 01:08:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 01:08:58,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:08:58,881 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:08:58,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:08:58,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:08:58,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:08:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash -312286956, now seen corresponding path program 1 times [2025-02-06 01:08:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:08:58,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859959468] [2025-02-06 01:08:58,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:08:58,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:08:58,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:08:58,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:58,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:08:58,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010552287] [2025-02-06 01:08:58,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:08:58,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:58,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:08:58,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:08:58,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:08:58,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:08:58,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:08:58,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:58,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:08:58,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:08:59,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:08:59,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:08:59,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:08:59,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:08:59,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:08:59,046 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:08:59,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:08:59,054 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-02-06 01:08:59,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:08:59,251 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 01:08:59,281 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:08:59,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:08:59 BoogieIcfgContainer [2025-02-06 01:08:59,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:08:59,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:08:59,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:08:59,285 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:08:59,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:08:55" (3/4) ... [2025-02-06 01:08:59,287 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:08:59,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:08:59,290 INFO L158 Benchmark]: Toolchain (without parser) took 4161.93ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.8MB in the beginning and 189.4MB in the end (delta: -77.6MB). Peak memory consumption was 203.6MB. Max. memory is 16.1GB. [2025-02-06 01:08:59,290 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:59,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.72ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:08:59,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.55ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:08:59,291 INFO L158 Benchmark]: Boogie Preprocessor took 40.17ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:59,292 INFO L158 Benchmark]: IcfgBuilder took 294.25ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 78.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:08:59,292 INFO L158 Benchmark]: TraceAbstraction took 3573.75ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 78.2MB in the beginning and 189.5MB in the end (delta: -111.3MB). Peak memory consumption was 170.0MB. Max. memory is 16.1GB. [2025-02-06 01:08:59,293 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 427.8MB. Free memory was 189.5MB in the beginning and 189.4MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:08:59,293 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.34ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.72ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.55ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.17ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 294.25ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 78.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3573.75ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 78.2MB in the beginning and 189.5MB in the end (delta: -111.3MB). Peak memory consumption was 170.0MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 427.8MB. Free memory was 189.5MB in the beginning and 189.4MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 1; [L24] signed char var_1_8 = -32; [L25] signed char var_1_9 = -8; [L26] unsigned char var_1_10 = 2; [L27] double var_1_11 = 15.6; [L28] double var_1_12 = 15.4; [L29] double var_1_13 = 32.2; [L30] unsigned char var_1_14 = 5; [L31] unsigned short int last_1_var_1_1 = 32; [L32] signed char last_1_var_1_8 = -32; [L33] unsigned char last_1_var_1_10 = 2; VAL [isInitial=0, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L92] COND TRUE k_loop < 1 [L93] CALL updateLastVariables() [L80] last_1_var_1_1 = var_1_1 [L81] last_1_var_1_8 = var_1_8 [L82] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L63] var_1_7 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L64] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L65] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L65] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L66] var_1_9 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_9 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L67] RET assume_abort_if_not(var_1_9 >= -126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L69] var_1_11 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L70] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L94] RET updateVariables() [L95] CALL step() [L37] signed long int stepLocal_2 = (((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)); [L38] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L39] COND TRUE ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L40] COND FALSE !(stepLocal_1 && (last_1_var_1_8 >= var_1_9)) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L48] signed long int stepLocal_0 = ((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_0=2, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L49] COND FALSE !(last_1_var_1_10 < stepLocal_0) [L52] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=32, var_1_7=1, var_1_8=0, var_1_9=0] [L54] COND FALSE !((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) [L59] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return ((((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) ? (var_1_7 ? (var_1_1 == ((unsigned short int) var_1_10)) : 1) : (var_1_1 == ((unsigned short int) var_1_10))) && ((last_1_var_1_10 < (((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)))) ? (var_1_8 == ((signed char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed char) var_1_9)))) && ((((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13) ? ((var_1_7 && (last_1_var_1_8 >= var_1_9)) ? ((last_1_var_1_1 <= ((((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)))) ? (var_1_10 == ((unsigned char) var_1_14)) : 1) : 1) : (var_1_10 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=1, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 739 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 486 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 253 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 704/720 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 01:08:59,312 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:09:01,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:09:01,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:09:01,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:09:01,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:09:01,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:09:01,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:09:01,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:09:01,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:09:01,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:09:01,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:09:01,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:09:01,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:09:01,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:09:01,310 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:09:01,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:09:01,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:09:01,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:09:01,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:09:01,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:09:01,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:09:01,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:09:01,312 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 -> a669ebd5fed72ed6e42c2671940b4f9ab523443b9c3d9ff6be31e4f909568725 [2025-02-06 01:09:01,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:09:01,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:09:01,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:09:01,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:09:01,580 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:09:01,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i [2025-02-06 01:09:02,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8367a8cc0/985a642166434049917de18ca4ddbc5e/FLAGc46b4db32 [2025-02-06 01:09:02,941 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:09:02,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i [2025-02-06 01:09:02,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8367a8cc0/985a642166434049917de18ca4ddbc5e/FLAGc46b4db32 [2025-02-06 01:09:02,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8367a8cc0/985a642166434049917de18ca4ddbc5e [2025-02-06 01:09:02,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:09:02,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:09:02,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:09:02,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:09:02,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:09:02,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:02" (1/1) ... [2025-02-06 01:09:02,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd46de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:02, skipping insertion in model container [2025-02-06 01:09:02,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:02" (1/1) ... [2025-02-06 01:09:02,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:09:03,096 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928] [2025-02-06 01:09:03,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:09:03,153 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:09:03,163 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928] [2025-02-06 01:09:03,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:09:03,196 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:09:03,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03 WrapperNode [2025-02-06 01:09:03,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:09:03,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:09:03,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:09:03,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:09:03,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,233 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-02-06 01:09:03,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:09:03,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:09:03,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:09:03,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:09:03,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,257 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:09:03,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,262 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:09:03,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:09:03,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:09:03,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:09:03,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (1/1) ... [2025-02-06 01:09:03,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:09:03,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:09:03,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:09:03,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:09:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:09:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:09:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:09:03,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:09:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:09:03,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:09:03,364 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:09:03,366 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:09:03,605 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-06 01:09:03,606 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:09:03,614 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:09:03,615 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:09:03,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:03 BoogieIcfgContainer [2025-02-06 01:09:03,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:09:03,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:09:03,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:09:03,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:09:03,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:09:02" (1/3) ... [2025-02-06 01:09:03,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375f737b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:03, skipping insertion in model container [2025-02-06 01:09:03,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:03" (2/3) ... [2025-02-06 01:09:03,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375f737b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:03, skipping insertion in model container [2025-02-06 01:09:03,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:03" (3/3) ... [2025-02-06 01:09:03,625 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i [2025-02-06 01:09:03,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:09:03,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:09:03,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:09:03,693 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;@671855da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:09:03,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:09:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 01:09:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 01:09:03,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:03,704 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:03,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:03,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1307823667, now seen corresponding path program 1 times [2025-02-06 01:09:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418931926] [2025-02-06 01:09:03,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:03,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:09:03,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:03,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:09:03,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 01:09:03,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 01:09:03,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 01:09:03,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:03,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:03,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:09:03,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 01:09:03,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:09:03,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:09:03,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418931926] [2025-02-06 01:09:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418931926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:09:03,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108526294] [2025-02-06 01:09:03,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:09:03,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:09:03,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:09:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:09:03,924 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 01:09:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:03,937 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2025-02-06 01:09:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:09:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-02-06 01:09:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:03,942 INFO L225 Difference]: With dead ends: 77 [2025-02-06 01:09:03,943 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 01:09:03,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:09:03,947 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:03,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:09:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 01:09:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 01:09:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 01:09:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-02-06 01:09:03,981 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2025-02-06 01:09:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:03,982 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-02-06 01:09:03,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 01:09:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-02-06 01:09:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 01:09:03,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:03,984 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:03,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 01:09:04,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:09:04,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:04,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2118536880, now seen corresponding path program 1 times [2025-02-06 01:09:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:04,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240551788] [2025-02-06 01:09:04,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:04,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:09:04,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:04,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:09:04,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 01:09:04,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 01:09:04,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 01:09:04,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:04,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:04,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 01:09:04,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 01:09:04,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:09:04,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:09:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240551788] [2025-02-06 01:09:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240551788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:09:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636148669] [2025-02-06 01:09:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:04,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:09:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:09:04,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:09:04,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:09:04,490 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:09:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:04,738 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2025-02-06 01:09:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:09:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-02-06 01:09:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:04,742 INFO L225 Difference]: With dead ends: 116 [2025-02-06 01:09:04,742 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 01:09:04,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:09:04,744 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 45 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:04,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:09:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 01:09:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2025-02-06 01:09:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 01:09:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2025-02-06 01:09:04,762 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 64 [2025-02-06 01:09:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:04,763 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2025-02-06 01:09:04,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:09:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2025-02-06 01:09:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 01:09:04,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:04,765 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:04,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 01:09:04,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:09:04,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:04,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2147166031, now seen corresponding path program 1 times [2025-02-06 01:09:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913581810] [2025-02-06 01:09:04,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:09:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:04,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:09:04,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 01:09:05,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 01:09:05,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 01:09:05,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:05,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 01:09:05,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 01:09:55,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:09:55,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:09:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913581810] [2025-02-06 01:09:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913581810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:55,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:09:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097423542] [2025-02-06 01:09:55,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:09:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:09:55,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:09:55,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:09:55,932 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:09:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:56,190 INFO L93 Difference]: Finished difference Result 124 states and 167 transitions. [2025-02-06 01:09:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:09:56,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-02-06 01:09:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:56,194 INFO L225 Difference]: With dead ends: 124 [2025-02-06 01:09:56,194 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 01:09:56,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:09:56,195 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 63 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:56,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 226 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:09:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 01:09:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2025-02-06 01:09:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 01:09:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2025-02-06 01:09:56,214 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 64 [2025-02-06 01:09:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:56,215 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2025-02-06 01:09:56,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:09:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2025-02-06 01:09:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 01:09:56,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:56,216 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:56,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 01:09:56,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:09:56,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:56,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2126792041, now seen corresponding path program 1 times [2025-02-06 01:09:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:09:56,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817064981] [2025-02-06 01:09:56,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:56,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:09:56,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:09:56,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:09:56,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 01:09:56,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:09:56,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:09:56,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:56,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:56,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 01:09:56,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:10:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 01:10:08,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:10:08,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:10:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817064981] [2025-02-06 01:10:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817064981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:10:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:10:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083151660] [2025-02-06 01:10:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 01:10:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:10:08,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 01:10:08,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:10:08,462 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:10:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:08,891 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2025-02-06 01:10:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 01:10:08,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2025-02-06 01:10:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:08,895 INFO L225 Difference]: With dead ends: 127 [2025-02-06 01:10:08,895 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 01:10:08,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:10:08,896 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:08,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 277 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:10:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 01:10:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2025-02-06 01:10:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 01:10:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2025-02-06 01:10:08,906 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 65 [2025-02-06 01:10:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:08,906 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2025-02-06 01:10:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 01:10:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2025-02-06 01:10:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 01:10:08,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:08,907 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:10:08,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 01:10:09,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:10:09,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:09,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash -312286956, now seen corresponding path program 1 times [2025-02-06 01:10:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:10:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549189202] [2025-02-06 01:10:09,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:09,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:10:09,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:10:09,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:10:09,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 01:10:09,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:10:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:10:09,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:09,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:09,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 01:10:09,179 INFO L279 TraceCheckSpWp]: Computing forward predicates...