./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1032d_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_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1032d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 bc388f4eaa6aadf687b7d35c78a026571921b2b6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1032d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 bc388f4eaa6aadf687b7d35c78a026571921b2b6 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:34:11,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:34:11,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:34:11,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:34:11,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:34:11,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:34:11,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:34:11,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:34:11,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:34:11,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:34:11,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:34:11,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:34:11,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:34:11,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:34:11,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:34:11,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:34:11,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:34:11,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:34:11,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:34:11,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:34:11,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:34:11,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:34:11,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:34:11,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:34:11,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:34:11,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:34:11,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:34:11,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:34:11,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:34:11,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:34:11,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:34:11,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:34:11,761 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:34:11,761 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:34:11,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:34:11,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:34:11,763 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:34:11,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:34:11,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:34:11,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:34:11,773 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:34:11,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:34:11,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:34:11,774 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:34:11,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:34:11,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:34:11,776 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:34:11,776 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:34:11,776 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:34:11,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:34:11,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:34:11,776 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:34:11,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:34:11,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:34:11,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:34:11,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:34:11,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:34:11,777 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:34:11,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:34:11,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:34:11,778 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_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 -> bc388f4eaa6aadf687b7d35c78a026571921b2b6 [2018-11-23 15:34:11,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:34:11,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:34:11,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:34:11,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:34:11,811 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:34:11,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1032d_true-unreach-call.c [2018-11-23 15:34:11,847 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/4195a8349/db09d701e6ce493c87243cab659820b1/FLAG141600cfa [2018-11-23 15:34:12,194 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:34:12,194 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/sv-benchmarks/c/float-newlib/double_req_bl_1032d_true-unreach-call.c [2018-11-23 15:34:12,200 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/4195a8349/db09d701e6ce493c87243cab659820b1/FLAG141600cfa [2018-11-23 15:34:12,608 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/4195a8349/db09d701e6ce493c87243cab659820b1 [2018-11-23 15:34:12,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:34:12,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:34:12,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:34:12,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:34:12,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:34:12,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f443fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12, skipping insertion in model container [2018-11-23 15:34:12,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:34:12,640 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:34:12,758 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:34:12,761 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:34:12,783 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:34:12,796 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:34:12,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12 WrapperNode [2018-11-23 15:34:12,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:34:12,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:34:12,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:34:12,797 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:34:12,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:34:12,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:34:12,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:34:12,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:34:12,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... [2018-11-23 15:34:12,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:34:12,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:34:12,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:34:12,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:34:12,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 15:34:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 15:34:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:34:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:34:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:34:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 15:34:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:34:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 15:34:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 15:34:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure round_double [2018-11-23 15:34:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure round_double [2018-11-23 15:34:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:34:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:34:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:34:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:34:12,902 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:34:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:34:13,122 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:34:13,122 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 15:34:13,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:13 BoogieIcfgContainer [2018-11-23 15:34:13,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:34:13,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:34:13,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:34:13,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:34:13,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:34:12" (1/3) ... [2018-11-23 15:34:13,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d20ecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:13, skipping insertion in model container [2018-11-23 15:34:13,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:12" (2/3) ... [2018-11-23 15:34:13,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d20ecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:13, skipping insertion in model container [2018-11-23 15:34:13,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:13" (3/3) ... [2018-11-23 15:34:13,129 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032d_true-unreach-call.c [2018-11-23 15:34:13,134 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:34:13,139 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:34:13,148 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:34:13,172 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:34:13,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:34:13,173 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:34:13,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:34:13,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:34:13,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:34:13,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:34:13,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:34:13,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:34:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 15:34:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:34:13,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:34:13,188 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] [2018-11-23 15:34:13,189 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:34:13,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:34:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash -288864886, now seen corresponding path program 1 times [2018-11-23 15:34:13,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:34:13,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:34:13,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:34:13,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:34:13,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:34:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:34:13,279 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 15:34:13,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:34:13,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:34:13,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:34:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:34:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:34:13,294 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 15:34:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:34:13,309 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2018-11-23 15:34:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:34:13,310 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 15:34:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:34:13,316 INFO L225 Difference]: With dead ends: 76 [2018-11-23 15:34:13,316 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 15:34:13,318 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 15:34:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 15:34:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 15:34:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 15:34:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 15:34:13,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 25 [2018-11-23 15:34:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:34:13,340 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 15:34:13,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:34:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 15:34:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:34:13,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:34:13,341 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, 1] [2018-11-23 15:34:13,342 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:34:13,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:34:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1876368369, now seen corresponding path program 1 times [2018-11-23 15:34:13,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:34:13,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:34:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:34:13,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:34:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:34:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:34:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:34:13,458 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=15032385546, |#NULL.offset|=15032385537, |old(#NULL.base)|=15032385546, |old(#NULL.offset)|=15032385537] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15032385546, |old(#NULL.offset)|=15032385537] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15032385546, |old(#NULL.offset)|=15032385537] [?] RET #102#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := round_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~exponent_less_1023~0;havoc ~lsw~0; VAL [round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [round_double_~lsw~0=0, round_double_~msw~0=2147483647, round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0] [?] goto; VAL [round_double_~lsw~0=0, round_double_~msw~0=2147483647, round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0] [?] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=2147483647, round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0] [?] assume ~exponent_less_1023~0 < 20; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=2147483647, round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0] [?] assume !(~exponent_less_1023~0 < 0);~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=2147483647, round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0] [?] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296;#res := ~x; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=2147483647, round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0, |round_double_#res|=15032385538.0] [?] assume true; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=2147483647, round_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=15032385538.0, |round_double_#res|=15032385538.0] [?] RET #106#return; VAL [main_~x~0=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=15032385538.0] [?] ~res~0 := #t~ret10;havoc #t~ret10; VAL [main_~res~0=15032385538.0, main_~x~0=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := isinf_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=15032385538.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=15032385538.0] [?] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8);call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union7;havoc #t~mem6;call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~mem8;havoc #t~union9;call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset);havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [isinf_double_~hx~0=(- 2147483648), isinf_double_~lx~0=(- 2147483648), isinf_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=15032385538.0] [?] goto; VAL [isinf_double_~hx~0=(- 2147483648), isinf_double_~lx~0=(- 2147483648), isinf_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=15032385538.0] [?] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=15032385538.0, |isinf_double_#res|=0] [?] assume true; VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=15032385538.0, |isinf_double_#res|=0] [?] RET #108#return; VAL [main_~res~0=15032385538.0, main_~x~0=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~res~0=15032385538.0, main_~x~0=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0] [?] assume 0 == #t~ret11;havoc #t~ret11; VAL [main_~res~0=15032385538.0, main_~x~0=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=15032385538.0, main_~x~0=15032385538.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15032385546, #NULL.offset=15032385537, old(#NULL.base)=15032385546, old(#NULL.offset)=15032385537] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15032385546, old(#NULL.offset)=15032385537] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15032385546, old(#NULL.offset)=15032385537] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L86] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L87] CALL call #t~ret10 := round_double(~x~0); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0] [L14-L61] ~x := #in~x; [L15] havoc ~msw~0; [L15] havoc ~exponent_less_1023~0; [L16] havoc ~lsw~0; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~x=1.5032385538E10] [L18] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L19] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L20] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L20] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L21] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L21] ~lsw~0 := #t~mem2; [L21] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L21] havoc #t~union3; [L21] havoc #t~mem2; [L18] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L18] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L23] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L24-L53] assume ~exponent_less_1023~0 < 20; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L25-L37] assume !(~exponent_less_1023~0 < 0); [L31] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L32-L33] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296; [L33] #res := ~x; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L14-L61] ensures true; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L87] RET call #t~ret10 := round_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=1.5032385538E10, ~x~0=1.5032385538E10] [L87] ~res~0 := #t~ret10; [L87] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0] [L64-L76] ~x := #in~x; [L65] havoc ~hx~0; [L65] havoc ~lx~0; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~x=1.5032385538E10] [L67] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L68] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L69] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L69] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L69] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L69] havoc #t~union7; [L69] havoc #t~mem6; [L70] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L70] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L70] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L70] havoc #t~mem8; [L70] havoc #t~union9; [L67] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L67] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.5032385538E10] [L72] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L73] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L74] ~hx~0 := 2146435072 - ~hx~0; [L75] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L64-L76] ensures true; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L90] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90-L93] assume 0 == #t~ret11; [L90] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L91] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15032385546, #NULL.offset=15032385537, old(#NULL.base)=15032385546, old(#NULL.offset)=15032385537] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15032385546, old(#NULL.offset)=15032385537] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15032385546, old(#NULL.offset)=15032385537] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L86] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L87] CALL call #t~ret10 := round_double(~x~0); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0] [L14-L61] ~x := #in~x; [L15] havoc ~msw~0; [L15] havoc ~exponent_less_1023~0; [L16] havoc ~lsw~0; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~x=1.5032385538E10] [L18] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L19] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L20] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L20] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L21] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L21] ~lsw~0 := #t~mem2; [L21] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L21] havoc #t~union3; [L21] havoc #t~mem2; [L18] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L18] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L23] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L24-L53] assume ~exponent_less_1023~0 < 20; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L25-L37] assume !(~exponent_less_1023~0 < 0); [L31] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L32-L33] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296; [L33] #res := ~x; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L14-L61] ensures true; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L87] RET call #t~ret10 := round_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=1.5032385538E10, ~x~0=1.5032385538E10] [L87] ~res~0 := #t~ret10; [L87] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0] [L64-L76] ~x := #in~x; [L65] havoc ~hx~0; [L65] havoc ~lx~0; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~x=1.5032385538E10] [L67] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L68] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L69] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L69] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L69] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L69] havoc #t~union7; [L69] havoc #t~mem6; [L70] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L70] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L70] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L70] havoc #t~mem8; [L70] havoc #t~union9; [L67] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L67] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.5032385538E10] [L72] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L73] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L74] ~hx~0 := 2146435072 - ~hx~0; [L75] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L64-L76] ensures true; VAL [#in~x=1.5032385538E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L90] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90-L93] assume 0 == #t~ret11; [L90] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L91] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15032385546, #NULL!offset=15032385537, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret10 := round_double(~x~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L14-L61] ~x := #in~x; [L15] havoc ~msw~0; [L15] havoc ~exponent_less_1023~0; [L16] havoc ~lsw~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L18] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L19] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L20] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L21] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L21] ~lsw~0 := #t~mem2; [L21] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~union3; [L21] havoc #t~mem2; [L18] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L18] havoc ~#ew_u~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L23] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L24] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L25] COND FALSE !(~exponent_less_1023~0 < 0) [L31] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L32] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L33] #res := ~x; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L87] RET call #t~ret10 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=1.5032385538E10, ~x~0=1.5032385538E10] [L87] ~res~0 := #t~ret10; [L87] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L64-L76] ~x := #in~x; [L65] havoc ~hx~0; [L65] havoc ~lx~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L67] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L68] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L69] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~union7; [L69] havoc #t~mem6; [L70] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L70] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L70] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L70] havoc #t~mem8; [L70] havoc #t~union9; [L67] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L67] havoc ~#ew_u~1; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.5032385538E10] [L72] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L73] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L74] ~hx~0 := 2146435072 - ~hx~0; [L75] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L90] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] COND TRUE 0 == #t~ret11 [L90] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15032385546, #NULL!offset=15032385537, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret10 := round_double(~x~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L14-L61] ~x := #in~x; [L15] havoc ~msw~0; [L15] havoc ~exponent_less_1023~0; [L16] havoc ~lsw~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L18] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L19] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L20] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L21] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L21] ~lsw~0 := #t~mem2; [L21] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~union3; [L21] havoc #t~mem2; [L18] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L18] havoc ~#ew_u~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L23] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L24] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L25] COND FALSE !(~exponent_less_1023~0 < 0) [L31] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L32] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L33] #res := ~x; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L87] RET call #t~ret10 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=1.5032385538E10, ~x~0=1.5032385538E10] [L87] ~res~0 := #t~ret10; [L87] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L64-L76] ~x := #in~x; [L65] havoc ~hx~0; [L65] havoc ~lx~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L67] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L68] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L69] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~union7; [L69] havoc #t~mem6; [L70] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L70] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L70] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L70] havoc #t~mem8; [L70] havoc #t~union9; [L67] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L67] havoc ~#ew_u~1; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.5032385538E10] [L72] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L73] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L74] ~hx~0 := 2146435072 - ~hx~0; [L75] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L90] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] COND TRUE 0 == #t~ret11 [L90] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15032385546, #NULL!offset=15032385537, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret10 := round_double(~x~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L14-L61] ~x := #in~x; [L15] havoc ~msw~0; [L15] havoc ~exponent_less_1023~0; [L16] havoc ~lsw~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L18] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L19] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L20] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L21] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L21] ~lsw~0 := #t~mem2; [L21] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~union3; [L21] havoc #t~mem2; [L18] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L18] havoc ~#ew_u~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L23] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L24] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L25] COND FALSE !(~exponent_less_1023~0 < 0) [L31] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L32] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L33] #res := ~x; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L87] RET call #t~ret10 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=1.5032385538E10, ~x~0=1.5032385538E10] [L87] ~res~0 := #t~ret10; [L87] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L64-L76] ~x := #in~x; [L65] havoc ~hx~0; [L65] havoc ~lx~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L67] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L68] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L69] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~union7; [L69] havoc #t~mem6; [L70] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L70] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L70] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L70] havoc #t~mem8; [L70] havoc #t~union9; [L67] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L67] havoc ~#ew_u~1; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.5032385538E10] [L72] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L73] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L74] ~hx~0 := 2146435072 - ~hx~0; [L75] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L90] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] COND TRUE 0 == #t~ret11 [L90] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15032385546, #NULL!offset=15032385537, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15032385546, old(#NULL!offset)=15032385537] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L86] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L87] CALL call #t~ret10 := round_double(~x~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L14-L61] ~x := #in~x; [L15] havoc ~msw~0; [L15] havoc ~exponent_less_1023~0; [L16] havoc ~lsw~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L18] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L19] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L20] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L21] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L21] ~lsw~0 := #t~mem2; [L21] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~union3; [L21] havoc #t~mem2; [L18] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L18] havoc ~#ew_u~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L23] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L24] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L25] COND FALSE !(~exponent_less_1023~0 < 0) [L31] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L32] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L33] #res := ~x; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=1.5032385538E10, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=2147483647, ~x=1.5032385538E10] [L87] RET call #t~ret10 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=1.5032385538E10, ~x~0=1.5032385538E10] [L87] ~res~0 := #t~ret10; [L87] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0] [L64-L76] ~x := #in~x; [L65] havoc ~hx~0; [L65] havoc ~lx~0; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~x=1.5032385538E10] [L67] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L68] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L69] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L69] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L69] havoc #t~union7; [L69] havoc #t~mem6; [L70] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L70] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L70] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L70] havoc #t~mem8; [L70] havoc #t~union9; [L67] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L67] havoc ~#ew_u~1; VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.5032385538E10] [L72] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L73] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L74] ~hx~0 := 2146435072 - ~hx~0; [L75] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.5032385538E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435072, ~lx~0=-2147483648, ~x=1.5032385538E10] [L90] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L90] COND TRUE 0 == #t~ret11 [L90] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=1.5032385538E10, ~x~0=1.5032385538E10] [L86] double x = -1.0 / 0.0; [L87] CALL, EXPR round_double(x) VAL [\old(x)=15032385538] [L15] __int32_t msw, exponent_less_1023; [L16] __uint32_t lsw; VAL [\old(x)=15032385538, x=15032385538] [L18] ieee_double_shape_type ew_u; [L19] ew_u.value = (x) [L20] EXPR ew_u.parts.msw [L20] (msw) = ew_u.parts.msw [L21] EXPR ew_u.parts.lsw [L21] (lsw) = ew_u.parts.lsw [L23] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L24] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L25] COND FALSE !(exponent_less_1023 < 0) [L31] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L32] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L33] return x; VAL [\old(x)=15032385538, \result=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L87] RET, EXPR round_double(x) VAL [round_double(x)=15032385538, x=15032385538] [L87] double res = round_double(x); [L90] CALL, EXPR isinf_double(res) VAL [\old(x)=15032385538] [L65] __int32_t hx, lx; VAL [\old(x)=15032385538, x=15032385538] [L67] ieee_double_shape_type ew_u; [L68] ew_u.value = (x) [L69] EXPR ew_u.parts.msw [L69] (hx) = ew_u.parts.msw [L70] EXPR ew_u.parts.lsw [L70] (lx) = ew_u.parts.lsw [L72] hx &= 0x7fffffff [L73] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L74] hx = 0x7ff00000 - hx [L75] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=15032385538, \result=0, hx=2146435072, lx=-2147483648, x=15032385538] [L90] RET, EXPR isinf_double(res) VAL [isinf_double(res)=0, res=15032385538, x=15032385538] [L90] COND TRUE !isinf_double(res) [L91] __VERIFIER_error() VAL [res=15032385538, x=15032385538] ----- [2018-11-23 15:34:13,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:34:13 BoogieIcfgContainer [2018-11-23 15:34:13,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:34:13,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:34:13,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:34:13,495 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:34:13,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:13" (3/4) ... [2018-11-23 15:34:13,498 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:34:13,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:34:13,499 INFO L168 Benchmark]: Toolchain (without parser) took 888.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:34:13,500 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:34:13,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.49 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:34:13,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.00 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:34:13,502 INFO L168 Benchmark]: Boogie Preprocessor took 56.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:34:13,502 INFO L168 Benchmark]: RCFGBuilder took 253.86 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:34:13,503 INFO L168 Benchmark]: TraceAbstraction took 370.65 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:34:13,503 INFO L168 Benchmark]: Witness Printer took 4.06 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 15:34:13,505 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.49 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.00 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 253.86 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 370.65 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.06 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: 91]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 31, overapproximation of bitwiseOr at line 73, overapproximation of someBinaryArithmeticDOUBLEoperation at line 86, overapproximation of bitwiseAnd at line 72. Possible FailurePath: [L86] double x = -1.0 / 0.0; [L87] CALL, EXPR round_double(x) VAL [\old(x)=15032385538] [L15] __int32_t msw, exponent_less_1023; [L16] __uint32_t lsw; VAL [\old(x)=15032385538, x=15032385538] [L18] ieee_double_shape_type ew_u; [L19] ew_u.value = (x) [L20] EXPR ew_u.parts.msw [L20] (msw) = ew_u.parts.msw [L21] EXPR ew_u.parts.lsw [L21] (lsw) = ew_u.parts.lsw [L23] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L24] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L25] COND FALSE !(exponent_less_1023 < 0) [L31] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L32] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L33] return x; VAL [\old(x)=15032385538, \result=15032385538, exponent_less_1023=0, lsw=0, msw=2147483647, x=15032385538] [L87] RET, EXPR round_double(x) VAL [round_double(x)=15032385538, x=15032385538] [L87] double res = round_double(x); [L90] CALL, EXPR isinf_double(res) VAL [\old(x)=15032385538] [L65] __int32_t hx, lx; VAL [\old(x)=15032385538, x=15032385538] [L67] ieee_double_shape_type ew_u; [L68] ew_u.value = (x) [L69] EXPR ew_u.parts.msw [L69] (hx) = ew_u.parts.msw [L70] EXPR ew_u.parts.lsw [L70] (lx) = ew_u.parts.lsw [L72] hx &= 0x7fffffff [L73] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L74] hx = 0x7ff00000 - hx [L75] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=15032385538, \result=0, hx=2146435072, lx=-2147483648, x=15032385538] [L90] RET, EXPR isinf_double(res) VAL [isinf_double(res)=0, res=15032385538, x=15032385538] [L90] COND TRUE !isinf_double(res) [L91] __VERIFIER_error() VAL [res=15032385538, x=15032385538] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 15:34:14,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:34:14,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:34:14,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:34:14,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:34:14,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:34:14,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:34:14,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:34:14,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:34:14,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:34:14,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:34:14,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:34:14,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:34:14,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:34:14,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:34:14,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:34:14,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:34:14,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:34:14,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:34:14,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:34:14,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:34:14,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:34:14,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:34:14,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:34:14,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:34:14,955 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:34:14,956 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:34:14,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:34:14,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:34:14,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:34:14,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:34:14,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:34:14,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:34:14,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:34:14,959 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:34:14,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:34:14,959 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 15:34:14,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:34:14,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:34:14,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:34:14,970 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:34:14,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:34:14,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:34:14,970 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:34:14,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:34:14,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:34:14,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:34:14,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:34:14,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:34:14,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:34:14,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:34:14,971 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:34:14,972 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:34:14,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:34:14,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:34:14,972 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:34:14,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:34:14,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:34:14,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:34:14,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:34:14,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:34:14,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:34:14,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:34:14,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:34:14,973 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:34:14,973 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 15:34:14,973 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:34:14,974 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:34:14,974 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 15:34:14,974 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_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 -> bc388f4eaa6aadf687b7d35c78a026571921b2b6 [2018-11-23 15:34:15,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:34:15,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:34:15,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:34:15,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:34:15,016 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:34:15,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1032d_true-unreach-call.c [2018-11-23 15:34:15,061 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/acfbd4313/e4aaa0bc85f74ccab8876c1696ab7f79/FLAGf1ae52863 [2018-11-23 15:34:15,376 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:34:15,376 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/sv-benchmarks/c/float-newlib/double_req_bl_1032d_true-unreach-call.c [2018-11-23 15:34:15,380 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/acfbd4313/e4aaa0bc85f74ccab8876c1696ab7f79/FLAGf1ae52863 [2018-11-23 15:34:15,388 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/data/acfbd4313/e4aaa0bc85f74ccab8876c1696ab7f79 [2018-11-23 15:34:15,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:34:15,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:34:15,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:34:15,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:34:15,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:34:15,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2a43b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15, skipping insertion in model container [2018-11-23 15:34:15,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:34:15,416 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:34:15,541 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:34:15,544 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:34:15,567 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:34:15,585 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:34:15,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15 WrapperNode [2018-11-23 15:34:15,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:34:15,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:34:15,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:34:15,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:34:15,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:34:15,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:34:15,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:34:15,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:34:15,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... [2018-11-23 15:34:15,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:34:15,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:34:15,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:34:15,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:34:15,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 15:34:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 15:34:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:34:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:34:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:34:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 15:34:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 15:34:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 15:34:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 15:34:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure round_double [2018-11-23 15:34:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure round_double [2018-11-23 15:34:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:34:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:34:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:34:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:34:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 15:34:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:34:15,822 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 15:34:15,890 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 15:34:15,975 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:34:15,975 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 15:34:15,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:15 BoogieIcfgContainer [2018-11-23 15:34:15,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:34:15,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:34:15,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:34:15,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:34:15,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:34:15" (1/3) ... [2018-11-23 15:34:15,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b7e9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:15, skipping insertion in model container [2018-11-23 15:34:15,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:15" (2/3) ... [2018-11-23 15:34:15,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b7e9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:15, skipping insertion in model container [2018-11-23 15:34:15,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:15" (3/3) ... [2018-11-23 15:34:15,980 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032d_true-unreach-call.c [2018-11-23 15:34:15,987 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:34:15,992 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:34:16,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:34:16,020 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:34:16,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:34:16,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:34:16,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:34:16,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:34:16,021 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:34:16,021 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:34:16,021 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:34:16,021 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:34:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 15:34:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 15:34:16,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:34:16,037 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] [2018-11-23 15:34:16,038 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:34:16,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:34:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash -16968872, now seen corresponding path program 1 times [2018-11-23 15:34:16,044 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:34:16,044 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 15:34:16,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:34:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:34:16,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:34:16,117 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 15:34:16,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:34:16,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:34:16,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:34:16,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:34:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:34:16,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:34:16,138 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-23 15:34:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:34:16,154 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2018-11-23 15:34:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:34:16,155 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 15:34:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:34:16,160 INFO L225 Difference]: With dead ends: 74 [2018-11-23 15:34:16,160 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 15:34:16,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 15:34:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 15:34:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 15:34:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 15:34:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 15:34:16,187 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2018-11-23 15:34:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:34:16,187 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 15:34:16,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:34:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 15:34:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 15:34:16,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:34:16,188 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 15:34:16,188 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:34:16,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:34:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1528384495, now seen corresponding path program 1 times [2018-11-23 15:34:16,189 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:34:16,189 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 15:34:16,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:34:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:34:16,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:34:16,353 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:34:16,357 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:34:16,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 15:34:16,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 15:34:16,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:34:16,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 15:34:16,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 15:34:16,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:34:16,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:34:16,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:34:16,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:34:16,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 15:34:18,011 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 15:34:19,634 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 15:34:21,388 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 15:34:23,416 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 15:34:25,463 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 15:34:25,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:34:25,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:34:25,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 15:34:25,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:34:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:34:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2018-11-23 15:34:25,477 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 9 states. [2018-11-23 15:34:27,631 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 15:34:29,814 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 15:34:31,909 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 15:34:33,998 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 15:34:38,123 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 15:34:42,464 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-23 15:34:46,729 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-23 15:34:48,813 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 15:34:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:34:54,898 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-11-23 15:34:54,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:34:54,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 15:34:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:34:54,901 INFO L225 Difference]: With dead ends: 63 [2018-11-23 15:34:54,901 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 15:34:54,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=79, Invalid=192, Unknown=1, NotChecked=0, Total=272 [2018-11-23 15:34:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 15:34:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 15:34:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:34:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 15:34:54,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2018-11-23 15:34:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:34:54,906 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 15:34:54,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:34:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 15:34:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 15:34:54,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:34:54,907 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 15:34:54,907 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:34:54,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:34:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 707416066, now seen corresponding path program 1 times [2018-11-23 15:34:54,908 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:34:54,908 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 15:34:54,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:34:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:34:55,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:34:55,898 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:34:55,899 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:34:55,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 15:34:55,933 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:34:55,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 15:34:55,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:34:55,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 15:34:55,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 15:34:55,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:34:55,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:34:55,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:34:55,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:34:55,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 15:34:56,471 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 15:34:56,471 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:34:56,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:34:56,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 15:34:56,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 15:34:56,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:34:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:34:56,481 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2018-11-23 15:34:57,394 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 15:34:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:34:59,269 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 15:34:59,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:34:59,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 15:34:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:34:59,270 INFO L225 Difference]: With dead ends: 42 [2018-11-23 15:34:59,270 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 15:34:59,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:34:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 15:34:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 15:34:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:34:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 15:34:59,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-11-23 15:34:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:34:59,277 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 15:34:59,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 15:34:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 15:34:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 15:34:59,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:34:59,278 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 15:34:59,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:34:59,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:34:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash 414013059, now seen corresponding path program 1 times [2018-11-23 15:34:59,278 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:34:59,278 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 15:34:59,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:34:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:34:59,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:34:59,423 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:34:59,424 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:34:59,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 15:34:59,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 15:34:59,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:34:59,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 15:34:59,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 15:34:59,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:34:59,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:34:59,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:34:59,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:34:59,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 15:34:59,678 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 15:34:59,678 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:34:59,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:34:59,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 15:34:59,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 15:34:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:34:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:34:59,687 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2018-11-23 15:35:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:00,899 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 15:35:00,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:35:00,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 15:35:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:00,900 INFO L225 Difference]: With dead ends: 40 [2018-11-23 15:35:00,900 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 15:35:00,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:35:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 15:35:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 15:35:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 15:35:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 15:35:00,904 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-11-23 15:35:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:00,904 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 15:35:00,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 15:35:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 15:35:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 15:35:00,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:00,905 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, 1, 1, 1, 1, 1] [2018-11-23 15:35:00,906 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:00,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash -792778855, now seen corresponding path program 1 times [2018-11-23 15:35:00,906 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:35:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/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 15:35:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:01,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:01,018 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:35:01,018 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:35:01,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 15:35:01,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 15:35:01,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:35:01,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 15:35:01,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 15:35:01,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:35:01,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:35:01,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:35:01,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:35:01,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 15:35:01,160 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 15:35:01,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:35:01,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:35:01,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:35:01,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:35:01,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:35:01,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:35:01,174 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 7 states. [2018-11-23 15:35:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:01,626 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 15:35:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:35:01,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 15:35:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:01,627 INFO L225 Difference]: With dead ends: 38 [2018-11-23 15:35:01,627 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 15:35:01,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:35:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 15:35:01,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 15:35:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 15:35:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:35:01,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-23 15:35:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:01,628 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:35:01,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:35:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:35:01,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 15:35:01,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 15:35:01,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:35:01,707 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:35:01,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:35:01,707 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 66 71) no Hoare annotation was computed. [2018-11-23 15:35:01,707 INFO L444 ceAbstractionStarter]: At program point L66-2(lines 66 71) the Hoare annotation is: (= isinf_double_~x |isinf_double_#in~x|) [2018-11-23 15:35:01,707 INFO L448 ceAbstractionStarter]: For program point L66-3(lines 66 71) no Hoare annotation was computed. [2018-11-23 15:35:01,707 INFO L448 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 64 76) no Hoare annotation was computed. [2018-11-23 15:35:01,707 INFO L448 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 64 76) no Hoare annotation was computed. [2018-11-23 15:35:01,707 INFO L451 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 64 76) the Hoare annotation is: true [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 28) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point round_doubleFINAL(lines 14 61) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 27 28) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L451 ceAbstractionStarter]: At program point round_doubleENTRY(lines 14 61) the Hoare annotation is: true [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 33) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 53) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point round_doubleEXIT(lines 14 61) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 50) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 37) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 59) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 14 61) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L54-2(lines 54 59) no Hoare annotation was computed. [2018-11-23 15:35:01,708 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 22) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 22) the Hoare annotation is: (= |round_double_#in~x| round_double_~x) [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 22) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 53) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 42) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 15:35:01,709 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 78 96) the Hoare annotation is: true [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 78 96) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-23 15:35:01,709 INFO L444 ceAbstractionStarter]: At program point L90(line 90) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse0) main_~res~0) (= .cse0 main_~x~0))) [2018-11-23 15:35:01,709 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 93) no Hoare annotation was computed. [2018-11-23 15:35:01,710 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 78 96) no Hoare annotation was computed. [2018-11-23 15:35:01,710 INFO L444 ceAbstractionStarter]: At program point L87(line 87) the Hoare annotation is: (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) main_~x~0) [2018-11-23 15:35:01,710 INFO L448 ceAbstractionStarter]: For program point L87-1(line 87) no Hoare annotation was computed. [2018-11-23 15:35:01,710 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-23 15:35:01,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:35:01 BoogieIcfgContainer [2018-11-23 15:35:01,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:35:01,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:35:01,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:35:01,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:35:01,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:15" (3/4) ... [2018-11-23 15:35:01,722 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 15:35:01,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 15:35:01,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-11-23 15:35:01,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure round_double [2018-11-23 15:35:01,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 15:35:01,730 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-23 15:35:01,730 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 15:35:01,730 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 15:35:01,748 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 15:35:01,748 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 15:35:01,765 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25402ccc-f034-4ff4-8e4b-1d77fa376270/bin-2019/uautomizer/witness.graphml [2018-11-23 15:35:01,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:35:01,765 INFO L168 Benchmark]: Toolchain (without parser) took 46375.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -246.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:35:01,766 INFO L168 Benchmark]: CDTParser took 0.16 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 15:35:01,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:35:01,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.05 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:35:01,766 INFO L168 Benchmark]: Boogie Preprocessor took 74.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -211.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:35:01,767 INFO L168 Benchmark]: RCFGBuilder took 296.60 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: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:35:01,767 INFO L168 Benchmark]: TraceAbstraction took 45742.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.3 MB). Peak memory consumption was 312.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:35:01,767 INFO L168 Benchmark]: Witness Printer took 46.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:35:01,769 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.16 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 194.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 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 18.05 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -211.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 296.60 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: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45742.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.3 MB). Peak memory consumption was 312.2 MB. Max. memory is 11.5 GB. * Witness Printer took 46.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 17]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. SAFE Result, 45.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 33.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 146 SDtfs, 130 SDslu, 602 SDs, 0 SdLazy, 324 SolverSat, 30 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 18 PreInvPairs, 23 NumberOfFragments, 49 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 128 ConstructedInterpolants, 29 QuantifiedInterpolants, 28459 SizeOfPredicates, 21 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...