./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1052c.c --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/float-newlib/float_req_bl_1052c.c -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 fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 12:03:41,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 12:03:41,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 12:03:41,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 12:03:41,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 12:03:42,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 12:03:42,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 12:03:42,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 12:03:42,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 12:03:42,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 12:03:42,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 12:03:42,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 12:03:42,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 12:03:42,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 12:03:42,019 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 12:03:42,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 12:03:42,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 12:03:42,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 12:03:42,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 12:03:42,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 12:03:42,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 12:03:42,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 12:03:42,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 12:03:42,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 12:03:42,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 12:03:42,021 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 12:03:42,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 12:03:42,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 12:03:42,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 12:03:42,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 12:03:42,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 12:03:42,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 12:03:42,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 12:03:42,022 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 -> fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b [2025-03-03 12:03:42,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 12:03:42,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 12:03:42,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 12:03:42,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 12:03:42,393 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 12:03:42,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2025-03-03 12:03:43,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99870d0ee/1e240773e0b649ada9b6f6a0e101b143/FLAG3a0e0eea4 [2025-03-03 12:03:44,250 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 12:03:44,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2025-03-03 12:03:44,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99870d0ee/1e240773e0b649ada9b6f6a0e101b143/FLAG3a0e0eea4 [2025-03-03 12:03:44,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99870d0ee/1e240773e0b649ada9b6f6a0e101b143 [2025-03-03 12:03:44,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 12:03:44,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 12:03:44,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 12:03:44,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 12:03:44,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 12:03:44,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f2765d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44, skipping insertion in model container [2025-03-03 12:03:44,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 12:03:44,493 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/float-newlib/float_req_bl_1052c.c[1741,1754] [2025-03-03 12:03:44,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 12:03:44,502 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 12:03:44,531 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/float-newlib/float_req_bl_1052c.c[1741,1754] [2025-03-03 12:03:44,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 12:03:44,552 INFO L204 MainTranslator]: Completed translation [2025-03-03 12:03:44,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44 WrapperNode [2025-03-03 12:03:44,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 12:03:44,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 12:03:44,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 12:03:44,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 12:03:44,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,626 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 129 [2025-03-03 12:03:44,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 12:03:44,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 12:03:44,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 12:03:44,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 12:03:44,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,672 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-03-03 12:03:44,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 12:03:44,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 12:03:44,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 12:03:44,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 12:03:44,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (1/1) ... [2025-03-03 12:03:44,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 12:03:44,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 12:03:44,747 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-03 12:03:44,752 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-03 12:03:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-03 12:03:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-03 12:03:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-03 12:03:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-03 12:03:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 12:03:44,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 12:03:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 12:03:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 12:03:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 12:03:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 12:03:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 12:03:44,871 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 12:03:44,873 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 12:03:45,050 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 12:03:45,051 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 12:03:45,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 12:03:45,074 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 12:03:45,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 12:03:45 BoogieIcfgContainer [2025-03-03 12:03:45,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 12:03:45,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 12:03:45,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 12:03:45,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 12:03:45,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 12:03:44" (1/3) ... [2025-03-03 12:03:45,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed40e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 12:03:45, skipping insertion in model container [2025-03-03 12:03:45,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:44" (2/3) ... [2025-03-03 12:03:45,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed40e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 12:03:45, skipping insertion in model container [2025-03-03 12:03:45,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 12:03:45" (3/3) ... [2025-03-03 12:03:45,083 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c.c [2025-03-03 12:03:45,094 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 12:03:45,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1052c.c that has 1 procedures, 45 locations, 1 initial locations, 3 loop locations, and 4 error locations. [2025-03-03 12:03:45,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 12:03:45,151 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;@2434bbe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 12:03:45,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-03 12:03:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 40 states have (on average 1.75) internal successors, (70), 44 states have internal predecessors, (70), 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-03 12:03:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-03 12:03:45,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 12:03:45,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-03 12:03:45,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-03 12:03:45,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 12:03:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash 110190, now seen corresponding path program 1 times [2025-03-03 12:03:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 12:03:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483732018] [2025-03-03 12:03:45,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 12:03:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 12:03:45,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-03 12:03:45,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-03 12:03:45,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:45,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 12:03:45,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 12:03:45,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-03 12:03:45,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-03 12:03:45,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:45,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 12:03:45,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 12:03:45,302 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 12:03:45,306 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONUNSUPPORTED_FEATURE (3 of 4 remaining) [2025-03-03 12:03:45,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-03 12:03:45,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 4 remaining) [2025-03-03 12:03:45,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 4 remaining) [2025-03-03 12:03:45,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 12:03:45,316 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-03 12:03:45,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 12:03:45,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 12:03:45 BoogieIcfgContainer [2025-03-03 12:03:45,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 12:03:45,335 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 12:03:45,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 12:03:45,340 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 12:03:45,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 12:03:45" (3/4) ... [2025-03-03 12:03:45,342 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 12:03:45,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 12:03:45,344 INFO L158 Benchmark]: Toolchain (without parser) took 1062.33ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 71.8MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 12:03:45,347 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 12:03:45,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.22ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 103.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 12:03:45,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.49ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 102.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 12:03:45,348 INFO L158 Benchmark]: Boogie Preprocessor took 68.64ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 100.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 12:03:45,348 INFO L158 Benchmark]: IcfgBuilder took 378.35ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 84.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 12:03:45,348 INFO L158 Benchmark]: TraceAbstraction took 258.89ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 71.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 12:03:45,348 INFO L158 Benchmark]: Witness Printer took 7.82ms. Allocated memory is still 142.6MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 12:03:45,349 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.22ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 103.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.49ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 102.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.64ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 100.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 378.35ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 84.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 258.89ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 71.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 7.82ms. Allocated memory is still 142.6MB. Free memory is still 71.8MB. 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 there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 19, overapproximation of someUnaryFLOAToperation at line 77. Possible FailurePath: [L13] static const float huge_floor = 1.0e30; VAL [huge_floor=1000000000000000000000000000000] [L77] float x = -0.0f; [L78] CALL floor_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [huge_floor=1000000000000000000000000000000, x=1000000000000000000000000000005] [L19] ieee_float_shape_type gf_u; VAL [huge_floor=1000000000000000000000000000000, x=1000000000000000000000000000005] - UnprovableResult [Line: 82]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-03 12:03:45,393 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/float-newlib/float_req_bl_1052c.c -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 fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 12:03:47,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 12:03:47,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 12:03:47,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 12:03:47,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 12:03:47,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 12:03:47,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 12:03:47,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 12:03:47,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 12:03:47,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 12:03:47,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 12:03:47,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 12:03:47,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 12:03:47,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 12:03:47,604 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 12:03:47,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 12:03:47,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 12:03:47,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 12:03:47,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 12:03:47,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 12:03:47,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 12:03:47,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 12:03:47,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 12:03:47,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 12:03:47,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 12:03:47,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 12:03:47,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 12:03:47,606 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 -> fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b [2025-03-03 12:03:47,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 12:03:47,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 12:03:47,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 12:03:47,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 12:03:47,852 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 12:03:47,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2025-03-03 12:03:49,001 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680cb3922/4bd571629d954ab9a19a26faeb52a20d/FLAGd025cbfa9 [2025-03-03 12:03:49,190 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 12:03:49,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2025-03-03 12:03:49,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680cb3922/4bd571629d954ab9a19a26faeb52a20d/FLAGd025cbfa9 [2025-03-03 12:03:49,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680cb3922/4bd571629d954ab9a19a26faeb52a20d [2025-03-03 12:03:49,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 12:03:49,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 12:03:49,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 12:03:49,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 12:03:49,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 12:03:49,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e291be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49, skipping insertion in model container [2025-03-03 12:03:49,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 12:03:49,349 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/float-newlib/float_req_bl_1052c.c[1741,1754] [2025-03-03 12:03:49,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 12:03:49,358 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 12:03:49,378 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/float-newlib/float_req_bl_1052c.c[1741,1754] [2025-03-03 12:03:49,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 12:03:49,398 INFO L204 MainTranslator]: Completed translation [2025-03-03 12:03:49,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49 WrapperNode [2025-03-03 12:03:49,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 12:03:49,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 12:03:49,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 12:03:49,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 12:03:49,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,436 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-03-03 12:03:49,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 12:03:49,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 12:03:49,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 12:03:49,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 12:03:49,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,465 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-03-03 12:03:49,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 12:03:49,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 12:03:49,488 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 12:03:49,488 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 12:03:49,489 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (1/1) ... [2025-03-03 12:03:49,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 12:03:49,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 12:03:49,517 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-03 12:03:49,519 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-03 12:03:49,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 12:03:49,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-03 12:03:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 12:03:49,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 12:03:49,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 12:03:49,940 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 12:03:49,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 12:03:49,946 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 12:03:49,946 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 12:03:49,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 12:03:49 BoogieIcfgContainer [2025-03-03 12:03:49,947 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 12:03:49,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 12:03:49,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 12:03:49,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 12:03:49,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 12:03:49" (1/3) ... [2025-03-03 12:03:49,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557d7828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 12:03:49, skipping insertion in model container [2025-03-03 12:03:49,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 12:03:49" (2/3) ... [2025-03-03 12:03:49,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557d7828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 12:03:49, skipping insertion in model container [2025-03-03 12:03:49,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 12:03:49" (3/3) ... [2025-03-03 12:03:49,953 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c.c [2025-03-03 12:03:49,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 12:03:49,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1052c.c that has 1 procedures, 30 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 12:03:49,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 12:03:50,007 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;@3bb862eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 12:03:50,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 12:03:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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-03 12:03:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 12:03:50,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 12:03:50,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 12:03:50,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 12:03:50,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 12:03:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash -17321290, now seen corresponding path program 1 times [2025-03-03 12:03:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 12:03:50,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705553703] [2025-03-03 12:03:50,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 12:03:50,028 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-03 12:03:50,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 12:03:50,034 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-03 12:03:50,035 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-03 12:03:50,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 12:03:50,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 12:03:50,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:50,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 12:03:50,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 12:03:50,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 12:03:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 12:03:50,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 12:03:50,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 12:03:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705553703] [2025-03-03 12:03:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705553703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 12:03:50,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 12:03:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 12:03:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944042896] [2025-03-03 12:03:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 12:03:50,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 12:03:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 12:03:50,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 12:03:50,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 12:03:50,174 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03 12:03:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 12:03:50,185 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2025-03-03 12:03:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 12:03:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2025-03-03 12:03:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 12:03:50,193 INFO L225 Difference]: With dead ends: 58 [2025-03-03 12:03:50,193 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 12:03:50,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-03 12:03:50,197 INFO L435 NwaCegarLoop]: 39 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, 39 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-03 12:03:50,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 12:03:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 12:03:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 12:03:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-03 12:03:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-03-03 12:03:50,217 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2025-03-03 12:03:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 12:03:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-03 12:03:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03 12:03:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2025-03-03 12:03:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 12:03:50,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 12:03:50,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 12:03:50,223 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 (2)] Forceful destruction successful, exit code 0 [2025-03-03 12:03:50,419 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-03 12:03:50,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 12:03:50,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 12:03:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1485373034, now seen corresponding path program 1 times [2025-03-03 12:03:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 12:03:50,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089135553] [2025-03-03 12:03:50,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 12:03:50,420 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-03 12:03:50,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 12:03:50,422 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-03 12:03:50,424 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-03 12:03:50,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 12:03:50,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 12:03:50,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:50,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 12:03:50,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 12:03:50,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 12:03:50,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 12:03:50,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-03 12:03:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 12:03:50,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 12:03:50,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 12:03:50,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089135553] [2025-03-03 12:03:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089135553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 12:03:50,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 12:03:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 12:03:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349470168] [2025-03-03 12:03:50,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 12:03:50,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 12:03:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 12:03:50,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 12:03:50,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 12:03:50,641 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-03 12:03:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 12:03:50,796 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-03-03 12:03:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 12:03:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2025-03-03 12:03:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 12:03:50,797 INFO L225 Difference]: With dead ends: 43 [2025-03-03 12:03:50,797 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 12:03:50,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 12:03:50,798 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 12:03:50,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 49 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 12:03:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 12:03:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-03-03 12:03:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-03 12:03:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-03 12:03:50,800 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2025-03-03 12:03:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 12:03:50,800 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-03 12:03:50,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-03 12:03:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-03 12:03:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 12:03:50,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 12:03:50,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 12:03:50,805 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 (3)] Forceful destruction successful, exit code 0 [2025-03-03 12:03:51,001 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-03 12:03:51,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 12:03:51,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 12:03:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -252034560, now seen corresponding path program 1 times [2025-03-03 12:03:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 12:03:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707521904] [2025-03-03 12:03:51,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 12:03:51,002 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-03 12:03:51,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 12:03:51,005 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-03 12:03:51,006 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-03 12:03:51,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 12:03:51,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 12:03:51,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:51,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 12:03:51,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 12:03:51,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 12:03:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 12:03:51,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 12:03:51,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 12:03:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707521904] [2025-03-03 12:03:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707521904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 12:03:51,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 12:03:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 12:03:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897798778] [2025-03-03 12:03:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 12:03:51,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 12:03:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 12:03:51,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 12:03:51,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 12:03:51,183 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-03 12:03:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 12:03:51,219 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-03-03 12:03:51,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 12:03:51,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-03-03 12:03:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 12:03:51,219 INFO L225 Difference]: With dead ends: 34 [2025-03-03 12:03:51,219 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 12:03:51,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 12:03:51,220 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 12:03:51,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 12:03:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 12:03:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 12:03:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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-03 12:03:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-03 12:03:51,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2025-03-03 12:03:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 12:03:51,222 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-03 12:03:51,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-03 12:03:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-03 12:03:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 12:03:51,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 12:03:51,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 12:03:51,227 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 (4)] Ended with exit code 0 [2025-03-03 12:03:51,423 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-03 12:03:51,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 12:03:51,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 12:03:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -776393629, now seen corresponding path program 1 times [2025-03-03 12:03:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 12:03:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176140591] [2025-03-03 12:03:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 12:03:51,424 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-03 12:03:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 12:03:51,427 INFO L229 MonitoredProcess]: Starting monitored process 5 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-03 12:03:51,429 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 (5)] Waiting until timeout for monitored process [2025-03-03 12:03:51,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 12:03:51,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 12:03:51,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:51,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 12:03:51,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 12:03:51,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 12:03:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 12:03:51,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 12:03:51,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 12:03:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176140591] [2025-03-03 12:03:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176140591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 12:03:51,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 12:03:51,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 12:03:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115087838] [2025-03-03 12:03:51,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 12:03:51,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 12:03:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 12:03:51,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 12:03:51,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 12:03:51,603 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03 12:03:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 12:03:51,674 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-03 12:03:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 12:03:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2025-03-03 12:03:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 12:03:51,677 INFO L225 Difference]: With dead ends: 34 [2025-03-03 12:03:51,677 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 12:03:51,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 12:03:51,678 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 12:03:51,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 44 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 12:03:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 12:03:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 12:03:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-03 12:03:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-03-03 12:03:51,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2025-03-03 12:03:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 12:03:51,683 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-03-03 12:03:51,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03 12:03:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2025-03-03 12:03:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 12:03:51,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 12:03:51,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 12:03:51,700 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 (5)] Forceful destruction successful, exit code 0 [2025-03-03 12:03:51,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-03 12:03:51,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 12:03:51,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 12:03:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 966416706, now seen corresponding path program 1 times [2025-03-03 12:03:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 12:03:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351689460] [2025-03-03 12:03:51,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 12:03:51,885 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-03 12:03:51,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 12:03:51,887 INFO L229 MonitoredProcess]: Starting monitored process 6 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-03 12:03:51,888 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 (6)] Waiting until timeout for monitored process [2025-03-03 12:03:51,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 12:03:51,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 12:03:51,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:51,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 12:03:51,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 12:03:51,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 12:03:51,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 12:03:52,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-03 12:03:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 12:03:52,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 12:03:52,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 12:03:52,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351689460] [2025-03-03 12:03:52,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351689460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 12:03:52,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 12:03:52,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 12:03:52,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313276615] [2025-03-03 12:03:52,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 12:03:52,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 12:03:52,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 12:03:52,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 12:03:52,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 12:03:52,063 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03 12:03:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 12:03:52,154 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2025-03-03 12:03:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 12:03:52,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) Word has length 17 [2025-03-03 12:03:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 12:03:52,155 INFO L225 Difference]: With dead ends: 25 [2025-03-03 12:03:52,155 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 12:03:52,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 12:03:52,156 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 12:03:52,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 12:03:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 12:03:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 12:03:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 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-03 12:03:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2025-03-03 12:03:52,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2025-03-03 12:03:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 12:03:52,159 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2025-03-03 12:03:52,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03 12:03:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2025-03-03 12:03:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 12:03:52,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 12:03:52,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 12:03:52,167 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 (6)] Ended with exit code 0 [2025-03-03 12:03:52,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-03 12:03:52,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 12:03:52,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 12:03:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1617014626, now seen corresponding path program 1 times [2025-03-03 12:03:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 12:03:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037353446] [2025-03-03 12:03:52,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 12:03:52,364 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-03 12:03:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 12:03:52,366 INFO L229 MonitoredProcess]: Starting monitored process 7 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-03 12:03:52,366 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 (7)] Waiting until timeout for monitored process [2025-03-03 12:03:52,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 12:03:52,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 12:03:52,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 12:03:52,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 12:03:52,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 12:03:52,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 12:03:52,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 12:03:52,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-03 12:03:52,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 12:03:52,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-03 12:03:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 12:03:52,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 12:03:52,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 12:03:52,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037353446] [2025-03-03 12:03:52,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037353446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 12:03:52,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 12:03:52,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 12:03:52,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796712224] [2025-03-03 12:03:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 12:03:52,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 12:03:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 12:03:52,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 12:03:52,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 12:03:52,671 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-03 12:03:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 12:03:52,841 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2025-03-03 12:03:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 12:03:52,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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) Word has length 21 [2025-03-03 12:03:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 12:03:52,842 INFO L225 Difference]: With dead ends: 22 [2025-03-03 12:03:52,842 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 12:03:52,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-03 12:03:52,843 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 12:03:52,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 55 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 12:03:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 12:03:52,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 12:03:52,845 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-03 12:03:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 12:03:52,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2025-03-03 12:03:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 12:03:52,846 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 12:03:52,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-03 12:03:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 12:03:52,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 12:03:52,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 12:03:52,854 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 (7)] Ended with exit code 0 [2025-03-03 12:03:53,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-03 12:03:53,053 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 12:03:53,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 12:03:53,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 12:03:53,100 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2025-03-03 12:03:53,101 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 12:03:53,101 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 12:03:53,101 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 12:03:53,101 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 12:03:53,101 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2025-03-03 12:03:53,101 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 12:03:53,101 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 12:03:53,102 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2025-03-03 12:03:53,102 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-03 12:03:53,102 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2025-03-03 12:03:53,102 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 12:03:53,102 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 12:03:53,102 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 12:03:53,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 12:03:53 BoogieIcfgContainer [2025-03-03 12:03:53,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 12:03:53,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 12:03:53,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 12:03:53,103 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 12:03:53,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 12:03:49" (3/4) ... [2025-03-03 12:03:53,105 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 12:03:53,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-03 12:03:53,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-03 12:03:53,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 12:03:53,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 12:03:53,165 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 12:03:53,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 12:03:53,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 12:03:53,166 INFO L158 Benchmark]: Toolchain (without parser) took 3948.89ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 61.5MB in the end (delta: 31.5MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-03-03 12:03:53,166 INFO L158 Benchmark]: CDTParser took 1.84ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 12:03:53,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.85ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 80.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 12:03:53,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.11ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 12:03:53,167 INFO L158 Benchmark]: Boogie Preprocessor took 43.96ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 12:03:53,167 INFO L158 Benchmark]: IcfgBuilder took 459.28ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 63.2MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 12:03:53,167 INFO L158 Benchmark]: TraceAbstraction took 3154.15ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 67.3MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 12:03:53,167 INFO L158 Benchmark]: Witness Printer took 62.77ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 61.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 12:03:53,168 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.84ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.85ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 80.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.11ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.96ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 459.28ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 63.2MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3154.15ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 67.3MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.77ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 61.5MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 - 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: 82]: 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 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 266 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 111 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 34, 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 85 ConstructedInterpolants, 6 QuantifiedInterpolants, 515 SizeOfPredicates, 21 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-03 12:03:53,188 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