./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-11.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-11.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 6768dd66a63438b97c4000afe1975121b113cc0e56ca3e7c3bb97c4a3e086311 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:31:14,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:31:14,307 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:31:14,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:31:14,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:31:14,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:31:14,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:31:14,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:31:14,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:31:14,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:31:14,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:31:14,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:31:14,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:31:14,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:31:14,340 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:31:14,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:31:14,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:31:14,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:31:14,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:31:14,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:31:14,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:31:14,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:31:14,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:14,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:14,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:31:14,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:31:14,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:31:14,343 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 -> 6768dd66a63438b97c4000afe1975121b113cc0e56ca3e7c3bb97c4a3e086311 [2025-01-09 14:31:14,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:31:14,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:31:14,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:31:14,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:31:14,600 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:31:14,601 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-11.i [2025-01-09 14:31:15,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a09596511/5f12d3d7811e4c49b085a02644b0495a/FLAG96026c890 [2025-01-09 14:31:15,917 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:31:15,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-11.i [2025-01-09 14:31:15,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a09596511/5f12d3d7811e4c49b085a02644b0495a/FLAG96026c890 [2025-01-09 14:31:16,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a09596511/5f12d3d7811e4c49b085a02644b0495a [2025-01-09 14:31:16,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:31:16,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:31:16,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:16,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:31:16,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:31:16,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dc9e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16, skipping insertion in model container [2025-01-09 14:31:16,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:31:16,411 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-11.i[915,928] [2025-01-09 14:31:16,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:16,459 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:31:16,470 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-11.i[915,928] [2025-01-09 14:31:16,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:16,505 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:31:16,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16 WrapperNode [2025-01-09 14:31:16,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:16,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:16,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:31:16,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:31:16,512 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:31:16" (1/1) ... [2025-01-09 14:31:16,522 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:31:16" (1/1) ... [2025-01-09 14:31:16,544 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-01-09 14:31:16,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:16,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:31:16,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:31:16,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:31:16,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,566 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:31:16,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:31:16,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:31:16,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:31:16,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:31:16,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (1/1) ... [2025-01-09 14:31:16,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:16,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:16,613 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:31:16,615 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:31:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:31:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:31:16,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:31:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:31:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:31:16,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:31:16,673 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:31:16,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:31:16,812 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:31:16,812 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:31:16,820 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:31:16,820 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:31:16,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:16 BoogieIcfgContainer [2025-01-09 14:31:16,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:31:16,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:31:16,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:31:16,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:31:16,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:31:16" (1/3) ... [2025-01-09 14:31:16,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e001669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:16, skipping insertion in model container [2025-01-09 14:31:16,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:16" (2/3) ... [2025-01-09 14:31:16,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e001669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:16, skipping insertion in model container [2025-01-09 14:31:16,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:16" (3/3) ... [2025-01-09 14:31:16,830 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-11.i [2025-01-09 14:31:16,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:31:16,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-11.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:31:16,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:31:16,889 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;@402fc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:31:16,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:31:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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:31:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:31:16,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:16,903 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] [2025-01-09 14:31:16,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -121759721, now seen corresponding path program 1 times [2025-01-09 14:31:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:16,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461158000] [2025-01-09 14:31:16,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:16,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:31:17,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:31:17,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:17,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:17,120 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:31:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:17,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461158000] [2025-01-09 14:31:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461158000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:31:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233221463] [2025-01-09 14:31:17,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:17,123 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:31:17,124 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:31:17,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:31:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:31:17,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:17,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:17,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:31:17,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:17,264 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:31:17,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233221463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:17,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:31:17,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:31:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145844406] [2025-01-09 14:31:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:17,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:31:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:17,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:31:17,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:17,284 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:31:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:17,303 INFO L93 Difference]: Finished difference Result 106 states and 180 transitions. [2025-01-09 14:31:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:31:17,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 119 [2025-01-09 14:31:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:17,309 INFO L225 Difference]: With dead ends: 106 [2025-01-09 14:31:17,310 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 14:31:17,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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:31:17,316 INFO L435 NwaCegarLoop]: 78 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, 78 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:31:17,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:31:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 14:31:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 14:31:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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:31:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2025-01-09 14:31:17,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 119 [2025-01-09 14:31:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:17,355 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2025-01-09 14:31:17,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:31:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2025-01-09 14:31:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:31:17,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:17,359 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] [2025-01-09 14:31:17,368 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:31:17,564 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:31:17,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:17,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1500923107, now seen corresponding path program 1 times [2025-01-09 14:31:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:17,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267684773] [2025-01-09 14:31:17,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:17,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:31:17,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:31:17,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:17,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:31:17,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426333472] [2025-01-09 14:31:17,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:17,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:17,679 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:31:17,681 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:31:17,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:31:17,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:31:17,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:17,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:31:17,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:31:17,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:31:17,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:31:17,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:17,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:31:17,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:31:17,892 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:31:17,894 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:31:17,902 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:31:18,096 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:31:18,099 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:31:18,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:31:18,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:31:18 BoogieIcfgContainer [2025-01-09 14:31:18,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:31:18,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:31:18,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:31:18,171 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:31:18,172 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:16" (3/4) ... [2025-01-09 14:31:18,174 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:31:18,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:31:18,175 INFO L158 Benchmark]: Toolchain (without parser) took 1884.89ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 56.2MB in the end (delta: 102.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2025-01-09 14:31:18,176 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:18,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.86ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 146.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:31:18,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.99ms. Allocated memory is still 201.3MB. Free memory was 146.1MB in the beginning and 144.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:31:18,177 INFO L158 Benchmark]: Boogie Preprocessor took 45.13ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 142.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:18,177 INFO L158 Benchmark]: RCFGBuilder took 230.87ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 126.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:31:18,177 INFO L158 Benchmark]: TraceAbstraction took 1348.07ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 56.5MB in the end (delta: 69.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-09 14:31:18,177 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 201.3MB. Free memory was 56.5MB in the beginning and 56.2MB in the end (delta: 368.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:18,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.86ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 146.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.99ms. Allocated memory is still 201.3MB. Free memory was 146.1MB in the beginning and 144.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.13ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 142.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 230.87ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 126.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1348.07ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 56.5MB in the end (delta: 69.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 201.3MB. Free memory was 56.5MB in the beginning and 56.2MB in the end (delta: 368.2kB). 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 someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_7 = 10; [L27] float var_1_8 = 32.5; [L28] float var_1_9 = 1000000.7; [L29] float var_1_10 = 1.2; [L30] unsigned short int var_1_11 = 256; [L31] signed long int var_1_12 = -64; [L32] signed long int var_1_13 = -16; [L33] unsigned short int var_1_14 = 56281; [L34] unsigned short int var_1_15 = 32; [L35] float last_1_var_1_8 = 32.5; VAL [isInitial=0, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_2=203/4, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L102] isInitial = 1 [L103] FCALL initially() [L105] CALL updateLastVariables() [L95] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_2=203/4, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L65] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2, var_1_9=10000007/10] [L75] var_1_9 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L76] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L77] var_1_10 = __VERIFIER_nondet_float() [L78] 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, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L78] 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, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L79] var_1_12 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L80] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L81] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L86] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L86] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L87] var_1_14 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L89] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L89] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L90] var_1_15 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L92] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L92] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L106] RET updateVariables() [L107] CALL step() [L39] COND FALSE !(last_1_var_1_8 >= var_1_2) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L48] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L49] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L58] signed long int stepLocal_1 = var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))); VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, stepLocal_1=-16, var_1_11=256, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L59] COND TRUE stepLocal_1 < var_1_7 [L60] var_1_11 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_5 && var_1_6) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((last_1_var_1_8 >= var_1_2) ? (var_1_6 ? ((! var_1_5) ? (var_1_8 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && (((var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13)))) < var_1_7) ? (var_1_11 == ((unsigned short int) (var_1_14 - var_1_15))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=1, var_1_13=2, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 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, 78 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, 78 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 263 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:31:18,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-11.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 6768dd66a63438b97c4000afe1975121b113cc0e56ca3e7c3bb97c4a3e086311 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:31:20,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:31:20,128 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:31:20,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:31:20,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:31:20,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:31:20,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:31:20,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:31:20,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:31:20,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:31:20,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:31:20,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:31:20,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:31:20,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:31:20,164 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:31:20,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:31:20,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:31:20,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:20,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:20,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:31:20,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:31:20,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:31:20,167 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 -> 6768dd66a63438b97c4000afe1975121b113cc0e56ca3e7c3bb97c4a3e086311 [2025-01-09 14:31:20,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:31:20,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:31:20,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:31:20,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:31:20,437 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:31:20,438 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-11.i [2025-01-09 14:31:21,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76388b6ea/941ed43310444bdd868a61cf0de1849f/FLAG34d0f85b9 [2025-01-09 14:31:21,811 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:31:21,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-11.i [2025-01-09 14:31:21,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76388b6ea/941ed43310444bdd868a61cf0de1849f/FLAG34d0f85b9 [2025-01-09 14:31:22,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76388b6ea/941ed43310444bdd868a61cf0de1849f [2025-01-09 14:31:22,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:31:22,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:31:22,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:22,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:31:22,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:31:22,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38de72cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22, skipping insertion in model container [2025-01-09 14:31:22,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:31:22,285 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-11.i[915,928] [2025-01-09 14:31:22,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:22,333 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:31:22,340 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-11.i[915,928] [2025-01-09 14:31:22,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:22,370 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:31:22,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22 WrapperNode [2025-01-09 14:31:22,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:22,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:22,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:31:22,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:31:22,378 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:31:22" (1/1) ... [2025-01-09 14:31:22,388 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:31:22" (1/1) ... [2025-01-09 14:31:22,410 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-01-09 14:31:22,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:22,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:31:22,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:31:22,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:31:22,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:31:22" (1/1) ... [2025-01-09 14:31:22,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,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:31:22" (1/1) ... [2025-01-09 14:31:22,438 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:31:22,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:31:22,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:31:22,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:31:22,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:31:22,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (1/1) ... [2025-01-09 14:31:22,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:22,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:22,503 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:31:22,509 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:31:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:31:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:31:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:31:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:31:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:31:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:31:22,574 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:31:22,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:31:35,180 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:31:35,180 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:31:35,187 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:31:35,187 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:31:35,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:35 BoogieIcfgContainer [2025-01-09 14:31:35,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:31:35,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:31:35,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:31:35,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:31:35,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:31:22" (1/3) ... [2025-01-09 14:31:35,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5ec49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:35, skipping insertion in model container [2025-01-09 14:31:35,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:22" (2/3) ... [2025-01-09 14:31:35,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5ec49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:35, skipping insertion in model container [2025-01-09 14:31:35,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:35" (3/3) ... [2025-01-09 14:31:35,195 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-11.i [2025-01-09 14:31:35,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:31:35,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-11.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:31:35,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:31:35,266 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;@3f200f0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:31:35,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:31:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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:31:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:31:35,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:35,279 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] [2025-01-09 14:31:35,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:35,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:35,294 INFO L85 PathProgramCache]: Analyzing trace with hash -121759721, now seen corresponding path program 1 times [2025-01-09 14:31:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351764571] [2025-01-09 14:31:35,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:35,302 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:31:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:35,304 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:31:35,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 14:31:35,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:31:35,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:31:35,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:35,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:35,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:31:35,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-01-09 14:31:35,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:35,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:31:35,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351764571] [2025-01-09 14:31:35,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351764571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:35,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:35,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:31:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422846139] [2025-01-09 14:31:35,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:35,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:31:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:31:35,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:31:35,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:35,892 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 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.5) internal successors, (31), 2 states have internal predecessors, (31), 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:31:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:35,914 INFO L93 Difference]: Finished difference Result 106 states and 180 transitions. [2025-01-09 14:31:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:31:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 119 [2025-01-09 14:31:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:35,924 INFO L225 Difference]: With dead ends: 106 [2025-01-09 14:31:35,924 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 14:31:35,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:31:35,931 INFO L435 NwaCegarLoop]: 77 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, 77 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:31:35,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:31:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 14:31:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 14:31:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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:31:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-01-09 14:31:35,969 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 119 [2025-01-09 14:31:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:35,970 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-01-09 14:31:35,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:31:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-01-09 14:31:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:31:35,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:35,974 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] [2025-01-09 14:31:35,994 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:31:36,179 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:31:36,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:36,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1500923107, now seen corresponding path program 1 times [2025-01-09 14:31:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:36,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133776687] [2025-01-09 14:31:36,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:36,181 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:31:36,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:36,183 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:31:36,184 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:31:36,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:31:36,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:31:36,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:36,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:36,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:31:36,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:45,549 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:31:53,756 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:31:57,820 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2025-01-09 14:32:01,883 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true [2025-01-09 14:32:10,024 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:32:18,226 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:32:26,374 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:32:34,588 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:32:42,800 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:32:46,861 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2025-01-09 14:32:50,919 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true