./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.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_amount25_file-89.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 ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:41:22,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:41:22,594 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:41:22,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:41:22,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:41:22,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:41:22,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:41:22,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:41:22,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:41:22,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:41:22,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:41:22,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:41:22,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:41:22,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:41:22,622 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:41:22,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:41:22,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:41:22,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:41:22,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:41:22,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:41:22,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:41:22,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:41:22,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:41:22,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:41:22,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:22,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:41:22,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:41:22,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:41:22,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:41:22,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:22,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:41:22,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:41:22,628 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 -> ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f [2025-01-09 14:41:22,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:41:22,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:41:22,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:41:22,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:41:22,853 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:41:22,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2025-01-09 14:41:23,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fac6838b/ee0892abf86148ab9ec638eb29bd1dcb/FLAGcf2ad509a [2025-01-09 14:41:24,204 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:41:24,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2025-01-09 14:41:24,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fac6838b/ee0892abf86148ab9ec638eb29bd1dcb/FLAGcf2ad509a [2025-01-09 14:41:24,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fac6838b/ee0892abf86148ab9ec638eb29bd1dcb [2025-01-09 14:41:24,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:41:24,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:41:24,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:41:24,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:41:24,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:41:24,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6c4b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24, skipping insertion in model container [2025-01-09 14:41:24,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:41:24,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i[915,928] [2025-01-09 14:41:24,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:41:24,711 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:41:24,721 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_amount25_file-89.i[915,928] [2025-01-09 14:41:24,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:41:24,745 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:41:24,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24 WrapperNode [2025-01-09 14:41:24,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:41:24,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:41:24,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:41:24,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:41:24,750 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:41:24" (1/1) ... [2025-01-09 14:41:24,755 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:41:24" (1/1) ... [2025-01-09 14:41:24,777 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-01-09 14:41:24,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:41:24,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:41:24,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:41:24,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:41:24,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,801 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:41:24,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:41:24,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:41:24,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:41:24,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:41:24,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (1/1) ... [2025-01-09 14:41:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:24,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:41:24,845 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:41:24,852 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:41:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:41:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:41:24,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:41:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:41:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:41:24,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:41:24,916 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:41:24,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:41:25,121 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:41:25,121 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:41:25,130 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:41:25,130 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:41:25,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:25 BoogieIcfgContainer [2025-01-09 14:41:25,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:41:25,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:41:25,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:41:25,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:41:25,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:41:24" (1/3) ... [2025-01-09 14:41:25,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d322041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:25, skipping insertion in model container [2025-01-09 14:41:25,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:24" (2/3) ... [2025-01-09 14:41:25,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d322041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:25, skipping insertion in model container [2025-01-09 14:41:25,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:25" (3/3) ... [2025-01-09 14:41:25,136 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-89.i [2025-01-09 14:41:25,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:41:25,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-89.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:41:25,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:41:25,199 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;@dbf285c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:41:25,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:41:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 14:41:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 14:41:25,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:41:25,211 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:41:25,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:41:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1860290552, now seen corresponding path program 1 times [2025-01-09 14:41:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:41:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905988140] [2025-01-09 14:41:25,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:41:25,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:41:25,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:41:25,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:25,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:41:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 14:41:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:41:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905988140] [2025-01-09 14:41:25,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905988140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:41:25,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270782716] [2025-01-09 14:41:25,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:41:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:41:25,421 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:41:25,423 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:41:25,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:41:25,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:41:25,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:25,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:41:25,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:41:25,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:41:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 14:41:25,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:41:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270782716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:41:25,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:41:25,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:41:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161447603] [2025-01-09 14:41:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:41:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:41:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:41:25,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:41:25,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:41:25,562 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 14:41:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:41:25,575 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-01-09 14:41:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:41:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2025-01-09 14:41:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:41:25,579 INFO L225 Difference]: With dead ends: 100 [2025-01-09 14:41:25,579 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 14:41:25,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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:41:25,582 INFO L435 NwaCegarLoop]: 71 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, 71 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:41:25,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:41:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 14:41:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 14:41:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 14:41:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-01-09 14:41:25,605 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 120 [2025-01-09 14:41:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:41:25,606 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-01-09 14:41:25,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 14:41:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-01-09 14:41:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 14:41:25,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:41:25,608 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:41:25,813 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:41:25,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:41:25,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:41:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash 14760702, now seen corresponding path program 1 times [2025-01-09 14:41:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:41:25,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539910099] [2025-01-09 14:41:25,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:41:25,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:41:25,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:41:25,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:25,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:41:25,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293046752] [2025-01-09 14:41:25,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:25,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:41:25,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:41:25,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:41:25,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:41:25,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:41:26,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:41:26,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:26,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:41:26,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:41:26,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:41:26,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:41:26,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:26,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:41:26,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:41:26,159 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:41:26,160 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:41:26,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:41:26,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:41:26,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:41:26,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:41:26,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:41:26 BoogieIcfgContainer [2025-01-09 14:41:26,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:41:26,439 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:41:26,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:41:26,439 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:41:26,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:25" (3/4) ... [2025-01-09 14:41:26,441 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:41:26,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:41:26,446 INFO L158 Benchmark]: Toolchain (without parser) took 1892.78ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 155.7MB in the end (delta: 2.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2025-01-09 14:41:26,446 INFO L158 Benchmark]: CDTParser took 1.41ms. Allocated memory is still 218.1MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:41:26,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.83ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 145.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:41:26,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.12ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 143.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:41:26,447 INFO L158 Benchmark]: Boogie Preprocessor took 39.74ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 140.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:41:26,447 INFO L158 Benchmark]: RCFGBuilder took 312.26ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 123.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:41:26,448 INFO L158 Benchmark]: TraceAbstraction took 1302.87ms. Allocated memory is still 201.3MB. Free memory was 122.9MB in the beginning and 155.8MB in the end (delta: -32.8MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2025-01-09 14:41:26,448 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:41:26,450 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41ms. Allocated memory is still 218.1MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.83ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 145.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.12ms. Allocated memory is still 201.3MB. Free memory was 145.9MB in the beginning and 143.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.74ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 140.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 312.26ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 123.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1302.87ms. Allocated memory is still 201.3MB. Free memory was 122.9MB in the beginning and 155.8MB in the end (delta: -32.8MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 52, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 5; [L24] unsigned char var_1_3 = 4; [L25] signed long int var_1_4 = -256; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] double var_1_9 = 9.5; [L31] double var_1_10 = -0.4; [L32] double var_1_11 = 31.5; [L33] double var_1_12 = 16.25; [L34] double var_1_13 = 127.5; [L35] double var_1_14 = 100000.5; VAL [isInitial=0, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_2=5, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L94] isInitial = 1 [L95] FCALL initially() [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L59] var_1_3 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L63] var_1_4 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L64] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L67] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L70] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L78] var_1_10 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L79] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L80] var_1_12 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L81] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L98] RET updateVariables() [L99] CALL step() [L39] COND TRUE (var_1_2 / var_1_3) >= var_1_4 [L40] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L44] unsigned char stepLocal_0 = (var_1_6 && var_1_8) || (var_1_2 >= 5); VAL [isInitial=1, stepLocal_0=1, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L45] COND TRUE stepLocal_0 && (var_1_3 < var_1_4) [L46] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L50] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L51] COND TRUE (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || stepLocal_1 [L52] var_1_11 = (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 / var_1_3) >= var_1_4) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : (var_1_1 == ((unsigned char) ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8))))) && ((((var_1_6 && var_1_8) || (var_1_2 >= 5)) && (var_1_3 < var_1_4)) ? (var_1_9 == ((double) var_1_10)) : (var_1_9 == ((double) var_1_10)))) && (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || var_1_6) ? (var_1_11 == ((double) (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=5, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 19, 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, 71 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, 71 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 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:41:26,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_amount25_file-89.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 ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:41:28,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:41:28,414 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:41:28,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:41:28,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:41:28,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:41:28,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:41:28,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:41:28,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:41:28,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:41:28,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:41:28,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:41:28,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:41:28,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:41:28,448 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:41:28,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:41:28,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:41:28,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:28,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:28,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:41:28,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:41:28,450 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 -> ef5db925f2e8ec3d5648f64b513836d0bb3bb3fe326dda100ad59242c7d9ff1f [2025-01-09 14:41:28,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:41:28,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:41:28,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:41:28,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:41:28,700 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:41:28,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2025-01-09 14:41:29,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aeb4aef1/20d9e093d9a640b8ba1c4d23b50a6bee/FLAGe5a427315 [2025-01-09 14:41:30,145 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:41:30,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2025-01-09 14:41:30,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aeb4aef1/20d9e093d9a640b8ba1c4d23b50a6bee/FLAGe5a427315 [2025-01-09 14:41:30,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1aeb4aef1/20d9e093d9a640b8ba1c4d23b50a6bee [2025-01-09 14:41:30,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:41:30,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:41:30,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:41:30,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:41:30,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:41:30,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca9f59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30, skipping insertion in model container [2025-01-09 14:41:30,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:41:30,289 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_amount25_file-89.i[915,928] [2025-01-09 14:41:30,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:41:30,337 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:41:30,347 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_amount25_file-89.i[915,928] [2025-01-09 14:41:30,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:41:30,379 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:41:30,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30 WrapperNode [2025-01-09 14:41:30,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:41:30,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:41:30,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:41:30,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:41:30,386 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:41:30" (1/1) ... [2025-01-09 14:41:30,392 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:41:30" (1/1) ... [2025-01-09 14:41:30,411 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-01-09 14:41:30,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:41:30,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:41:30,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:41:30,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:41:30,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,441 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:41:30,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:41:30,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:41:30,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:41:30,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:41:30,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (1/1) ... [2025-01-09 14:41:30,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:41:30,486 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:41:30,488 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:41:30,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:41:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:41:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:41:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:41:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:41:30,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:41:30,560 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:41:30,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:41:31,110 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:41:31,112 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:41:31,117 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:41:31,120 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:41:31,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:31 BoogieIcfgContainer [2025-01-09 14:41:31,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:41:31,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:41:31,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:41:31,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:41:31,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:41:30" (1/3) ... [2025-01-09 14:41:31,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c91d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:31, skipping insertion in model container [2025-01-09 14:41:31,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:30" (2/3) ... [2025-01-09 14:41:31,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c91d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:31, skipping insertion in model container [2025-01-09 14:41:31,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:31" (3/3) ... [2025-01-09 14:41:31,128 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-89.i [2025-01-09 14:41:31,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:41:31,139 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-89.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:41:31,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:41:31,187 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;@48941ecb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:41:31,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:41:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 14:41:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 14:41:31,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:41:31,199 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:41:31,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:41:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1860290552, now seen corresponding path program 1 times [2025-01-09 14:41:31,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:41:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328481415] [2025-01-09 14:41:31,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:31,211 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:41:31,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:41:31,214 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:41:31,215 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:41:31,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:41:31,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:41:31,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:31,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:41:31,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:41:31,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:41:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-09 14:41:31,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:41:31,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:41:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328481415] [2025-01-09 14:41:31,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328481415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:41:31,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:41:31,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:41:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45043630] [2025-01-09 14:41:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:41:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:41:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:41:31,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:41:31,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:41:31,473 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 14:41:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:41:31,493 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-01-09 14:41:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:41:31,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2025-01-09 14:41:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:41:31,517 INFO L225 Difference]: With dead ends: 100 [2025-01-09 14:41:31,517 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 14:41:31,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:41:31,521 INFO L435 NwaCegarLoop]: 71 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, 71 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:41:31,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:41:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 14:41:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 14:41:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 14:41:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-01-09 14:41:31,547 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 120 [2025-01-09 14:41:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:41:31,547 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-01-09 14:41:31,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 14:41:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-01-09 14:41:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 14:41:31,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:41:31,549 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,557 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:41:31,749 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:41:31,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:41:31,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:41:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash 14760702, now seen corresponding path program 1 times [2025-01-09 14:41:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:41:31,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129622978] [2025-01-09 14:41:31,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:31,751 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:41:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:41:31,754 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:41:31,755 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:41:31,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 14:41:31,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 14:41:31,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:31,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:41:31,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:41:31,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:42:27,599 WARN L286 SmtUtils]: Spent 23.37s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)