./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-9.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 5105a9ac8fbead4327a3048bb26dd37319bc5d26c3f11dcff18c222fc5bc4641 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:19:14,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:19:14,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:19:14,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:19:14,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:19:14,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:19:14,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:19:14,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:19:14,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:19:14,684 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:19:14,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:19:14,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:19:14,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:19:14,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:19:14,684 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:19:14,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:19:14,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:19:14,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:19:14,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:19:14,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:14,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:14,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:19:14,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:19:14,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:19:14,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:19:14,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:19:14,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:19:14,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:19:14,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:19:14,687 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 -> 5105a9ac8fbead4327a3048bb26dd37319bc5d26c3f11dcff18c222fc5bc4641 [2025-01-09 14:19:14,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:19:14,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:19:14,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:19:14,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:19:14,851 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:19:14,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-9.i [2025-01-09 14:19:15,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29218220d/5b8c6a28c2894ee09f389b96e47f481b/FLAG0f41af968 [2025-01-09 14:19:16,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:19:16,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-9.i [2025-01-09 14:19:16,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29218220d/5b8c6a28c2894ee09f389b96e47f481b/FLAG0f41af968 [2025-01-09 14:19:16,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29218220d/5b8c6a28c2894ee09f389b96e47f481b [2025-01-09 14:19:16,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:19:16,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:19:16,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:16,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:19:16,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:19:16,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7a6b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16, skipping insertion in model container [2025-01-09 14:19:16,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:19:16,644 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_operatoramount_amount10_file-9.i[914,927] [2025-01-09 14:19:16,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:16,674 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:19:16,681 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_operatoramount_amount10_file-9.i[914,927] [2025-01-09 14:19:16,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:16,697 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:19:16,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16 WrapperNode [2025-01-09 14:19:16,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:16,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:16,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:19:16,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:19:16,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,720 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2025-01-09 14:19:16,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:16,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:19:16,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:19:16,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:19:16,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,732 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:19:16,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:19:16,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:19:16,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:19:16,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:19:16,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (1/1) ... [2025-01-09 14:19:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:16,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:16,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:19:16,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:19:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:19:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:19:16,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:19:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:19:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:19:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:19:16,859 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:19:16,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:19:17,003 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:19:17,004 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:19:17,013 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:19:17,014 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:19:17,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:17 BoogieIcfgContainer [2025-01-09 14:19:17,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:19:17,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:19:17,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:19:17,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:19:17,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:19:16" (1/3) ... [2025-01-09 14:19:17,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663698e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:17, skipping insertion in model container [2025-01-09 14:19:17,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:16" (2/3) ... [2025-01-09 14:19:17,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663698e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:17, skipping insertion in model container [2025-01-09 14:19:17,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:17" (3/3) ... [2025-01-09 14:19:17,023 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-9.i [2025-01-09 14:19:17,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:19:17,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-9.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:19:17,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:19:17,084 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;@2216fe08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:19:17,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:19:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:19:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 14:19:17,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:17,094 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:17,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1747989238, now seen corresponding path program 1 times [2025-01-09 14:19:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:17,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356706475] [2025-01-09 14:19:17,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:17,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 14:19:17,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 14:19:17,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:17,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 14:19:17,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:17,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356706475] [2025-01-09 14:19:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356706475] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:19:17,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253994428] [2025-01-09 14:19:17,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:17,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:17,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:17,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:19:17,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:19:17,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 14:19:17,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 14:19:17,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:17,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:17,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:19:17,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 14:19:17,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253994428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:19:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:19:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173486664] [2025-01-09 14:19:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:17,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:19:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:17,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:19:17,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:19:17,390 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:17,401 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2025-01-09 14:19:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:19:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2025-01-09 14:19:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:17,406 INFO L225 Difference]: With dead ends: 66 [2025-01-09 14:19:17,406 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 14:19:17,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 58 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-01-09 14:19:17,410 INFO L435 NwaCegarLoop]: 44 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, 44 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-01-09 14:19:17,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 14:19:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-09 14:19:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:19:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-01-09 14:19:17,439 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 57 [2025-01-09 14:19:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:17,439 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-01-09 14:19:17,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-01-09 14:19:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 14:19:17,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:17,441 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:17,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:19:17,642 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-01-09 14:19:17,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:17,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash 661298414, now seen corresponding path program 1 times [2025-01-09 14:19:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816422445] [2025-01-09 14:19:17,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:17,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 14:19:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 14:19:17,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:17,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:19:17,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:19:17,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 14:19:17,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 14:19:17,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:17,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:19:17,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:19:17,863 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:19:17,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:19:17,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:19:17,868 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:19:17,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:19:17,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:19:17 BoogieIcfgContainer [2025-01-09 14:19:17,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:19:17,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:19:17,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:19:17,908 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:19:17,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:17" (3/4) ... [2025-01-09 14:19:17,913 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:19:17,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:19:17,914 INFO L158 Benchmark]: Toolchain (without parser) took 1385.32ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 66.9MB in the end (delta: 66.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-09 14:19:17,915 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:19:17,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.30ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 121.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:19:17,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.53ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 119.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:19:17,916 INFO L158 Benchmark]: Boogie Preprocessor took 18.58ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 118.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:19:17,916 INFO L158 Benchmark]: RCFGBuilder took 275.40ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 106.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:19:17,916 INFO L158 Benchmark]: TraceAbstraction took 890.46ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 67.4MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 14:19:17,916 INFO L158 Benchmark]: Witness Printer took 6.49ms. Allocated memory is still 167.8MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:19:17,917 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.30ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 121.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.53ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 119.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.58ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 118.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 275.40ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 106.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 890.46ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 67.4MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 6.49ms. Allocated memory is still 167.8MB. Free memory is still 66.9MB. 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 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 5; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 5; [L25] double var_1_4 = 4.2; [L26] double var_1_5 = 16.375; [L27] double var_1_6 = 99999.495; [L28] double var_1_7 = 1.2; [L29] double var_1_8 = 4.2; VAL [isInitial=0, var_1_1=5, var_1_2=0, var_1_3=5, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L73] isInitial = 1 [L74] FCALL initially() [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L51] var_1_2 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_3=5, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_3=5, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L52] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=5, var_1_3=5, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L53] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=5, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=5, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L53] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=5, var_1_2=0, var_1_3=5, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L54] var_1_3 = __VERIFIER_nondet_ushort() [L55] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L55] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=5, var_1_2=0, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L56] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L56] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_5=131/8, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L57] var_1_5 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L58] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_6=19999899/200, var_1_7=6/5, var_1_8=21/5] [L59] var_1_6 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_7=6/5, var_1_8=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_7=6/5, var_1_8=21/5] [L60] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_7=6/5, var_1_8=21/5] [L61] var_1_7 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_8=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_8=21/5] [L62] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5, var_1_8=21/5] [L63] var_1_8 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5] [L64] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_2=0, var_1_3=-2, var_1_4=21/5] [L77] RET updateVariables() [L78] CALL step() [L33] COND TRUE ! var_1_2 [L34] var_1_1 = var_1_3 VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=-2, var_1_4=21/5] [L36] COND FALSE !(31.6 > var_1_5) [L47] var_1_4 = var_1_8 VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=-2, var_1_4=100004, var_1_8=100004] [L78] RET step() [L79] CALL, EXPR property() [L69-L70] return ((! var_1_2) ? (var_1_1 == ((unsigned short int) var_1_3)) : 1) && ((31.6 > var_1_5) ? ((var_1_5 > var_1_6) ? (var_1_4 == ((double) ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_2 ? (var_1_4 == ((double) var_1_8)) : (var_1_4 == ((double) 1.0000000000000875E13)))) : (var_1_4 == ((double) var_1_8))) ; VAL [\result=0, isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=-2, var_1_4=100004, var_1_8=100004] [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=-2, var_1_4=100004, var_1_8=100004] [L19] reach_error() VAL [isInitial=1, var_1_1=-2, var_1_2=0, var_1_3=-2, var_1_4=100004, var_1_8=100004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 44 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 210/224 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-01-09 14:19:17,930 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_operatoramount_amount10_file-9.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 5105a9ac8fbead4327a3048bb26dd37319bc5d26c3f11dcff18c222fc5bc4641 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:19:19,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:19:20,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:19:20,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:19:20,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:19:20,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:19:20,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:19:20,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:19:20,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:19:20,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:19:20,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:19:20,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:19:20,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:19:20,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:19:20,098 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:19:20,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:19:20,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:19:20,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:19:20,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:19:20,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:19:20,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:20,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:20,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:20,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:20,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:19:20,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:20,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:20,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:20,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:20,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:19:20,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:19:20,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:19:20,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:19:20,101 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:19:20,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:19:20,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:19:20,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:19:20,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:19:20,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:19:20,102 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 -> 5105a9ac8fbead4327a3048bb26dd37319bc5d26c3f11dcff18c222fc5bc4641 [2025-01-09 14:19:20,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:19:20,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:19:20,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:19:20,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:19:20,344 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:19:20,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-9.i [2025-01-09 14:19:21,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b481fc8cd/3cb9f4fdfe944c9b91f2fe569c42a92b/FLAG36a9513b0 [2025-01-09 14:19:21,753 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:19:21,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-9.i [2025-01-09 14:19:21,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b481fc8cd/3cb9f4fdfe944c9b91f2fe569c42a92b/FLAG36a9513b0 [2025-01-09 14:19:21,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b481fc8cd/3cb9f4fdfe944c9b91f2fe569c42a92b [2025-01-09 14:19:21,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:19:21,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:19:21,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:21,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:19:21,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:19:21,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:21,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52dbbb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21, skipping insertion in model container [2025-01-09 14:19:21,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:21,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:19:21,899 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_operatoramount_amount10_file-9.i[914,927] [2025-01-09 14:19:21,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:21,939 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:19:21,946 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_operatoramount_amount10_file-9.i[914,927] [2025-01-09 14:19:21,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:21,966 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:19:21,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21 WrapperNode [2025-01-09 14:19:21,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:21,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:21,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:19:21,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:19:21,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:21,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:21,989 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2025-01-09 14:19:21,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:21,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:19:21,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:19:21,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:19:21,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:21,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:21,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,005 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:19:22,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:19:22,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:19:22,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:19:22,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:19:22,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (1/1) ... [2025-01-09 14:19:22,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:22,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:22,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:19:22,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:19:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:19:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:19:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:19:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:19:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:19:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:19:22,101 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:19:22,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:19:22,229 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:19:22,230 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:19:22,235 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:19:22,236 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:19:22,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:22 BoogieIcfgContainer [2025-01-09 14:19:22,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:19:22,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:19:22,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:19:22,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:19:22,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:19:21" (1/3) ... [2025-01-09 14:19:22,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735e6475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:22, skipping insertion in model container [2025-01-09 14:19:22,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:21" (2/3) ... [2025-01-09 14:19:22,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735e6475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:22, skipping insertion in model container [2025-01-09 14:19:22,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:22" (3/3) ... [2025-01-09 14:19:22,242 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-9.i [2025-01-09 14:19:22,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:19:22,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-9.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:19:22,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:19:22,297 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;@460748f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:19:22,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:19:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:19:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 14:19:22,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:22,313 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:22,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1747989238, now seen corresponding path program 1 times [2025-01-09 14:19:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:22,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278880099] [2025-01-09 14:19:22,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:22,328 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-01-09 14:19:22,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:22,331 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-01-09 14:19:22,334 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-01-09 14:19:22,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 14:19:22,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 14:19:22,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:22,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:22,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:19:22,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 14:19:22,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:22,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278880099] [2025-01-09 14:19:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278880099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:22,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:19:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171393307] [2025-01-09 14:19:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:22,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:19:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:22,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:19:22,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:19:22,535 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:22,549 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2025-01-09 14:19:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:19:22,551 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2025-01-09 14:19:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:22,555 INFO L225 Difference]: With dead ends: 66 [2025-01-09 14:19:22,555 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 14:19:22,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-01-09 14:19:22,558 INFO L435 NwaCegarLoop]: 44 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, 44 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-01-09 14:19:22,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 14:19:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-09 14:19:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:19:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-01-09 14:19:22,583 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 57 [2025-01-09 14:19:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:22,583 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-01-09 14:19:22,584 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-01-09 14:19:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 14:19:22,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:22,585 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:22,590 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-01-09 14:19:22,786 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-01-09 14:19:22,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:22,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 661298414, now seen corresponding path program 1 times [2025-01-09 14:19:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923409523] [2025-01-09 14:19:22,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:22,788 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-01-09 14:19:22,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:22,789 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-01-09 14:19:22,791 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-01-09 14:19:22,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 14:19:22,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 14:19:22,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:22,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:22,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:19:22,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 14:19:25,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:25,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:25,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923409523] [2025-01-09 14:19:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923409523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:19:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163947352] [2025-01-09 14:19:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:25,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:19:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:25,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:19:25,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:19:25,188 INFO L87 Difference]: Start difference. First operand 33 states and 44 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:26,084 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-01-09 14:19:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:19:26,085 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2025-01-09 14:19:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:26,086 INFO L225 Difference]: With dead ends: 76 [2025-01-09 14:19:26,086 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 14:19:26,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:19:26,087 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 86 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:26,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 161 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:19:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 14:19:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2025-01-09 14:19:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:19:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-01-09 14:19:26,097 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 57 [2025-01-09 14:19:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:26,098 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-01-09 14:19:26,098 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-01-09 14:19:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 14:19:26,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:26,099 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:26,103 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 (3)] Ended with exit code 0 [2025-01-09 14:19:26,299 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-01-09 14:19:26,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:26,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 718556716, now seen corresponding path program 1 times [2025-01-09 14:19:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316885843] [2025-01-09 14:19:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:26,301 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-01-09 14:19:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:26,303 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-01-09 14:19:26,305 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-01-09 14:19:26,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 14:19:26,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 14:19:26,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:26,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:19:26,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 14:19:27,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:27,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316885843] [2025-01-09 14:19:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316885843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:27,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:27,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:19:27,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413338864] [2025-01-09 14:19:27,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:27,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:19:27,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:27,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:19:27,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:19:27,586 INFO L87 Difference]: Start difference. First operand 55 states and 70 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:28,194 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2025-01-09 14:19:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:19:28,196 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2025-01-09 14:19:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:28,197 INFO L225 Difference]: With dead ends: 125 [2025-01-09 14:19:28,197 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 14:19:28,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:19:28,198 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 62 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:28,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 172 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:19:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 14:19:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2025-01-09 14:19:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:19:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-01-09 14:19:28,211 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 57 [2025-01-09 14:19:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:28,211 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-01-09 14:19:28,211 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-01-09 14:19:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 14:19:28,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:28,214 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:28,225 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:19:28,415 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-01-09 14:19:28,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:28,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1357909332, now seen corresponding path program 1 times [2025-01-09 14:19:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:28,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436178704] [2025-01-09 14:19:28,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:28,416 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-01-09 14:19:28,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:28,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-01-09 14:19:28,421 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-01-09 14:19:28,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 14:19:28,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 14:19:28,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:28,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:28,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:19:28,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 14:19:30,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:30,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:30,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436178704] [2025-01-09 14:19:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436178704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:30,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:30,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:19:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164722785] [2025-01-09 14:19:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:19:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:30,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:19:30,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:19:30,787 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:33,368 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2025-01-09 14:19:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 14:19:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2025-01-09 14:19:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:33,375 INFO L225 Difference]: With dead ends: 98 [2025-01-09 14:19:33,375 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 14:19:33,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:19:33,376 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 98 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:33,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 236 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:19:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 14:19:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2025-01-09 14:19:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:19:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2025-01-09 14:19:33,385 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 58 [2025-01-09 14:19:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:33,386 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2025-01-09 14:19:33,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2025-01-09 14:19:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 14:19:33,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:33,387 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:33,391 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-01-09 14:19:33,590 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-01-09 14:19:33,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:33,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash 417098030, now seen corresponding path program 1 times [2025-01-09 14:19:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864530898] [2025-01-09 14:19:33,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:33,593 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-01-09 14:19:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:33,598 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-01-09 14:19:33,599 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-01-09 14:19:33,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 14:19:33,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 14:19:33,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:33,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:33,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:19:33,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 14:19:35,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:35,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:35,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864530898] [2025-01-09 14:19:35,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864530898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:35,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:35,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:19:35,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906328879] [2025-01-09 14:19:35,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:35,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:19:35,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:35,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:19:35,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:19:35,595 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:36,718 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2025-01-09 14:19:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:19:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2025-01-09 14:19:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:36,720 INFO L225 Difference]: With dead ends: 87 [2025-01-09 14:19:36,722 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 14:19:36,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:19:36,724 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 54 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:36,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 255 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:19:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 14:19:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2025-01-09 14:19:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:19:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2025-01-09 14:19:36,734 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 58 [2025-01-09 14:19:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:36,735 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2025-01-09 14:19:36,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:19:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2025-01-09 14:19:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 14:19:36,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:36,735 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:36,741 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 (6)] Ended with exit code 0 [2025-01-09 14:19:36,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-01-09 14:19:36,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash 905214852, now seen corresponding path program 1 times [2025-01-09 14:19:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:36,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370161980] [2025-01-09 14:19:36,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:36,937 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-01-09 14:19:36,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:36,941 INFO L229 MonitoredProcess]: Starting monitored process 7 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-01-09 14:19:36,942 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 (7)] Waiting until timeout for monitored process [2025-01-09 14:19:36,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 14:19:37,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 14:19:37,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:37,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:37,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:19:37,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:19:37,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:37,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370161980] [2025-01-09 14:19:37,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370161980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:37,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:37,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:19:37,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414288558] [2025-01-09 14:19:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:19:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:37,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:19:37,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:37,034 INFO L87 Difference]: Start difference. First operand 62 states and 75 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:37,084 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2025-01-09 14:19:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:19:37,085 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-01-09 14:19:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:37,085 INFO L225 Difference]: With dead ends: 123 [2025-01-09 14:19:37,085 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 14:19:37,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:37,086 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:37,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 14:19:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-01-09 14:19:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.148936170212766) internal successors, (54), 48 states have internal predecessors, (54), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:19:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-01-09 14:19:37,101 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 59 [2025-01-09 14:19:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:37,103 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-01-09 14:19:37,104 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-01-09 14:19:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 14:19:37,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:37,104 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:37,116 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 (7)] Ended with exit code 0 [2025-01-09 14:19:37,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-01-09 14:19:37,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:37,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash 907061894, now seen corresponding path program 1 times [2025-01-09 14:19:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070336914] [2025-01-09 14:19:37,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:37,306 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-01-09 14:19:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:37,308 INFO L229 MonitoredProcess]: Starting monitored process 8 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-01-09 14:19:37,310 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 (8)] Waiting until timeout for monitored process [2025-01-09 14:19:37,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 14:19:37,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 14:19:37,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:37,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:37,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 14:19:37,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:19:38,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:38,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070336914] [2025-01-09 14:19:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070336914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:19:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545583100] [2025-01-09 14:19:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:19:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:38,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:19:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:19:38,037 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:38,261 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-01-09 14:19:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:19:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-01-09 14:19:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:38,262 INFO L225 Difference]: With dead ends: 75 [2025-01-09 14:19:38,262 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 14:19:38,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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-01-09 14:19:38,264 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:38,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 189 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:19:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 14:19:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2025-01-09 14:19:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:19:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-01-09 14:19:38,274 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 59 [2025-01-09 14:19:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:38,275 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-01-09 14:19:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-01-09 14:19:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 14:19:38,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:38,275 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:38,280 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 (8)] Forceful destruction successful, exit code 0 [2025-01-09 14:19:38,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-01-09 14:19:38,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:38,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 95868226, now seen corresponding path program 1 times [2025-01-09 14:19:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783908032] [2025-01-09 14:19:38,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:38,476 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-01-09 14:19:38,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:38,479 INFO L229 MonitoredProcess]: Starting monitored process 9 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-01-09 14:19:38,481 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 (9)] Waiting until timeout for monitored process [2025-01-09 14:19:38,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 14:19:38,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 14:19:38,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:38,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:19:38,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 14:19:39,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:39,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783908032] [2025-01-09 14:19:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783908032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:19:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625793938] [2025-01-09 14:19:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:39,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:19:39,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:39,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:19:39,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:19:39,358 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:39,946 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-01-09 14:19:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:19:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-01-09 14:19:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:39,947 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:19:39,947 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 14:19:39,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:19:39,948 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 49 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:39,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:19:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 14:19:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 14:19:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 14:19:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 14:19:39,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2025-01-09 14:19:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:39,950 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 14:19:39,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:19:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 14:19:39,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 14:19:39,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:19:39,958 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 (9)] Forceful destruction successful, exit code 0 [2025-01-09 14:19:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-01-09 14:19:40,157 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:19:40,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 14:19:43,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:19:43,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:19:43,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:19:43,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:19:43 BoogieIcfgContainer [2025-01-09 14:19:43,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:19:43,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:19:43,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:19:43,549 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:19:43,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:22" (3/4) ... [2025-01-09 14:19:43,555 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 14:19:43,562 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 14:19:43,567 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 14:19:43,568 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 14:19:43,568 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 14:19:43,568 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 14:19:43,662 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 14:19:43,665 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 14:19:43,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:19:43,666 INFO L158 Benchmark]: Toolchain (without parser) took 21889.40ms. Allocated memory was 83.9MB in the beginning and 318.8MB in the end (delta: 234.9MB). Free memory was 59.8MB in the beginning and 256.2MB in the end (delta: -196.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2025-01-09 14:19:43,666 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:19:43,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.33ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 47.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:19:43,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.51ms. Allocated memory is still 83.9MB. Free memory was 47.5MB in the beginning and 46.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:19:43,667 INFO L158 Benchmark]: Boogie Preprocessor took 24.38ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:19:43,667 INFO L158 Benchmark]: RCFGBuilder took 221.29ms. Allocated memory is still 83.9MB. Free memory was 44.1MB in the beginning and 32.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:19:43,667 INFO L158 Benchmark]: TraceAbstraction took 21310.60ms. Allocated memory was 83.9MB in the beginning and 318.8MB in the end (delta: 234.9MB). Free memory was 31.4MB in the beginning and 260.9MB in the end (delta: -229.6MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. [2025-01-09 14:19:43,667 INFO L158 Benchmark]: Witness Printer took 117.13ms. Allocated memory is still 318.8MB. Free memory was 260.9MB in the beginning and 256.2MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:19:43,668 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.21ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.7MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.33ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 47.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.51ms. Allocated memory is still 83.9MB. Free memory was 47.5MB in the beginning and 46.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.38ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 221.29ms. Allocated memory is still 83.9MB. Free memory was 44.1MB in the beginning and 32.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21310.60ms. Allocated memory was 83.9MB in the beginning and 318.8MB in the end (delta: 234.9MB). Free memory was 31.4MB in the beginning and 260.9MB in the end (delta: -229.6MB). Peak memory consumption was 156.3MB. Max. memory is 16.1GB. * Witness Printer took 117.13ms. Allocated memory is still 318.8MB. Free memory was 260.9MB in the beginning and 256.2MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 386 mSDsluCounter, 1314 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1001 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1291 IncrementalHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 313 mSDtfsCounter, 1291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=4, InterpolantAutomatonStates: 103, 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, 8 MinimizatonAttempts, 107 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 2875 SizeOfPredicates, 54 NumberOfNonLiveVariables, 789 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 896/896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((var_1_2 != 0) || (var_1_3 == var_1_1)) RESULT: Ultimate proved your program to be correct! [2025-01-09 14:19:43,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE