./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1b6679b66df394d112d70edcc29d7c1d17ec70623c6c663e910f39926affa591 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:33,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:33,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:04:33,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:33,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:33,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:33,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:33,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:33,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:33,284 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:33,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:33,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:33,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:33,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:33,284 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:33,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:33,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:33,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:33,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:04:33,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:33,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:33,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:33,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:33,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:33,287 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:33,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:33,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:33,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:33,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:33,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:33,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:33,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:33,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:33,289 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/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 -> 1b6679b66df394d112d70edcc29d7c1d17ec70623c6c663e910f39926affa591 [2025-03-04 00:04:33,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:33,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:33,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:33,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:33,545 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:33,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i [2025-03-04 00:04:34,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4c5c67a/e00b32233d0d468d94b110d7bd2720c0/FLAGdab4d041c [2025-03-04 00:04:34,985 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:34,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i [2025-03-04 00:04:34,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4c5c67a/e00b32233d0d468d94b110d7bd2720c0/FLAGdab4d041c [2025-03-04 00:04:35,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4c5c67a/e00b32233d0d468d94b110d7bd2720c0 [2025-03-04 00:04:35,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:35,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:35,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:35,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:35,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:35,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b739f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35, skipping insertion in model container [2025-03-04 00:04:35,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:35,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i[915,928] [2025-03-04 00:04:35,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:35,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:35,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i[915,928] [2025-03-04 00:04:35,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:35,496 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:35,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35 WrapperNode [2025-03-04 00:04:35,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:35,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:35,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:35,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:35,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,523 INFO L138 Inliner]: procedures = 26, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 53 [2025-03-04 00:04:35,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:35,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:35,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:35,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:35,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,546 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-03-04 00:04:35,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:35,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:35,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:35,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:35,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (1/1) ... [2025-03-04 00:04:35,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:35,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:04:35,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:35,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:35,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:35,648 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:35,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:35,763 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:35,763 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:35,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:35,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:35,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:35 BoogieIcfgContainer [2025-03-04 00:04:35,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:35,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:35,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:35,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:35,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:35" (1/3) ... [2025-03-04 00:04:35,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0e7d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:35, skipping insertion in model container [2025-03-04 00:04:35,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:35" (2/3) ... [2025-03-04 00:04:35,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0e7d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:35, skipping insertion in model container [2025-03-04 00:04:35,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:35" (3/3) ... [2025-03-04 00:04:35,780 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-42.i [2025-03-04 00:04:35,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:35,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-42.i that has 2 procedures, 24 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:35,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:35,857 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;@61f84314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:35,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 00:04:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 00:04:35,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:35,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:35,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:35,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1197274232, now seen corresponding path program 1 times [2025-03-04 00:04:35,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841426382] [2025-03-04 00:04:35,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:35,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 00:04:35,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 00:04:35,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:35,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 00:04:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:04:35,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841426382] [2025-03-04 00:04:35,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841426382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:04:35,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851371038] [2025-03-04 00:04:35,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:35,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:04:35,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:35,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:04:35,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:04:36,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 00:04:36,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 00:04:36,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:36,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:36,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:36,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 00:04:36,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:36,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851371038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:36,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:04:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:04:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305806039] [2025-03-04 00:04:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:36,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:04:36,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:36,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:36,109 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 00:04:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:36,122 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2025-03-04 00:04:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-04 00:04:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:36,128 INFO L225 Difference]: With dead ends: 42 [2025-03-04 00:04:36,128 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 00:04:36,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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-03-04 00:04:36,133 INFO L435 NwaCegarLoop]: 24 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, 24 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-03-04 00:04:36,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 00:04:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 00:04:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 00:04:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 00:04:36,158 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 27 [2025-03-04 00:04:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 00:04:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 00:04:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 00:04:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 00:04:36,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:36,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:36,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:04:36,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:04:36,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:36,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:36,361 INFO L85 PathProgramCache]: Analyzing trace with hash 488547353, now seen corresponding path program 1 times [2025-03-04 00:04:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:36,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891172630] [2025-03-04 00:04:36,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:36,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 00:04:36,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 00:04:36,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:36,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:36,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:04:36,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 00:04:36,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 00:04:36,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:36,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:36,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:04:36,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:04:36,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:36,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:04:36,461 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:04:36,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:36,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:36 BoogieIcfgContainer [2025-03-04 00:04:36,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:36,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:36,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:36,499 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:36,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:35" (3/4) ... [2025-03-04 00:04:36,501 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:04:36,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:36,502 INFO L158 Benchmark]: Toolchain (without parser) took 1189.18ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 57.0MB in the end (delta: 57.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 00:04:36,503 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:36,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.04ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:36,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.25ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 101.2MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:36,505 INFO L158 Benchmark]: Boogie Preprocessor took 31.21ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:36,506 INFO L158 Benchmark]: IcfgBuilder took 214.78ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 88.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:36,506 INFO L158 Benchmark]: TraceAbstraction took 724.77ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 57.5MB in the end (delta: 30.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 00:04:36,506 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 57.0MB in the end (delta: 490.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:36,507 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.04ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.25ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 101.2MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.21ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 214.78ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 88.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 724.77ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 57.5MB in the end (delta: 30.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 57.0MB in the end (delta: 490.7kB). 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 34, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 5; [L23] signed char var_1_7 = 32; [L24] signed char var_1_8 = 16; [L25] signed char var_1_9 = 32; [L26] float var_1_10 = 127.725; [L27] float var_1_11 = 2.2; VAL [isInitial=0, var_1_10=5109/40, var_1_11=11/5, var_1_1=5, var_1_7=32, var_1_8=16, var_1_9=32] [L54] isInitial = 1 [L55] FCALL initially() [L56] COND TRUE 1 [L57] FCALL updateLastVariables() [L58] CALL updateVariables() [L41] var_1_8 = __VERIFIER_nondet_char() [L42] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=5109/40, var_1_11=11/5, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5109/40, var_1_11=11/5, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L42] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=5109/40, var_1_11=11/5, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L43] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=5109/40, var_1_11=11/5, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5109/40, var_1_11=11/5, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L43] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=5109/40, var_1_11=11/5, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L44] var_1_11 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5109/40, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5109/40, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L45] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5109/40, var_1_1=5, var_1_7=32, var_1_8=126, var_1_9=32] [L58] RET updateVariables() [L59] CALL step() [L31] var_1_7 = var_1_8 [L32] var_1_9 = var_1_8 [L33] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=257, var_1_11=257, var_1_1=5, var_1_7=126, var_1_8=126, var_1_9=126] [L34] COND TRUE (var_1_10 * var_1_10) > var_1_10 [L35] var_1_1 = (var_1_7 + var_1_7) VAL [isInitial=1, var_1_10=257, var_1_11=257, var_1_1=252, var_1_7=126, var_1_8=126, var_1_9=126] [L59] RET step() [L60] CALL, EXPR property() [L50-L51] return (((((var_1_10 * var_1_10) > var_1_10) ? (var_1_1 == ((signed long int) (var_1_7 + var_1_7))) : (var_1_1 == ((signed long int) ((((var_1_7) > (5)) ? (var_1_7) : (5)))))) && (var_1_7 == ((signed char) var_1_8))) && (var_1_9 == ((signed char) var_1_8))) && (var_1_10 == ((float) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=257, var_1_11=257, var_1_1=252, var_1_7=126, var_1_8=126, var_1_9=126] [L60] RET, EXPR property() [L60] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=257, var_1_11=257, var_1_1=252, var_1_7=126, var_1_8=126, var_1_9=126] [L19] reach_error() VAL [isInitial=1, var_1_10=257, var_1_11=257, var_1_1=252, var_1_7=126, var_1_8=126, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 3, 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, 24 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, 24 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 52 SizeOfPredicates, 0 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 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-03-04 00:04:36,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1b6679b66df394d112d70edcc29d7c1d17ec70623c6c663e910f39926affa591 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:38,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:38,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:04:38,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:38,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:38,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:38,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:38,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:38,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:38,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:38,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:38,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:38,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:38,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:38,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:38,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:38,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:38,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:38,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:38,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:38,712 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/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 -> 1b6679b66df394d112d70edcc29d7c1d17ec70623c6c663e910f39926affa591 [2025-03-04 00:04:39,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:39,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:39,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:39,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:39,099 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:39,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i [2025-03-04 00:04:40,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770073939/433128a2cff54c0eb3cc8baebe0c2484/FLAG4ad23cfa8 [2025-03-04 00:04:40,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:40,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i [2025-03-04 00:04:40,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770073939/433128a2cff54c0eb3cc8baebe0c2484/FLAG4ad23cfa8 [2025-03-04 00:04:40,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770073939/433128a2cff54c0eb3cc8baebe0c2484 [2025-03-04 00:04:40,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:40,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:40,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:40,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:40,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:40,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:40" (1/1) ... [2025-03-04 00:04:40,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5898e8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:40, skipping insertion in model container [2025-03-04 00:04:40,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:40" (1/1) ... [2025-03-04 00:04:40,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:41,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i[915,928] [2025-03-04 00:04:41,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:41,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:41,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-42.i[915,928] [2025-03-04 00:04:41,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:41,100 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:41,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41 WrapperNode [2025-03-04 00:04:41,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:41,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:41,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:41,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:41,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,126 INFO L138 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 52 [2025-03-04 00:04:41,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:41,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:41,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:41,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:41,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,145 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-03-04 00:04:41,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:41,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:41,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:41,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:41,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (1/1) ... [2025-03-04 00:04:41,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:41,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:04:41,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:04:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:04:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:41,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:41,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:41,709 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:41,709 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:41,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:41,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:41,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:41 BoogieIcfgContainer [2025-03-04 00:04:41,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:41,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:41,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:41,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:41,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:40" (1/3) ... [2025-03-04 00:04:41,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb9e2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:41, skipping insertion in model container [2025-03-04 00:04:41,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:41" (2/3) ... [2025-03-04 00:04:41,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb9e2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:41, skipping insertion in model container [2025-03-04 00:04:41,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:41" (3/3) ... [2025-03-04 00:04:41,729 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-42.i [2025-03-04 00:04:41,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:41,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-42.i that has 2 procedures, 24 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:41,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:41,803 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;@6db1a76c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:41,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 00:04:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 00:04:41,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:41,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:41,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:41,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1197274232, now seen corresponding path program 1 times [2025-03-04 00:04:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245656374] [2025-03-04 00:04:41,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:41,828 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-03-04 00:04:41,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:41,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-04 00:04:41,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 00:04:41,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 00:04:41,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 00:04:41,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:41,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:41,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:41,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 00:04:42,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:42,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245656374] [2025-03-04 00:04:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245656374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:04:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116443892] [2025-03-04 00:04:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:42,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:42,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:42,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:42,023 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 00:04:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:42,035 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2025-03-04 00:04:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:42,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-04 00:04:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:42,041 INFO L225 Difference]: With dead ends: 42 [2025-03-04 00:04:42,042 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 00:04:42,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-03-04 00:04:42,046 INFO L435 NwaCegarLoop]: 24 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, 24 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-03-04 00:04:42,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 00:04:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 00:04:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 00:04:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 00:04:42,072 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 27 [2025-03-04 00:04:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 00:04:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 00:04:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 00:04:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 00:04:42,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:42,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:42,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 00:04:42,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-04 00:04:42,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:42,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash 488547353, now seen corresponding path program 1 times [2025-03-04 00:04:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:42,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153059134] [2025-03-04 00:04:42,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:42,279 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-03-04 00:04:42,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:42,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-04 00:04:42,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 00:04:42,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 00:04:42,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 00:04:42,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:42,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:42,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:04:42,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 00:04:47,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:47,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153059134] [2025-03-04 00:04:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153059134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:04:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060273072] [2025-03-04 00:04:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:47,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:04:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:47,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:04:47,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:04:47,246 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 00:04:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:52,138 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-03-04 00:04:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:04:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-04 00:04:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:52,145 INFO L225 Difference]: With dead ends: 35 [2025-03-04 00:04:52,145 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 00:04:52,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:04:52,146 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:52,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 00:04:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 00:04:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-03-04 00:04:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 00:04:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-03-04 00:04:52,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 27 [2025-03-04 00:04:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-03-04 00:04:52,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 00:04:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-03-04 00:04:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 00:04:52,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:52,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:52,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:04:52,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-04 00:04:52,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:52,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash 489470874, now seen corresponding path program 1 times [2025-03-04 00:04:52,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77099382] [2025-03-04 00:04:52,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:52,356 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-03-04 00:04:52,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:52,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-04 00:04:52,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:04:52,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 00:04:52,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 00:04:52,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:52,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:52,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:04:52,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 00:04:56,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:56,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77099382] [2025-03-04 00:04:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77099382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:04:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515775842] [2025-03-04 00:04:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:04:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:56,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:04:56,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:04:56,480 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 00:05:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:01,090 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-03-04 00:05:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:05:01,096 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-04 00:05:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:01,096 INFO L225 Difference]: With dead ends: 33 [2025-03-04 00:05:01,096 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:05:01,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:05:01,098 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:01,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 93 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:05:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:05:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:05:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:05:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:05:01,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2025-03-04 00:05:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:01,100 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:05:01,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 00:05:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:05:01,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:05:01,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:05:01,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:05:01,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-04 00:05:01,306 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:05:01,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:05:02,418 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:05:02,427 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:02,428 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:02,428 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:02,428 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:02,428 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:02,428 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:05:02,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:05:02 BoogieIcfgContainer [2025-03-04 00:05:02,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:05:02,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:05:02,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:05:02,429 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:05:02,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:41" (3/4) ... [2025-03-04 00:05:02,431 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:05:02,436 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:05:02,438 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:05:02,438 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:05:02,438 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:05:02,438 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:05:02,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:05:02,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:05:02,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:05:02,496 INFO L158 Benchmark]: Toolchain (without parser) took 21579.09ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 76.7MB in the end (delta: 15.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2025-03-04 00:05:02,497 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 35.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:02,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.03ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 80.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:02,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.51ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:02,497 INFO L158 Benchmark]: Boogie Preprocessor took 28.07ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:02,497 INFO L158 Benchmark]: IcfgBuilder took 562.27ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 65.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:02,498 INFO L158 Benchmark]: TraceAbstraction took 20707.44ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 82.4MB in the end (delta: -17.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2025-03-04 00:05:02,498 INFO L158 Benchmark]: Witness Printer took 66.86ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 76.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:02,499 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 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 35.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.03ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 80.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.51ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.07ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 562.27ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 65.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20707.44ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 82.4MB in the end (delta: -17.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 66.86ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 76.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 59 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 25, 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 365 SizeOfPredicates, 14 NumberOfNonLiveVariables, 171 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 00:05:02,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE