./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1252a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1252a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f441bd4a1f5705911b7315c074b39e665542818e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1252a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f441bd4a1f5705911b7315c074b39e665542818e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:07:26,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:07:26,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:07:26,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:07:26,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:07:26,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:07:26,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:07:26,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:07:26,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:07:26,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:07:26,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:07:26,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:07:26,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:07:26,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:07:26,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:07:26,666 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:07:26,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:07:26,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:07:26,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:07:26,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:07:26,670 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:07:26,671 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:07:26,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:07:26,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:07:26,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:07:26,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:07:26,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:07:26,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:07:26,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:07:26,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:07:26,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:07:26,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:07:26,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:07:26,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:07:26,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:07:26,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:07:26,677 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:07:26,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:07:26,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:07:26,685 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:07:26,685 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:07:26,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:07:26,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:07:26,686 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:07:26,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:07:26,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:07:26,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:07:26,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:07:26,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:07:26,686 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:07:26,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:07:26,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:07:26,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:07:26,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:07:26,687 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:07:26,687 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:07:26,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:07:26,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:07:26,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:07:26,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:07:26,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:07:26,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:07:26,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:07:26,688 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:07:26,688 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:07:26,688 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:07:26,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:07:26,689 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(__VERIFIER_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 -> f441bd4a1f5705911b7315c074b39e665542818e [2018-11-23 02:07:26,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:07:26,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:07:26,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:07:26,725 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:07:26,725 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:07:26,726 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1252a_true-unreach-call.c [2018-11-23 02:07:26,770 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/db37bb447/de3c4d96e2e14b01bbbf1fba81da76c4/FLAGbcdfdddff [2018-11-23 02:07:27,172 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:07:27,173 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/sv-benchmarks/c/float-newlib/float_req_bl_1252a_true-unreach-call.c [2018-11-23 02:07:27,177 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/db37bb447/de3c4d96e2e14b01bbbf1fba81da76c4/FLAGbcdfdddff [2018-11-23 02:07:27,190 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/db37bb447/de3c4d96e2e14b01bbbf1fba81da76c4 [2018-11-23 02:07:27,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:07:27,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:07:27,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:07:27,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:07:27,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:07:27,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd40f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27, skipping insertion in model container [2018-11-23 02:07:27,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:07:27,226 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:07:27,343 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:07:27,345 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:07:27,359 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:07:27,371 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:07:27,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27 WrapperNode [2018-11-23 02:07:27,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:07:27,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:07:27,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:07:27,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:07:27,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:07:27,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:07:27,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:07:27,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:07:27,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... [2018-11-23 02:07:27,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:07:27,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:07:27,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:07:27,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:07:27,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:07:27,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:07:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:07:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:07:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:07:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:07:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:07:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:07:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:07:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:07:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-23 02:07:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-23 02:07:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 02:07:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 02:07:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 02:07:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 02:07:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:07:27,656 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:07:27,657 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 02:07:27,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:27 BoogieIcfgContainer [2018-11-23 02:07:27,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:07:27,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:07:27,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:07:27,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:07:27,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:07:27" (1/3) ... [2018-11-23 02:07:27,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b447a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:07:27, skipping insertion in model container [2018-11-23 02:07:27,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:27" (2/3) ... [2018-11-23 02:07:27,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b447a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:07:27, skipping insertion in model container [2018-11-23 02:07:27,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:27" (3/3) ... [2018-11-23 02:07:27,663 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252a_true-unreach-call.c [2018-11-23 02:07:27,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:07:27,678 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:07:27,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:07:27,709 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:07:27,709 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:07:27,709 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:07:27,709 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:07:27,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:07:27,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:07:27,710 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:07:27,710 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:07:27,710 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:07:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 02:07:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:07:27,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:27,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:27,727 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:27,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -278474869, now seen corresponding path program 1 times [2018-11-23 02:07:27,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:07:27,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:07:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:27,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:07:27,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:27,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:07:27,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:07:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:07:27,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:07:27,834 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-23 02:07:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:27,848 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2018-11-23 02:07:27,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:07:27,849 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 02:07:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:27,854 INFO L225 Difference]: With dead ends: 79 [2018-11-23 02:07:27,855 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 02:07:27,857 INFO L631 BasicCegarLoop]: 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 [2018-11-23 02:07:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 02:07:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 02:07:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 02:07:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 02:07:27,881 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2018-11-23 02:07:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:27,881 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 02:07:27,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:07:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 02:07:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:07:27,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:27,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:27,884 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:27,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash -428418178, now seen corresponding path program 1 times [2018-11-23 02:07:27,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:07:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:07:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:27,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:07:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:07:27,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:07:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:07:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:27,947 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 02:07:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:27,969 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 02:07:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:07:27,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 02:07:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:27,971 INFO L225 Difference]: With dead ends: 59 [2018-11-23 02:07:27,971 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 02:07:27,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 02:07:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 02:07:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 02:07:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 02:07:27,979 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2018-11-23 02:07:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:27,979 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 02:07:27,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:07:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 02:07:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:07:27,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:27,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:27,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:27,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 328113906, now seen corresponding path program 1 times [2018-11-23 02:07:27,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:07:27,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:07:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:27,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:07:28,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:28,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:07:28,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:07:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:07:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:28,033 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-23 02:07:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:28,055 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 02:07:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:07:28,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 02:07:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:28,056 INFO L225 Difference]: With dead ends: 63 [2018-11-23 02:07:28,056 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 02:07:28,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 02:07:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 02:07:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 02:07:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 02:07:28,061 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2018-11-23 02:07:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:28,061 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 02:07:28,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:07:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 02:07:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:07:28,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:28,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:28,062 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:28,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1468837453, now seen corresponding path program 1 times [2018-11-23 02:07:28,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:07:28,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:07:28,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:28,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:28,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:07:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:07:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:07:28,105 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4286578695, |#NULL.offset|=4286578690, |old(#NULL.base)|=4286578695, |old(#NULL.offset)|=4286578690] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4286578695, |old(#NULL.offset)|=4286578690] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4286578695, |old(#NULL.offset)|=4286578690] [?] RET #90#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someUnaryFLOAToperation(0.0);~y~0 := 0.0; VAL [main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=4286578691.0, |fmax_float_#in~y|=0.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_float_~x=4286578691.0, fmax_float_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=4286578691.0, |fmax_float_#in~y|=0.0] [?] CALL call #t~ret2 := __fpclassify_float(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0] [?] ~x := #in~x;havoc ~w~0; VAL [__fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [__fpclassify_float_~w~0=4286578689, __fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0] [?] goto; VAL [__fpclassify_float_~w~0=4286578689, __fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0] [?] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [__fpclassify_float_~w~0=4286578689, __fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0] [?] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [__fpclassify_float_~w~0=4286578689, __fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0] [?] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [__fpclassify_float_~w~0=4286578689, __fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0] [?] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296);#res := 0; VAL [__fpclassify_float_~w~0=4286578689, __fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0, |__fpclassify_float_#res|=0] [?] assume true; VAL [__fpclassify_float_~w~0=4286578689, __fpclassify_float_~x=4286578691.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=4286578691.0, |__fpclassify_float_#res|=0] [?] RET #98#return; VAL [fmax_float_~x=4286578691.0, fmax_float_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=4286578691.0, |fmax_float_#in~y|=0.0, |fmax_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmax_float_~x=4286578691.0, fmax_float_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=4286578691.0, |fmax_float_#in~y|=0.0, |fmax_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmax_float_~x=4286578691.0, fmax_float_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=4286578691.0, |fmax_float_#in~y|=0.0, |fmax_float_#res|=0.0] [?] assume true; VAL [fmax_float_~x=4286578691.0, fmax_float_~y=0.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=4286578691.0, |fmax_float_#in~y|=0.0, |fmax_float_#res|=0.0] [?] RET #94#return; VAL [main_~x~0=4286578691.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0.0] [?] ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [main_~res~0=0.0, main_~x~0=4286578691.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short9|=false] [?] assume !#t~short9; VAL [main_~res~0=0.0, main_~x~0=4286578691.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short9|=false] [?] assume !#t~short9;havoc #t~ret8;havoc #t~short9; VAL [main_~res~0=0.0, main_~x~0=4286578691.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=0.0, main_~x~0=4286578691.0, main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4286578695, #NULL.offset=4286578690, old(#NULL.base)=4286578695, old(#NULL.offset)=4286578690] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4286578695, old(#NULL.offset)=4286578690] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4286578695, old(#NULL.offset)=4286578690] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L72] ~x~0 := ~someUnaryFLOAToperation(0.0); [L73] ~y~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~y~0=0.0] [L75] CALL call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, ~x=4.286578691E9, ~y=0.0] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~x=4.286578691E9] [L23] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L24] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] ~w~0 := #t~mem0; [L25] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L23] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L23] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L28-L39] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L30-L39] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L33-L39] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L36-L39] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L39] #res := 0; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L19-L40] ensures true; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43-L45] assume 0 == #t~ret2; [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L42-L51] ensures true; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L75] RET call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L75] ~res~0 := #t~ret7; [L75] havoc #t~ret7; [L78] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] assume !#t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78-L81] assume !#t~short9; [L78] havoc #t~ret8; [L78] havoc #t~short9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L79] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4286578695, #NULL.offset=4286578690, old(#NULL.base)=4286578695, old(#NULL.offset)=4286578690] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4286578695, old(#NULL.offset)=4286578690] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4286578695, old(#NULL.offset)=4286578690] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L72] ~x~0 := ~someUnaryFLOAToperation(0.0); [L73] ~y~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~y~0=0.0] [L75] CALL call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, ~x=4.286578691E9, ~y=0.0] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~x=4.286578691E9] [L23] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L24] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] ~w~0 := #t~mem0; [L25] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L23] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L23] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L28-L39] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L30-L39] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L33-L39] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L36-L39] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L39] #res := 0; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L19-L40] ensures true; VAL [#in~x=4.286578691E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43-L45] assume 0 == #t~ret2; [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L42-L51] ensures true; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L75] RET call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L75] ~res~0 := #t~ret7; [L75] havoc #t~ret7; [L78] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] assume !#t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78-L81] assume !#t~short9; [L78] havoc #t~ret8; [L78] havoc #t~short9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L79] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4286578695, #NULL!offset=4286578690, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L72] ~x~0 := ~someUnaryFLOAToperation(0.0); [L73] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L75] CALL call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9, ~y=0.0] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L75] RET call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L75] ~res~0 := #t~ret7; [L75] havoc #t~ret7; [L78] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND FALSE !(#t~short9) VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND TRUE !#t~short9 [L78] havoc #t~ret8; [L78] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4286578695, #NULL!offset=4286578690, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L72] ~x~0 := ~someUnaryFLOAToperation(0.0); [L73] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L75] CALL call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9, ~y=0.0] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L75] RET call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L75] ~res~0 := #t~ret7; [L75] havoc #t~ret7; [L78] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND FALSE !(#t~short9) VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND TRUE !#t~short9 [L78] havoc #t~ret8; [L78] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4286578695, #NULL!offset=4286578690, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L72] ~x~0 := ~someUnaryFLOAToperation(0.0); [L73] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L75] CALL call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9, ~y=0.0] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L75] RET call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L75] ~res~0 := #t~ret7; [L75] havoc #t~ret7; [L78] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND FALSE !(#t~short9) VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND TRUE !#t~short9 [L78] havoc #t~ret8; [L78] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4286578695, #NULL!offset=4286578690, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4286578695, old(#NULL!offset)=4286578690] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L72] ~x~0 := ~someUnaryFLOAToperation(0.0); [L73] ~y~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~y~0=0.0] [L75] CALL call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9, ~y=0.0] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~x=4.286578691E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, ~w~0=4286578689, ~x=4.286578691E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=4.286578691E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=4286578689, ~x=4.286578691E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=4.286578691E9, ~y=0.0] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=4.286578691E9, #in~y=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~x=4.286578691E9, ~y=0.0] [L75] RET call #t~ret7 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L75] ~res~0 := #t~ret7; [L75] havoc #t~ret7; [L78] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND FALSE !(#t~short9) VAL [#NULL!base=0, #NULL!offset=0, #t~short9=false, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L78] COND TRUE !#t~short9 [L78] havoc #t~ret8; [L78] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=0.0, ~x~0=4.286578691E9, ~y~0=0.0] [L72] float x = -0.0f; [L73] float y = 0.0f; VAL [y=0] [L75] CALL, EXPR fmax_float(x, y) VAL [\old(x)=4286578691, \old(y)=0] [L43] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691] [L20] __uint32_t w; VAL [\old(x)=4286578691, x=4286578691] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; VAL [\old(x)=4286578691, \result=0, w=4286578689, x=4286578691] [L43] RET, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691, \old(y)=0, __fpclassify_float(x)=0, x=4286578691, y=0] [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; VAL [\old(x)=4286578691, \old(y)=0, \result=0, x=4286578691, y=0] [L75] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=0, x=4286578691, y=0] [L75] float res = fmax_float(x, y); [L78] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0, res == 0.0f && __signbit_float(res) == 0=0, x=4286578691, y=0] [L78] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L79] __VERIFIER_error() VAL [res=0, x=4286578691, y=0] ----- [2018-11-23 02:07:28,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:07:28 BoogieIcfgContainer [2018-11-23 02:07:28,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:07:28,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:07:28,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:07:28,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:07:28,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:27" (3/4) ... [2018-11-23 02:07:28,145 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:07:28,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:07:28,146 INFO L168 Benchmark]: Toolchain (without parser) took 953.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -101.1 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:28,147 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:07:28,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.99 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:28,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.12 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:07:28,149 INFO L168 Benchmark]: Boogie Preprocessor took 56.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:28,149 INFO L168 Benchmark]: RCFGBuilder took 212.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:28,150 INFO L168 Benchmark]: TraceAbstraction took 483.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:28,150 INFO L168 Benchmark]: Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:07:28,152 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.99 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.12 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 483.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 79]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someUnaryFLOAToperation at line 72. Possible FailurePath: [L72] float x = -0.0f; [L73] float y = 0.0f; VAL [y=0] [L75] CALL, EXPR fmax_float(x, y) VAL [\old(x)=4286578691, \old(y)=0] [L43] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691] [L20] __uint32_t w; VAL [\old(x)=4286578691, x=4286578691] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; VAL [\old(x)=4286578691, \result=0, w=4286578689, x=4286578691] [L43] RET, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691, \old(y)=0, __fpclassify_float(x)=0, x=4286578691, y=0] [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; VAL [\old(x)=4286578691, \old(y)=0, \result=0, x=4286578691, y=0] [L75] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=0, x=4286578691, y=0] [L75] float res = fmax_float(x, y); [L78] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0, res == 0.0f && __signbit_float(res) == 0=0, x=4286578691, y=0] [L78] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L79] __VERIFIER_error() VAL [res=0, x=4286578691, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 0 SDslu, 172 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 1926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:07:29,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:07:29,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:07:29,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:07:29,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:07:29,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:07:29,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:07:29,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:07:29,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:07:29,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:07:29,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:07:29,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:07:29,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:07:29,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:07:29,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:07:29,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:07:29,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:07:29,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:07:29,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:07:29,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:07:29,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:07:29,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:07:29,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:07:29,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:07:29,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:07:29,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:07:29,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:07:29,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:07:29,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:07:29,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:07:29,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:07:29,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:07:29,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:07:29,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:07:29,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:07:29,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:07:29,586 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 02:07:29,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:07:29,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:07:29,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:07:29,597 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:07:29,598 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:07:29,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:07:29,598 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:07:29,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:07:29,598 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:07:29,598 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:07:29,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:07:29,599 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:07:29,600 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:07:29,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:07:29,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:07:29,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:07:29,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:07:29,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:07:29,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:07:29,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:07:29,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:07:29,601 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 02:07:29,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:07:29,601 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:07:29,601 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:07:29,602 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(__VERIFIER_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 -> f441bd4a1f5705911b7315c074b39e665542818e [2018-11-23 02:07:29,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:07:29,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:07:29,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:07:29,644 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:07:29,645 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:07:29,645 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1252a_true-unreach-call.c [2018-11-23 02:07:29,688 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/4f326bbcf/e6f25c79f4ed483386e7abf045da1865/FLAG6a62a6a26 [2018-11-23 02:07:30,011 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:07:30,012 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/sv-benchmarks/c/float-newlib/float_req_bl_1252a_true-unreach-call.c [2018-11-23 02:07:30,016 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/4f326bbcf/e6f25c79f4ed483386e7abf045da1865/FLAG6a62a6a26 [2018-11-23 02:07:30,445 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/data/4f326bbcf/e6f25c79f4ed483386e7abf045da1865 [2018-11-23 02:07:30,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:07:30,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:07:30,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:07:30,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:07:30,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:07:30,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12511f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30, skipping insertion in model container [2018-11-23 02:07:30,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:07:30,475 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:07:30,598 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:07:30,603 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:07:30,621 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:07:30,636 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:07:30,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30 WrapperNode [2018-11-23 02:07:30,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:07:30,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:07:30,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:07:30,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:07:30,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:07:30,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:07:30,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:07:30,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:07:30,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... [2018-11-23 02:07:30,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:07:30,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:07:30,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:07:30,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:07:30,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:07:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:07:30,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:07:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:07:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:07:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 02:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:07:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-23 02:07:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-23 02:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 02:07:30,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 02:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 02:07:30,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 02:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:07:30,920 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:07:30,947 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:07:30,951 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:07:30,952 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 02:07:30,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:30 BoogieIcfgContainer [2018-11-23 02:07:30,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:07:30,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:07:30,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:07:30,955 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:07:30,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:07:30" (1/3) ... [2018-11-23 02:07:30,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3a002b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:07:30, skipping insertion in model container [2018-11-23 02:07:30,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:30" (2/3) ... [2018-11-23 02:07:30,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3a002b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:07:30, skipping insertion in model container [2018-11-23 02:07:30,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:30" (3/3) ... [2018-11-23 02:07:30,958 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252a_true-unreach-call.c [2018-11-23 02:07:30,965 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:07:30,972 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:07:30,982 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:07:31,002 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:07:31,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:07:31,002 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:07:31,002 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:07:31,003 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:07:31,003 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:07:31,003 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:07:31,003 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:07:31,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:07:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 02:07:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:07:31,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:31,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:31,020 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:31,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash -849686715, now seen corresponding path program 1 times [2018-11-23 02:07:31,026 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:31,026 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:31,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:07:31,086 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:31,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:31,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:07:31,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:07:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:07:31,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:07:31,111 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 02:07:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:31,125 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-23 02:07:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:07:31,126 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 02:07:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:31,131 INFO L225 Difference]: With dead ends: 75 [2018-11-23 02:07:31,131 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 02:07:31,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:07:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 02:07:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 02:07:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 02:07:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 02:07:31,165 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2018-11-23 02:07:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:31,165 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 02:07:31,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:07:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 02:07:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:07:31,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:31,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:31,167 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:31,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2014516036, now seen corresponding path program 1 times [2018-11-23 02:07:31,168 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:31,168 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:31,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:07:31,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:31,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:31,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:07:31,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:07:31,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:07:31,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:31,268 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 02:07:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:31,286 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 02:07:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:07:31,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 02:07:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:31,288 INFO L225 Difference]: With dead ends: 56 [2018-11-23 02:07:31,288 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 02:07:31,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 02:07:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 02:07:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 02:07:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 02:07:31,298 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2018-11-23 02:07:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:31,298 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 02:07:31,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:07:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 02:07:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:07:31,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:31,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:31,300 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:31,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:31,300 INFO L82 PathProgramCache]: Analyzing trace with hash -842703294, now seen corresponding path program 1 times [2018-11-23 02:07:31,300 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:31,301 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:31,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:31,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:07:31,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:31,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:07:31,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:07:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:07:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:07:31,458 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 8 states. [2018-11-23 02:07:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:31,811 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 02:07:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:07:31,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 02:07:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:31,812 INFO L225 Difference]: With dead ends: 60 [2018-11-23 02:07:31,812 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 02:07:31,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:07:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 02:07:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 02:07:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 02:07:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-23 02:07:31,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 23 [2018-11-23 02:07:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:31,817 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-23 02:07:31,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:07:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-23 02:07:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 02:07:31,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:31,818 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:31,818 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:31,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash 513797078, now seen corresponding path program 1 times [2018-11-23 02:07:31,818 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:31,818 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:31,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:31,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:07:31,871 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:31,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:31,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:07:31,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:07:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:07:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:31,879 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 4 states. [2018-11-23 02:07:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:31,898 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 02:07:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:07:31,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 02:07:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:31,900 INFO L225 Difference]: With dead ends: 56 [2018-11-23 02:07:31,900 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 02:07:31,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:07:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 02:07:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 02:07:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 02:07:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-23 02:07:31,903 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 30 [2018-11-23 02:07:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:31,904 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 02:07:31,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:07:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-23 02:07:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 02:07:31,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:31,904 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:31,905 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:31,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1245379058, now seen corresponding path program 1 times [2018-11-23 02:07:31,905 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:31,905 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:31,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:31,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:07:32,041 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:32,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:32,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:07:32,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:07:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:07:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:07:32,053 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2018-11-23 02:07:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:32,390 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 02:07:32,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:07:32,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-23 02:07:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:32,391 INFO L225 Difference]: With dead ends: 58 [2018-11-23 02:07:32,392 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:07:32,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:07:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:07:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 02:07:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 02:07:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 02:07:32,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2018-11-23 02:07:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:32,397 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 02:07:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:07:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 02:07:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 02:07:32,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:32,397 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:32,397 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:32,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash 45724059, now seen corresponding path program 1 times [2018-11-23 02:07:32,398 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:32,398 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:32,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:07:32,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:32,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:32,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:07:32,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:07:32,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:07:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:07:32,481 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-11-23 02:07:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:32,530 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 02:07:32,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:07:32,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 02:07:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:32,532 INFO L225 Difference]: With dead ends: 51 [2018-11-23 02:07:32,532 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:07:32,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:07:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:07:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 02:07:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 02:07:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 02:07:32,537 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-23 02:07:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:32,537 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 02:07:32,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:07:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 02:07:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 02:07:32,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:32,538 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:32,538 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:32,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash -763622567, now seen corresponding path program 1 times [2018-11-23 02:07:32,538 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:32,538 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:32,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:32,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:07:32,623 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:32,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:32,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:07:32,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:07:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:07:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:07:32,631 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2018-11-23 02:07:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:32,775 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 02:07:32,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:07:32,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-23 02:07:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:32,776 INFO L225 Difference]: With dead ends: 38 [2018-11-23 02:07:32,776 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:07:32,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:07:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:07:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 02:07:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 02:07:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 02:07:32,779 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-23 02:07:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:32,780 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 02:07:32,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:07:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 02:07:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:07:32,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:07:32,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:07:32,781 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:07:32,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:07:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash -135886477, now seen corresponding path program 1 times [2018-11-23 02:07:32,781 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:07:32,781 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 02:07:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:07:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:07:32,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:07:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:07:33,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:07:33,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:07:33,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 02:07:33,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:07:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:07:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:07:33,015 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2018-11-23 02:07:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:07:33,345 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 02:07:33,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:07:33,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 02:07:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:07:33,346 INFO L225 Difference]: With dead ends: 35 [2018-11-23 02:07:33,346 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:07:33,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:07:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:07:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:07:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:07:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:07:33,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-23 02:07:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:07:33,347 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:07:33,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:07:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:07:33,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:07:33,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:07:33,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:07:33,497 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:07:33,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:07:33,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:07:33,497 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 02:07:33,497 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:07:33,498 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:07:33,498 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 65 84) the Hoare annotation is: true [2018-11-23 02:07:33,498 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 65 84) no Hoare annotation was computed. [2018-11-23 02:07:33,498 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-23 02:07:33,498 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-23 02:07:33,498 INFO L444 ceAbstractionStarter]: At program point L78-1(line 78) the Hoare annotation is: (and (= (_ +zero 8 24) main_~res~0) |main_#t~short9| (= main_~x~0 (fp.neg (_ +zero 8 24))) (= (_ +zero 8 24) main_~y~0)) [2018-11-23 02:07:33,498 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 65 84) no Hoare annotation was computed. [2018-11-23 02:07:33,498 INFO L448 ceAbstractionStarter]: For program point L78-2(line 78) no Hoare annotation was computed. [2018-11-23 02:07:33,498 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-11-23 02:07:33,499 INFO L444 ceAbstractionStarter]: At program point L75(line 75) the Hoare annotation is: (and (= main_~x~0 (fp.neg (_ +zero 8 24))) (= (_ +zero 8 24) main_~y~0)) [2018-11-23 02:07:33,499 INFO L448 ceAbstractionStarter]: For program point L75-1(line 75) no Hoare annotation was computed. [2018-11-23 02:07:33,499 INFO L448 ceAbstractionStarter]: For program point L78-4(lines 78 81) no Hoare annotation was computed. [2018-11-23 02:07:33,499 INFO L448 ceAbstractionStarter]: For program point fmax_floatEXIT(lines 42 51) no Hoare annotation was computed. [2018-11-23 02:07:33,499 INFO L451 ceAbstractionStarter]: At program point fmax_floatENTRY(lines 42 51) the Hoare annotation is: true [2018-11-23 02:07:33,499 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-11-23 02:07:33,499 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-11-23 02:07:33,499 INFO L444 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (= |fmax_float_#in~x| fmax_float_~x))) (or (and (= |fmax_float_#in~y| fmax_float_~y) .cse0) (and (exists ((__fpclassify_float_~w~0 (_ BitVec 32))) (and (not (= (bvadd __fpclassify_float_~w~0 (_ bv2147483648 32)) (_ bv0 32))) (= |fmax_float_#in~x| (fp ((_ extract 31 31) __fpclassify_float_~w~0) ((_ extract 30 23) __fpclassify_float_~w~0) ((_ extract 22 0) __fpclassify_float_~w~0))))) .cse0))) [2018-11-23 02:07:33,499 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 47 49) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L444 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point fmax_floatFINAL(lines 42 51) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 39) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 19 40) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 39) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 39) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2018-11-23 02:07:33,500 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 26) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-11-23 02:07:33,500 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 19 40) no Hoare annotation was computed. [2018-11-23 02:07:33,501 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 19 40) the Hoare annotation is: true [2018-11-23 02:07:33,501 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 19 40) no Hoare annotation was computed. [2018-11-23 02:07:33,501 INFO L448 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 53 63) no Hoare annotation was computed. [2018-11-23 02:07:33,501 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 56 60) no Hoare annotation was computed. [2018-11-23 02:07:33,501 INFO L444 ceAbstractionStarter]: At program point L56-2(lines 56 60) the Hoare annotation is: (= |__signbit_float_#in~x| __signbit_float_~x) [2018-11-23 02:07:33,501 INFO L448 ceAbstractionStarter]: For program point L56-3(lines 56 60) no Hoare annotation was computed. [2018-11-23 02:07:33,501 INFO L451 ceAbstractionStarter]: At program point __signbit_floatENTRY(lines 53 63) the Hoare annotation is: true [2018-11-23 02:07:33,501 INFO L448 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 53 63) no Hoare annotation was computed. [2018-11-23 02:07:33,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:07:33 BoogieIcfgContainer [2018-11-23 02:07:33,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:07:33,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:07:33,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:07:33,510 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:07:33,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:30" (3/4) ... [2018-11-23 02:07:33,513 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:07:33,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:07:33,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:07:33,518 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_float [2018-11-23 02:07:33,518 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-23 02:07:33,518 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-11-23 02:07:33,521 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-23 02:07:33,521 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 02:07:33,522 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 02:07:33,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 02:07:33,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 02:07:33,560 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7b361663-6ff5-4476-87df-4748ddc90922/bin-2019/uautomizer/witness.graphml [2018-11-23 02:07:33,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:07:33,561 INFO L168 Benchmark]: Toolchain (without parser) took 3112.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 949.7 MB in the beginning and 817.4 MB in the end (delta: 132.3 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:33,562 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:07:33,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.87 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:33,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.88 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:07:33,563 INFO L168 Benchmark]: Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:07:33,563 INFO L168 Benchmark]: RCFGBuilder took 272.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:33,563 INFO L168 Benchmark]: TraceAbstraction took 2556.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 824.0 MB in the end (delta: 268.0 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:33,563 INFO L168 Benchmark]: Witness Printer took 50.16 ms. Allocated memory is still 1.2 GB. Free memory was 824.0 MB in the beginning and 817.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:07:33,565 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.87 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.88 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 272.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2556.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 824.0 MB in the end (delta: 268.0 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. * Witness Printer took 50.16 ms. Allocated memory is still 1.2 GB. Free memory was 824.0 MB in the beginning and 817.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 296 SDtfs, 121 SDslu, 975 SDs, 0 SdLazy, 365 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 31 PreInvPairs, 38 NumberOfFragments, 69 HoareAnnotationTreeSize, 31 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 223 ConstructedInterpolants, 14 QuantifiedInterpolants, 20050 SizeOfPredicates, 21 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...