./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:58:17,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:58:17,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:58:17,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:58:17,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:58:17,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:58:17,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:58:17,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:58:17,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:58:17,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:58:17,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:58:17,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:58:17,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:58:17,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:58:17,951 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:58:17,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:58:17,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:58:17,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:58:17,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:58:17,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:58:17,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:58:17,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:58:17,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:58:17,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:58:17,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:58:17,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:58:17,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:58:17,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:58:17,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:58:17,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:58:17,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:58:17,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:58:17,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:58:17,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:58:17,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:58:17,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:58:17,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:58:17,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:58:17,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:58:17,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:58:17,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:58:17,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:58:17,960 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-14 00:58:18,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:58:18,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:58:18,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:58:18,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:58:18,168 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:58:18,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2024-10-14 00:58:19,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:58:19,695 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:58:19,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2024-10-14 00:58:19,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf6a7f2b/f5db63a75a1e4041a47aae0505227f0e/FLAGe744cdad3 [2024-10-14 00:58:20,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf6a7f2b/f5db63a75a1e4041a47aae0505227f0e [2024-10-14 00:58:20,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:58:20,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:58:20,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:58:20,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:58:20,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:58:20,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526eb448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20, skipping insertion in model container [2024-10-14 00:58:20,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:58:20,269 WARN L248 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] [2024-10-14 00:58:20,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:58:20,284 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:58:20,309 WARN L248 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] [2024-10-14 00:58:20,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:58:20,327 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:58:20,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20 WrapperNode [2024-10-14 00:58:20,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:58:20,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:58:20,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:58:20,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:58:20,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,399 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2024-10-14 00:58:20,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:58:20,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:58:20,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:58:20,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:58:20,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,435 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]. [2024-10-14 00:58:20,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:58:20,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:58:20,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:58:20,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:58:20,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (1/1) ... [2024-10-14 00:58:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:58:20,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:58:20,478 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) [2024-10-14 00:58:20,480 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 [2024-10-14 00:58:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:58:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:58:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 00:58:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 00:58:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:58:20,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:58:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 00:58:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 00:58:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 00:58:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 00:58:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:58:20,578 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:58:20,582 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:58:20,720 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-14 00:58:20,720 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:58:20,739 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:58:20,739 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 00:58:20,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:58:20 BoogieIcfgContainer [2024-10-14 00:58:20,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:58:20,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:58:20,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:58:20,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:58:20,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:58:20" (1/3) ... [2024-10-14 00:58:20,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660b87ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:58:20, skipping insertion in model container [2024-10-14 00:58:20,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:20" (2/3) ... [2024-10-14 00:58:20,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660b87ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:58:20, skipping insertion in model container [2024-10-14 00:58:20,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:58:20" (3/3) ... [2024-10-14 00:58:20,745 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c.c [2024-10-14 00:58:20,758 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:58:20,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:58:20,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:58:20,828 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;@3b6ef01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:58:20,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:58:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 38 states have internal predecessors, (61), 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) [2024-10-14 00:58:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 00:58:20,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:20,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:20,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:20,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 904509171, now seen corresponding path program 1 times [2024-10-14 00:58:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:58:20,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451332326] [2024-10-14 00:58:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:58:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:58:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:58:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:58:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451332326] [2024-10-14 00:58:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451332326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:58:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:58:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:58:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852307438] [2024-10-14 00:58:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:58:20,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:58:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:58:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:58:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:58:20,968 INFO L87 Difference]: Start difference. First operand has 39 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 38 states have internal predecessors, (61), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-14 00:58:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:58:20,984 INFO L93 Difference]: Finished difference Result 77 states and 121 transitions. [2024-10-14 00:58:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:58:20,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-14 00:58:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:58:20,992 INFO L225 Difference]: With dead ends: 77 [2024-10-14 00:58:20,992 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 00:58:20,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:58:20,996 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:58:20,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:58:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 00:58:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 00:58:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 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) [2024-10-14 00:58:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2024-10-14 00:58:21,018 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 9 [2024-10-14 00:58:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:58:21,018 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2024-10-14 00:58:21,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-14 00:58:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2024-10-14 00:58:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 00:58:21,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:21,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:21,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:58:21,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:21,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -612412918, now seen corresponding path program 1 times [2024-10-14 00:58:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:58:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612155983] [2024-10-14 00:58:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:58:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:58:21,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 00:58:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:58:21,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 00:58:21,087 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 00:58:21,089 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:58:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:58:21,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 00:58:21,106 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:58:21,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:58:21 BoogieIcfgContainer [2024-10-14 00:58:21,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:58:21,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:58:21,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:58:21,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:58:21,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:58:20" (3/4) ... [2024-10-14 00:58:21,111 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 00:58:21,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:58:21,112 INFO L158 Benchmark]: Toolchain (without parser) took 993.23ms. Allocated memory is still 161.5MB. Free memory was 91.9MB in the beginning and 82.7MB in the end (delta: 9.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-14 00:58:21,113 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:58:21,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.19ms. Allocated memory is still 161.5MB. Free memory was 91.8MB in the beginning and 79.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 00:58:21,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.32ms. Allocated memory is still 161.5MB. Free memory was 79.4MB in the beginning and 132.2MB in the end (delta: -52.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-10-14 00:58:21,113 INFO L158 Benchmark]: Boogie Preprocessor took 44.94ms. Allocated memory is still 161.5MB. Free memory was 132.2MB in the beginning and 129.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 00:58:21,114 INFO L158 Benchmark]: RCFGBuilder took 292.56ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 111.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 00:58:21,114 INFO L158 Benchmark]: TraceAbstraction took 367.83ms. Allocated memory is still 161.5MB. Free memory was 111.2MB in the beginning and 83.3MB in the end (delta: 27.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 00:58:21,114 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 161.5MB. Free memory was 83.3MB in the beginning and 82.7MB in the end (delta: 608.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:58:21,118 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.36ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.19ms. Allocated memory is still 161.5MB. Free memory was 91.8MB in the beginning and 79.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.32ms. Allocated memory is still 161.5MB. Free memory was 79.4MB in the beginning and 132.2MB in the end (delta: -52.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.94ms. Allocated memory is still 161.5MB. Free memory was 132.2MB in the beginning and 129.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 292.56ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 111.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 367.83ms. Allocated memory is still 161.5MB. Free memory was 111.2MB in the beginning and 83.3MB in the end (delta: 27.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 161.5MB. Free memory was 83.3MB in the beginning and 82.7MB in the end (delta: 608.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 82]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someUnaryFLOAToperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L13] static const float huge_floor = 1.0e30; [L77] float x = -0.0f; [L78] CALL, EXPR floor_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [huge_floor=1000000000000000000000000000000] [L19] ieee_float_shape_type gf_u; [L20] gf_u.value = (x) [L21] EXPR gf_u.word [L21] (i0) = gf_u.word [L23] ix = (i0 & 0x7fffffff) [L24] j0 = (ix >> 23) - 0x7f VAL [huge_floor=1000000000000000000000000000000, i0=-8388608, ix=2139095040, j0=128, x=1000000000000000000000000000010] [L25] COND FALSE !(j0 < 23) VAL [huge_floor=1000000000000000000000000000000, i0=-8388608, ix=2139095040, x=1000000000000000000000000000010] [L45] COND TRUE !((ix) < 0x7f800000L) [L46] return x + x; VAL [huge_floor=1000000000000000000000000000000, i0=-8388608, x=1000000000000000000000000000010] [L78] RET, EXPR floor_float(x) [L78] float res = floor_float(x); [L81] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [huge_floor=1000000000000000000000000000000, res=1000000000000000000000000000009] [L81] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [huge_floor=1000000000000000000000000000000] [L81] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L82] reach_error() VAL [huge_floor=1000000000000000000000000000000, res=1000000000000000000000000000009] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 51 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 00:58:21,161 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/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:58:23,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:58:23,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 00:58:23,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:58:23,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:58:23,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:58:23,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:58:23,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:58:23,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:58:23,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:58:23,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:58:23,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:58:23,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:58:23,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:58:23,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:58:23,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:58:23,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:58:23,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:58:23,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:58:23,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:58:23,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:58:23,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:58:23,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:58:23,250 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 00:58:23,250 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 00:58:23,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:58:23,251 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 00:58:23,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:58:23,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:58:23,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:58:23,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:58:23,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:58:23,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:58:23,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:58:23,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:58:23,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:58:23,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:58:23,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:58:23,253 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 00:58:23,253 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 00:58:23,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:58:23,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:58:23,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:58:23,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:58:23,257 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 00:58:23,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-14 00:58:23,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:58:23,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:58:23,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:58:23,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:58:23,569 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:58:23,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2024-10-14 00:58:24,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:58:25,137 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:58:25,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2024-10-14 00:58:25,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98793dd5a/aa7dbf73c9244556acbca0acc60bb7e0/FLAG8c6ceb1a8 [2024-10-14 00:58:25,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98793dd5a/aa7dbf73c9244556acbca0acc60bb7e0 [2024-10-14 00:58:25,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:58:25,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:58:25,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:58:25,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:58:25,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:58:25,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1280c575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25, skipping insertion in model container [2024-10-14 00:58:25,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:58:25,782 WARN L248 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] [2024-10-14 00:58:25,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:58:25,800 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:58:25,822 WARN L248 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] [2024-10-14 00:58:25,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:58:25,842 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:58:25,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25 WrapperNode [2024-10-14 00:58:25,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:58:25,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:58:25,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:58:25,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:58:25,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,884 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2024-10-14 00:58:25,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:58:25,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:58:25,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:58:25,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:58:25,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,916 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]. [2024-10-14 00:58:25,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:58:25,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:58:25,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:58:25,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:58:25,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (1/1) ... [2024-10-14 00:58:25,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:58:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:58:25,971 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) [2024-10-14 00:58:25,976 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 [2024-10-14 00:58:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:58:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 00:58:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 00:58:26,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 00:58:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 00:58:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:58:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 00:58:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 00:58:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 00:58:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 00:58:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 00:58:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 00:58:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 00:58:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 00:58:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:58:26,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:58:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 00:58:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 00:58:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 00:58:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 00:58:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 00:58:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 00:58:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 00:58:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 00:58:26,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:58:26,119 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:58:26,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:58:26,478 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 00:58:26,479 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:58:26,503 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:58:26,504 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 00:58:26,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:58:26 BoogieIcfgContainer [2024-10-14 00:58:26,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:58:26,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:58:26,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:58:26,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:58:26,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:58:25" (1/3) ... [2024-10-14 00:58:26,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4845a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:58:26, skipping insertion in model container [2024-10-14 00:58:26,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:58:25" (2/3) ... [2024-10-14 00:58:26,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4845a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:58:26, skipping insertion in model container [2024-10-14 00:58:26,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:58:26" (3/3) ... [2024-10-14 00:58:26,513 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c.c [2024-10-14 00:58:26,525 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:58:26,525 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:58:26,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:58:26,574 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;@1631a5e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:58:26,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:58:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.72) internal successors, (43), 26 states have internal predecessors, (43), 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) [2024-10-14 00:58:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 00:58:26,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:26,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:26,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:26,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1673305909, now seen corresponding path program 1 times [2024-10-14 00:58:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:58:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019026741] [2024-10-14 00:58:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:26,598 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 [2024-10-14 00:58:26,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:58:26,600 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) [2024-10-14 00:58:26,601 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 [2024-10-14 00:58:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:58:26,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 00:58:26,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:58:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:58:26,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:58:26,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:58:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019026741] [2024-10-14 00:58:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019026741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:58:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:58:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:58:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619026353] [2024-10-14 00:58:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:58:26,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:58:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:58:26,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:58:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:58:26,703 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.72) internal successors, (43), 26 states have internal predecessors, (43), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-14 00:58:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:58:26,719 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2024-10-14 00:58:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:58:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-14 00:58:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:58:26,727 INFO L225 Difference]: With dead ends: 53 [2024-10-14 00:58:26,727 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 00:58:26,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:58:26,731 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:58:26,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:58:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 00:58:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 00:58:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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) [2024-10-14 00:58:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-14 00:58:26,752 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 9 [2024-10-14 00:58:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:58:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-14 00:58:26,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-14 00:58:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-14 00:58:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 00:58:26,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:26,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:26,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 00:58:26,957 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 [2024-10-14 00:58:26,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:26,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2130271498, now seen corresponding path program 1 times [2024-10-14 00:58:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:58:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74695052] [2024-10-14 00:58:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:26,976 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 [2024-10-14 00:58:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:58:26,978 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) [2024-10-14 00:58:26,998 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 [2024-10-14 00:58:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:58:27,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 00:58:27,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:58:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:58:27,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:58:27,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:58:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74695052] [2024-10-14 00:58:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74695052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:58:27,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:58:27,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:58:27,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738075590] [2024-10-14 00:58:27,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:58:27,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:58:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:58:27,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:58:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:58:27,164 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2024-10-14 00:58:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:58:27,306 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-10-14 00:58:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 00:58:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 [2024-10-14 00:58:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:58:27,307 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:58:27,307 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 00:58:27,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 00:58:27,308 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:58:27,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:58:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 00:58:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-10-14 00:58:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 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) [2024-10-14 00:58:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-14 00:58:27,311 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2024-10-14 00:58:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:58:27,311 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-14 00:58:27,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2024-10-14 00:58:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-10-14 00:58:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:58:27,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:27,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:27,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 00:58:27,515 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 [2024-10-14 00:58:27,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:27,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash -441447783, now seen corresponding path program 1 times [2024-10-14 00:58:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:58:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131418215] [2024-10-14 00:58:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:27,517 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 [2024-10-14 00:58:27,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:58:27,519 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) [2024-10-14 00:58:27,520 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 [2024-10-14 00:58:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:58:27,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 00:58:27,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:58:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:58:27,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:58:27,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:58:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131418215] [2024-10-14 00:58:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131418215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:58:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:58:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:58:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562186699] [2024-10-14 00:58:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:58:27,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:58:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:58:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:58:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:58:27,656 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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) [2024-10-14 00:58:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:58:27,682 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-10-14 00:58:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:58:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2024-10-14 00:58:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:58:27,683 INFO L225 Difference]: With dead ends: 31 [2024-10-14 00:58:27,683 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 00:58:27,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:58:27,684 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:58:27,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:58:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 00:58:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 00:58:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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) [2024-10-14 00:58:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-14 00:58:27,687 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2024-10-14 00:58:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:58:27,687 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-14 00:58:27,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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) [2024-10-14 00:58:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-14 00:58:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:58:27,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:27,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:27,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 00:58:27,888 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 [2024-10-14 00:58:27,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:27,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash 454069379, now seen corresponding path program 1 times [2024-10-14 00:58:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:58:27,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450748467] [2024-10-14 00:58:27,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:27,890 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 [2024-10-14 00:58:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:58:27,896 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) [2024-10-14 00:58:27,900 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 [2024-10-14 00:58:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:58:27,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 00:58:27,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:58:28,021 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 [2024-10-14 00:58:28,024 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 [2024-10-14 00:58:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:58:28,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:58:28,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:58:28,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450748467] [2024-10-14 00:58:28,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450748467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:58:28,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:58:28,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:58:28,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463108083] [2024-10-14 00:58:28,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:58:28,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:58:28,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:58:28,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:58:28,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:58:28,097 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-10-14 00:58:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:58:28,255 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-14 00:58:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 00:58:28,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-10-14 00:58:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:58:28,256 INFO L225 Difference]: With dead ends: 31 [2024-10-14 00:58:28,256 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 00:58:28,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 00:58:28,257 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:58:28,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:58:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 00:58:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 00:58:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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) [2024-10-14 00:58:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-10-14 00:58:28,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2024-10-14 00:58:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:58:28,261 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-10-14 00:58:28,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-10-14 00:58:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-10-14 00:58:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:58:28,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:28,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:28,269 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 (5)] Ended with exit code 0 [2024-10-14 00:58:28,462 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 [2024-10-14 00:58:28,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:28,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash -355277247, now seen corresponding path program 1 times [2024-10-14 00:58:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:58:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15822823] [2024-10-14 00:58:28,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:28,464 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 [2024-10-14 00:58:28,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:58:28,466 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) [2024-10-14 00:58:28,467 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 [2024-10-14 00:58:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:58:28,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 00:58:28,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:58:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:58:28,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:58:28,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:58:28,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15822823] [2024-10-14 00:58:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15822823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:58:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:58:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:58:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942434422] [2024-10-14 00:58:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:58:28,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:58:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:58:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:58:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:58:28,609 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-14 00:58:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:58:28,726 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2024-10-14 00:58:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 00:58:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2024-10-14 00:58:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:58:28,727 INFO L225 Difference]: With dead ends: 23 [2024-10-14 00:58:28,727 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 00:58:28,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:58:28,728 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:58:28,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:58:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 00:58:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 00:58:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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) [2024-10-14 00:58:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2024-10-14 00:58:28,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 16 [2024-10-14 00:58:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:58:28,731 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2024-10-14 00:58:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-14 00:58:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2024-10-14 00:58:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 00:58:28,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:58:28,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:58:28,737 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 (6)] Forceful destruction successful, exit code 0 [2024-10-14 00:58:28,932 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 [2024-10-14 00:58:28,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:58:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:58:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1767747648, now seen corresponding path program 1 times [2024-10-14 00:58:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:58:28,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74441913] [2024-10-14 00:58:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:58:28,935 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 [2024-10-14 00:58:28,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:58:28,936 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) [2024-10-14 00:58:28,938 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 [2024-10-14 00:58:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:58:29,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 00:58:29,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:58:29,039 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 [2024-10-14 00:58:29,041 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 [2024-10-14 00:58:29,119 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 [2024-10-14 00:58:29,122 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 [2024-10-14 00:58:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:58:29,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:58:29,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:58:29,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74441913] [2024-10-14 00:58:29,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74441913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:58:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:58:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 00:58:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062746481] [2024-10-14 00:58:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:58:29,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 00:58:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:58:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 00:58:29,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 00:58:29,188 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2024-10-14 00:58:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:58:29,326 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-10-14 00:58:29,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 00:58:29,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2024-10-14 00:58:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:58:29,327 INFO L225 Difference]: With dead ends: 20 [2024-10-14 00:58:29,327 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 00:58:29,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-14 00:58:29,328 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:58:29,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:58:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 00:58:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 00:58:29,329 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) [2024-10-14 00:58:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 00:58:29,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-10-14 00:58:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:58:29,330 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 00:58:29,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2024-10-14 00:58:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 00:58:29,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 00:58:29,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:58:29,342 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 [2024-10-14 00:58:29,533 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 [2024-10-14 00:58:29,536 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 00:58:29,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 00:58:29,572 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:58:29,580 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-14 00:58:29,581 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:58:29,581 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:58:29,581 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:58:29,582 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-14 00:58:29,582 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-14 00:58:29,583 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-14 00:58:29,583 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:58:29,583 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-14 00:58:29,583 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-14 00:58:29,583 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-14 00:58:29,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:58:29 BoogieIcfgContainer [2024-10-14 00:58:29,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:58:29,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:58:29,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:58:29,585 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:58:29,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:58:26" (3/4) ... [2024-10-14 00:58:29,588 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 00:58:29,594 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-14 00:58:29,594 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 00:58:29,594 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 00:58:29,594 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 00:58:29,662 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 00:58:29,662 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 00:58:29,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:58:29,662 INFO L158 Benchmark]: Toolchain (without parser) took 4110.68ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 33.9MB in the beginning and 59.3MB in the end (delta: -25.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:58:29,662 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:58:29,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.15ms. Allocated memory is still 73.4MB. Free memory was 33.6MB in the beginning and 42.4MB in the end (delta: -8.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-14 00:58:29,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:58:29,663 INFO L158 Benchmark]: Boogie Preprocessor took 60.28ms. Allocated memory is still 73.4MB. Free memory was 40.5MB in the beginning and 37.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:58:29,663 INFO L158 Benchmark]: RCFGBuilder took 558.53ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 37.9MB in the beginning and 65.5MB in the end (delta: -27.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 00:58:29,663 INFO L158 Benchmark]: TraceAbstraction took 3078.16ms. Allocated memory is still 96.5MB. Free memory was 65.0MB in the beginning and 64.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2024-10-14 00:58:29,663 INFO L158 Benchmark]: Witness Printer took 76.67ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 59.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 00:58:29,664 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.17ms. Allocated memory is still 73.4MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.15ms. Allocated memory is still 73.4MB. Free memory was 33.6MB in the beginning and 42.4MB in the end (delta: -8.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.28ms. Allocated memory is still 73.4MB. Free memory was 40.5MB in the beginning and 37.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 558.53ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 37.9MB in the beginning and 65.5MB in the end (delta: -27.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3078.16ms. Allocated memory is still 96.5MB. Free memory was 65.0MB in the beginning and 64.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 76.67ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 59.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. 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: 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 * 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 87 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 32, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 6 QuantifiedInterpolants, 496 SizeOfPredicates, 21 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 53 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-14 00:58:29,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE