./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1300_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_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f ............................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:58:07,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:07,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:07,477 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:07,478 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:07,478 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:07,479 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:07,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:07,481 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:07,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:07,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:07,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:07,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:07,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:07,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:07,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:07,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:07,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:07,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:07,489 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:07,490 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:07,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:07,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:07,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:07,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:07,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:07,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:07,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:07,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:07,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:07,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:07,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:07,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:07,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:07,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:07,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:07,498 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 09:58:07,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:07,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:07,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:07,509 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:07,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:07,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:07,509 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:07,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:07,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:07,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:07,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:07,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:07,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:07,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:07,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:07,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:07,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:07,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:07,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:07,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:58:07,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:07,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:58:07,512 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_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 -> ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f [2018-11-23 09:58:07,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:07,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:07,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:07,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:07,544 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:07,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 09:58:07,580 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/19f7d211d/bd2a9448c15640bd81c09569dea49084/FLAGb93587f38 [2018-11-23 09:58:07,978 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:07,979 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 09:58:07,983 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/19f7d211d/bd2a9448c15640bd81c09569dea49084/FLAGb93587f38 [2018-11-23 09:58:07,992 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/19f7d211d/bd2a9448c15640bd81c09569dea49084 [2018-11-23 09:58:07,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:07,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:07,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:07,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:07,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:07,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:07" (1/1) ... [2018-11-23 09:58:08,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f57c443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:07, skipping insertion in model container [2018-11-23 09:58:08,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:07" (1/1) ... [2018-11-23 09:58:08,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:08,019 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:08,133 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:08,135 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:08,152 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:08,165 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:08,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08 WrapperNode [2018-11-23 09:58:08,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:08,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:08,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:08,166 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:08,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:08,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:08,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:08,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:08,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... [2018-11-23 09:58:08,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:08,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:08,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:08,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:08,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 09:58:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2018-11-23 09:58:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2018-11-23 09:58:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 09:58:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 09:58:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 09:58:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 09:58:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 09:58:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:58:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:08,442 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:08,443 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 09:58:08,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:08 BoogieIcfgContainer [2018-11-23 09:58:08,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:08,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:08,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:08,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:08,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:07" (1/3) ... [2018-11-23 09:58:08,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560fe7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:08, skipping insertion in model container [2018-11-23 09:58:08,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:08" (2/3) ... [2018-11-23 09:58:08,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560fe7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:08, skipping insertion in model container [2018-11-23 09:58:08,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:08" (3/3) ... [2018-11-23 09:58:08,449 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300_true-unreach-call.c [2018-11-23 09:58:08,456 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:08,460 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:08,470 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:08,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:08,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:08,495 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:08,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:08,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:08,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:08,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:08,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:08,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 09:58:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 09:58:08,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:08,512 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 09:58:08,513 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:08,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2080830514, now seen corresponding path program 1 times [2018-11-23 09:58:08,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:08,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:08,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:08,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:08,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:08,616 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 09:58:08,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:08,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:08,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:08,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:08,629 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 09:58:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:08,643 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-23 09:58:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:08,644 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 09:58:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:08,649 INFO L225 Difference]: With dead ends: 66 [2018-11-23 09:58:08,649 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 09:58:08,651 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 09:58:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 09:58:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 09:58:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 09:58:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 09:58:08,674 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 24 [2018-11-23 09:58:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:08,674 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 09:58:08,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 09:58:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:58:08,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:08,675 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 09:58:08,676 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:08,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash 52000231, now seen corresponding path program 1 times [2018-11-23 09:58:08,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:08,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:08,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:08,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:08,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:08,750 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 09:58:08,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:08,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:08,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:08,753 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 3 states. [2018-11-23 09:58:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:08,779 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2018-11-23 09:58:08,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:08,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 09:58:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:08,780 INFO L225 Difference]: With dead ends: 44 [2018-11-23 09:58:08,780 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 09:58:08,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 09:58:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 09:58:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 09:58:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2018-11-23 09:58:08,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 26 [2018-11-23 09:58:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:08,786 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2018-11-23 09:58:08,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2018-11-23 09:58:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 09:58:08,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:08,786 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 09:58:08,787 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:08,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1291078367, now seen corresponding path program 1 times [2018-11-23 09:58:08,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:08,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:08,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:58:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:58:08,886 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=10737418249, |#NULL.offset|=10737418241, |old(#NULL.base)|=10737418249, |old(#NULL.offset)|=10737418241] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10737418249, |old(#NULL.offset)|=10737418241] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10737418249, |old(#NULL.offset)|=10737418241] [?] RET #65#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := #t~nondet6;havoc #t~nondet6; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := isinf_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=10737418245.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=10737418245.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);~hx~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~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [isinf_double_~hx~0=(- 2147483648), isinf_double_~lx~0=(- 2147483648), isinf_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=10737418245.0] [?] goto; VAL [isinf_double_~hx~0=(- 2147483648), isinf_double_~lx~0=(- 2147483648), isinf_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=10737418245.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=2146435073, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=10737418245.0, |isinf_double_#res|=0] [?] assume true; VAL [isinf_double_~hx~0=2146435073, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=10737418245.0, |isinf_double_#res|=0] [?] RET #69#return; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#t~short9 := 0 == #t~ret7; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_#t~short9|=true] [?] assume #t~short9; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_#t~short9|=true] [?] CALL call #t~ret8 := isnan_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=10737418245.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=10737418245.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=10737418245.0, |isnan_double_#res|=0] [?] RET #71#return; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_#t~ret8|=0, |main_#t~short9|=true] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;#t~short9 := 0 == #t~ret8; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_#t~ret8|=0, |main_#t~short9|=true] [?] assume #t~short9;havoc #t~ret7;havoc #t~ret8;havoc #t~short9; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := isfinite_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isfinite_double_#in~x|=10737418245.0] [?] ~x := #in~x;havoc ~hx~1; VAL [isfinite_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_double_#in~x|=10737418245.0] [?] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8);call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4);~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8);havoc #t~mem4;havoc #t~union5;call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset);havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [isfinite_double_~hx~1=(- 2147483648), isfinite_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_double_#in~x|=10737418245.0] [?] goto; VAL [isfinite_double_~hx~1=(- 2147483648), isfinite_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_double_#in~x|=10737418245.0] [?] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [isfinite_double_~hx~1=(- 2147483648), isfinite_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_double_#in~x|=10737418245.0, |isfinite_double_#res|=3] [?] assume true; VAL [isfinite_double_~hx~1=(- 2147483648), isfinite_double_~x=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_double_#in~x|=10737418245.0, |isfinite_double_#res|=3] [?] RET #73#return; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=3] [?] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~res~0 := ~convertINTToDOUBLE(#t~ret10);havoc #t~ret10; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~x~0=10737418245.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418249, #NULL.offset=10737418241, old(#NULL.base)=10737418249, old(#NULL.offset)=10737418241] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418249, old(#NULL.offset)=10737418241] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418249, old(#NULL.offset)=10737418241] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L53] CALL call #t~ret7 := isinf_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0] [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~x=1.0737418245E10] [L19] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L20] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L21] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L19] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.0737418245E10] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~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); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #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.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L16-L28] ensures true; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L53] RET call #t~ret7 := isinf_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0] [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~x=1.0737418245E10] [L31] ensures true; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~x=1.0737418245E10] [L53] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53-L62] assume #t~short9; [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L53] havoc #t~short9; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L55] CALL call #t~ret10 := isfinite_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0] [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~x=1.0737418245E10] [L36] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8); [L37] call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8); [L38] call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L36] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~hx~1=-2147483648, ~x=1.0737418245E10] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L33-L41] ensures true; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L55] RET call #t~ret10 := isfinite_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=3, ~x~0=1.0737418245E10] [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L58-L61] assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418249, #NULL.offset=10737418241, old(#NULL.base)=10737418249, old(#NULL.offset)=10737418241] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418249, old(#NULL.offset)=10737418241] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418249, old(#NULL.offset)=10737418241] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L53] CALL call #t~ret7 := isinf_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0] [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~x=1.0737418245E10] [L19] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L20] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L21] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L19] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.0737418245E10] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~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); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #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.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L16-L28] ensures true; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L53] RET call #t~ret7 := isinf_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0] [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~x=1.0737418245E10] [L31] ensures true; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=0, ~x=1.0737418245E10] [L53] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53-L62] assume #t~short9; [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L53] havoc #t~short9; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L55] CALL call #t~ret10 := isfinite_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0] [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~x=1.0737418245E10] [L36] call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.alloc(8); [L37] call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8); [L38] call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); [L36] havoc ~#gh_u~0.base, ~#gh_u~0.offset; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, ~hx~1=-2147483648, ~x=1.0737418245E10] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L33-L41] ensures true; VAL [#in~x=1.0737418245E10, #NULL.base=0, #NULL.offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L55] RET call #t~ret10 := isfinite_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=3, ~x~0=1.0737418245E10] [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L58-L61] assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=1.0737418245E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418249, #NULL!offset=10737418241, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L53] CALL call #t~ret7 := isinf_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L19] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L19] havoc ~#ew_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.0737418245E10] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~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); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #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.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L53] RET call #t~ret7 := isinf_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~x=1.0737418245E10] [L53] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L53] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L55] CALL call #t~ret10 := isfinite_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L36] FCALL call ~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] FCALL call #t~mem4 := read~int({ base: ~#gh_u~0!base, offset: 4 + ~#gh_u~0!offset }, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(#t~union5, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L36] havoc ~#gh_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~1=-2147483648, ~x=1.0737418245E10] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L55] RET call #t~ret10 := isfinite_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=3, ~x~0=1.0737418245E10] [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418249, #NULL!offset=10737418241, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L53] CALL call #t~ret7 := isinf_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L19] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L19] havoc ~#ew_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.0737418245E10] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~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); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #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.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L53] RET call #t~ret7 := isinf_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~x=1.0737418245E10] [L53] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L53] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L55] CALL call #t~ret10 := isfinite_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L36] FCALL call ~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] FCALL call #t~mem4 := read~int({ base: ~#gh_u~0!base, offset: 4 + ~#gh_u~0!offset }, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(#t~union5, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L36] havoc ~#gh_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~1=-2147483648, ~x=1.0737418245E10] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L55] RET call #t~ret10 := isfinite_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=3, ~x~0=1.0737418245E10] [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418249, #NULL!offset=10737418241, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L53] CALL call #t~ret7 := isinf_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L19] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L19] havoc ~#ew_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.0737418245E10] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~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); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #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.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L53] RET call #t~ret7 := isinf_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~x=1.0737418245E10] [L53] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L53] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L55] CALL call #t~ret10 := isfinite_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L36] FCALL call ~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] FCALL call #t~mem4 := read~int({ base: ~#gh_u~0!base, offset: 4 + ~#gh_u~0!offset }, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(#t~union5, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L36] havoc ~#gh_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~1=-2147483648, ~x=1.0737418245E10] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L55] RET call #t~ret10 := isfinite_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=3, ~x~0=1.0737418245E10] [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418249, #NULL!offset=10737418241, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418249, old(#NULL!offset)=10737418241] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L50] ~x~0 := #t~nondet6; [L50] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L53] CALL call #t~ret7 := isinf_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L16-L28] ~x := #in~x; [L17] havoc ~hx~0; [L17] havoc ~lx~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L19] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L20] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L21] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L21] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L21] havoc #t~mem0; [L21] havoc #t~union1; [L22] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L22] ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem2; [L22] havoc #t~union3; [L19] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L19] havoc ~#ew_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~0=-2147483648, ~lx~0=-2147483648, ~x=1.0737418245E10] [L24] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L25] ~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); [L26] ~hx~0 := 2146435072 - ~hx~0; [L27] #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.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~hx~0=2146435073, ~lx~0=-2147483648, ~x=1.0737418245E10] [L53] RET call #t~ret7 := isinf_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L53] #t~short9 := 0 == #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L31] ~x := #in~x; [L31] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=0, ~x=1.0737418245E10] [L53] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L53] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, #t~ret8=0, #t~short9=true, ~x~0=1.0737418245E10] [L53] COND TRUE #t~short9 [L53] havoc #t~ret7; [L53] havoc #t~ret8; [L53] havoc #t~short9; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L55] CALL call #t~ret10 := isfinite_double(~x~0); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0] [L33-L41] ~x := #in~x; [L34] havoc ~hx~1; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~x=1.0737418245E10] [L36] FCALL call ~#gh_u~0 := #Ultimate.alloc(8); [L37] FCALL call write~real(~x, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] FCALL call #t~mem4 := read~int({ base: ~#gh_u~0!base, offset: 4 + ~#gh_u~0!offset }, 4); [L38] ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L38] FCALL call write~real(#t~union5, { base: ~#gh_u~0!base, offset: ~#gh_u~0!offset }, 8); [L38] havoc #t~mem4; [L38] havoc #t~union5; [L36] FCALL call ULTIMATE.dealloc(~#gh_u~0); [L36] havoc ~#gh_u~0; VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, ~hx~1=-2147483648, ~x=1.0737418245E10] [L40] #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=1.0737418245E10, #NULL!base=0, #NULL!offset=0, #res=3, ~hx~1=-2147483648, ~x=1.0737418245E10] [L55] RET call #t~ret10 := isfinite_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=3, ~x~0=1.0737418245E10] [L55] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L55] ~res~0 := ~convertINTToDOUBLE(#t~ret10); [L55] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L58] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0) VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=1.0737418245E10] [L50] double x = __VERIFIER_nondet_double(); [L53] CALL, EXPR isinf_double(x) VAL [\old(x)=10737418245] [L17] __int32_t hx, lx; VAL [\old(x)=10737418245, x=10737418245] [L19] ieee_double_shape_type ew_u; [L20] ew_u.value = (x) [L21] EXPR ew_u.parts.msw [L21] (hx) = ew_u.parts.msw [L22] EXPR ew_u.parts.lsw [L22] (lx) = ew_u.parts.lsw [L24] hx &= 0x7fffffff [L25] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L26] hx = 0x7ff00000 - hx [L27] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=10737418245, \result=0, hx=2146435073, lx=-2147483648, x=10737418245] [L53] RET, EXPR isinf_double(x) VAL [isinf_double(x)=0, x=10737418245] [L53] !isinf_double(x) && !isnan_double(x) VAL [!isinf_double(x) && !isnan_double(x)=1, isinf_double(x)=0, x=10737418245] [L53] CALL, EXPR isnan_double(x) VAL [\old(x)=10737418245] [L31] return x != x; VAL [\old(x)=10737418245, \result=0, x=10737418245] [L53] RET, EXPR isnan_double(x) VAL [!isinf_double(x) && !isnan_double(x)=1, isinf_double(x)=0, isnan_double(x)=0, x=10737418245] [L53] !isinf_double(x) && !isnan_double(x) VAL [!isinf_double(x) && !isnan_double(x)=1, isinf_double(x)=0, isnan_double(x)=0, x=10737418245] [L53] COND TRUE !isinf_double(x) && !isnan_double(x) [L55] CALL, EXPR isfinite_double(x) VAL [\old(x)=10737418245] [L34] __int32_t hx; VAL [\old(x)=10737418245, x=10737418245] [L36] ieee_double_shape_type gh_u; [L37] gh_u.value = (x) [L38] EXPR gh_u.parts.msw [L38] (hx) = gh_u.parts.msw [L40] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=10737418245, \result=3, hx=-2147483648, x=10737418245] [L55] RET, EXPR isfinite_double(x) VAL [isfinite_double(x)=3, x=10737418245] [L55] double res = isfinite_double(x); [L58] COND TRUE res == 0.0 VAL [x=10737418245] [L59] __VERIFIER_error() VAL [x=10737418245] ----- [2018-11-23 09:58:08,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:58:08 BoogieIcfgContainer [2018-11-23 09:58:08,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:58:08,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:58:08,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:58:08,935 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:58:08,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:08" (3/4) ... [2018-11-23 09:58:08,939 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:58:08,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:58:08,940 INFO L168 Benchmark]: Toolchain (without parser) took 944.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -92.3 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:08,941 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:58:08,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:08,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:58:08,942 INFO L168 Benchmark]: Boogie Preprocessor took 56.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:08,942 INFO L168 Benchmark]: RCFGBuilder took 203.76 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.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:08,943 INFO L168 Benchmark]: TraceAbstraction took 491.45 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: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:08,943 INFO L168 Benchmark]: Witness Printer took 3.80 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 09:58:08,946 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.76 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.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 491.45 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: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.80 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: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 25, overapproximation of bitwiseAnd at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of to_real at line 55. Possible FailurePath: [L50] double x = __VERIFIER_nondet_double(); [L53] CALL, EXPR isinf_double(x) VAL [\old(x)=10737418245] [L17] __int32_t hx, lx; VAL [\old(x)=10737418245, x=10737418245] [L19] ieee_double_shape_type ew_u; [L20] ew_u.value = (x) [L21] EXPR ew_u.parts.msw [L21] (hx) = ew_u.parts.msw [L22] EXPR ew_u.parts.lsw [L22] (lx) = ew_u.parts.lsw [L24] hx &= 0x7fffffff [L25] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L26] hx = 0x7ff00000 - hx [L27] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=10737418245, \result=0, hx=2146435073, lx=-2147483648, x=10737418245] [L53] RET, EXPR isinf_double(x) VAL [isinf_double(x)=0, x=10737418245] [L53] !isinf_double(x) && !isnan_double(x) VAL [!isinf_double(x) && !isnan_double(x)=1, isinf_double(x)=0, x=10737418245] [L53] CALL, EXPR isnan_double(x) VAL [\old(x)=10737418245] [L31] return x != x; VAL [\old(x)=10737418245, \result=0, x=10737418245] [L53] RET, EXPR isnan_double(x) VAL [!isinf_double(x) && !isnan_double(x)=1, isinf_double(x)=0, isnan_double(x)=0, x=10737418245] [L53] !isinf_double(x) && !isnan_double(x) VAL [!isinf_double(x) && !isnan_double(x)=1, isinf_double(x)=0, isnan_double(x)=0, x=10737418245] [L53] COND TRUE !isinf_double(x) && !isnan_double(x) [L55] CALL, EXPR isfinite_double(x) VAL [\old(x)=10737418245] [L34] __int32_t hx; VAL [\old(x)=10737418245, x=10737418245] [L36] ieee_double_shape_type gh_u; [L37] gh_u.value = (x) [L38] EXPR gh_u.parts.msw [L38] (hx) = gh_u.parts.msw [L40] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=10737418245, \result=3, hx=-2147483648, x=10737418245] [L55] RET, EXPR isfinite_double(x) VAL [isfinite_double(x)=3, x=10737418245] [L55] double res = isfinite_double(x); [L58] COND TRUE res == 0.0 VAL [x=10737418245] [L59] __VERIFIER_error() VAL [x=10737418245] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 0 SDslu, 27 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 09:58:10,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:10,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:10,358 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:10,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:10,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:10,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:10,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:10,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:10,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:10,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:10,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:10,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:10,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:10,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:10,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:10,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:10,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:10,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:10,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:10,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:10,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:10,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:10,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:10,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:10,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:10,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:10,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:10,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:10,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:10,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:10,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:10,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:10,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:10,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:10,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:10,379 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:58:10,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:10,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:10,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:10,390 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:10,390 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:10,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:10,391 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:10,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:10,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:10,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:10,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:10,391 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:10,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:10,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:10,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:10,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:10,393 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:10,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:10,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:10,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:10,394 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:10,394 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:10,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:10,394 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:10,394 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:10,394 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_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 -> ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f [2018-11-23 09:58:10,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:10,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:10,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:10,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:10,439 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:10,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 09:58:10,485 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/ae5664332/755ed070ba3440eaaaa77bb70a279ecf/FLAG545807482 [2018-11-23 09:58:10,801 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:10,801 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/sv-benchmarks/c/float-newlib/double_req_bl_1300_true-unreach-call.c [2018-11-23 09:58:10,805 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/ae5664332/755ed070ba3440eaaaa77bb70a279ecf/FLAG545807482 [2018-11-23 09:58:10,813 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/data/ae5664332/755ed070ba3440eaaaa77bb70a279ecf [2018-11-23 09:58:10,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:10,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:10,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:10,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:10,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:10,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:10" (1/1) ... [2018-11-23 09:58:10,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b4c4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:10, skipping insertion in model container [2018-11-23 09:58:10,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:10" (1/1) ... [2018-11-23 09:58:10,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:10,843 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:10,964 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:10,968 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:10,984 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:11,002 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:11,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11 WrapperNode [2018-11-23 09:58:11,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:11,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:11,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:11,003 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:11,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:11,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:11,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:11,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:11,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... [2018-11-23 09:58:11,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:11,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:11,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:11,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:11,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 09:58:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2018-11-23 09:58:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2018-11-23 09:58:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 09:58:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 09:58:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 09:58:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 09:58:11,132 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 09:58:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:11,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:11,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:11,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:11,232 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:58:11,267 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:58:11,343 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:11,343 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 09:58:11,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:11 BoogieIcfgContainer [2018-11-23 09:58:11,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:11,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:11,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:11,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:11,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:10" (1/3) ... [2018-11-23 09:58:11,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419f1f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:11, skipping insertion in model container [2018-11-23 09:58:11,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:11" (2/3) ... [2018-11-23 09:58:11,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419f1f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:11, skipping insertion in model container [2018-11-23 09:58:11,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:11" (3/3) ... [2018-11-23 09:58:11,349 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300_true-unreach-call.c [2018-11-23 09:58:11,355 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:11,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:11,370 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:11,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:11,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:11,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:11,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:11,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:11,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:11,389 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:11,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:11,390 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 09:58:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 09:58:11,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:11,403 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 09:58:11,404 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:11,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2080830514, now seen corresponding path program 1 times [2018-11-23 09:58:11,409 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:58:11,410 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 09:58:11,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:11,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:11,483 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 09:58:11,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:11,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:11,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:11,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:11,504 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 09:58:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:11,519 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-23 09:58:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:11,520 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 09:58:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:11,526 INFO L225 Difference]: With dead ends: 66 [2018-11-23 09:58:11,526 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 09:58:11,529 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 09:58:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 09:58:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 09:58:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 09:58:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 09:58:11,554 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 24 [2018-11-23 09:58:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:11,554 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 09:58:11,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 09:58:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:58:11,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:11,555 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 09:58:11,556 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:11,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash 52000231, now seen corresponding path program 1 times [2018-11-23 09:58:11,557 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:58:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 09:58:11,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:11,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:11,641 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 09:58:11,641 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:11,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:11,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:11,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:11,651 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 3 states. [2018-11-23 09:58:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:11,664 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2018-11-23 09:58:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:11,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 09:58:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:11,665 INFO L225 Difference]: With dead ends: 44 [2018-11-23 09:58:11,665 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 09:58:11,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 09:58:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 09:58:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 09:58:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2018-11-23 09:58:11,670 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 26 [2018-11-23 09:58:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:11,671 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2018-11-23 09:58:11,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2018-11-23 09:58:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 09:58:11,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:11,672 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 09:58:11,672 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:11,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1291078367, now seen corresponding path program 1 times [2018-11-23 09:58:11,673 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:58:11,673 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/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 09:58:11,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:11,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:11,805 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:58:11,806 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:58:11,809 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 09:58:11,852 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 21 [2018-11-23 09:58:11,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:58:11,870 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 17 treesize of output 13 [2018-11-23 09:58:11,878 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 13 treesize of output 1 [2018-11-23 09:58:11,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:58:11,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:58:11,893 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 09:58:11,901 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 09:58:11,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 09:58:15,856 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 09:58:15,856 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:15,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:15,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-23 09:58:15,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 09:58:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 09:58:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-11-23 09:58:15,869 INFO L87 Difference]: Start difference. First operand 32 states and 31 transitions. Second operand 17 states. [2018-11-23 09:58:17,898 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 09:58:18,813 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2018-11-23 09:58:19,988 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-11-23 09:58:20,841 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 09:58:25,133 WARN L180 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 09:58:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:25,135 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2018-11-23 09:58:25,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 09:58:25,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-11-23 09:58:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:25,135 INFO L225 Difference]: With dead ends: 32 [2018-11-23 09:58:25,136 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 09:58:25,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-11-23 09:58:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 09:58:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 09:58:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 09:58:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 09:58:25,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-23 09:58:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:25,138 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:58:25,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 09:58:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:58:25,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:25,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 09:58:25,245 INFO L444 ceAbstractionStarter]: At program point L35-2(lines 35 39) the Hoare annotation is: (= isfinite_double_~x |isfinite_double_#in~x|) [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point isfinite_doubleFINAL(lines 33 41) no Hoare annotation was computed. [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point isfinite_doubleEXIT(lines 33 41) no Hoare annotation was computed. [2018-11-23 09:58:25,246 INFO L451 ceAbstractionStarter]: At program point isfinite_doubleENTRY(lines 33 41) the Hoare annotation is: true [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 35 39) no Hoare annotation was computed. [2018-11-23 09:58:25,246 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 31) the Hoare annotation is: true [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 31) no Hoare annotation was computed. [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 31) no Hoare annotation was computed. [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:58:25,246 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:58:25,246 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 23) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 18 23) the Hoare annotation is: (= isinf_double_~x |isinf_double_#in~x|) [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 16 28) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point L18-3(lines 18 23) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 16 28) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L451 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 16 28) the Hoare annotation is: true [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 09:58:25,247 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 61) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 43 65) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 43 65) no Hoare annotation was computed. [2018-11-23 09:58:25,247 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 43 65) the Hoare annotation is: true [2018-11-23 09:58:25,247 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-11-23 09:58:25,248 INFO L444 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (fp.eq main_~x~0 main_~x~0) (exists ((v_prenex_7 (_ BitVec 64))) (and (= main_~x~0 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7))) (= (_ bv4294967295 32) (bvneg (bvlshr (let ((.cse0 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_7)) (bvlshr (let ((.cse1 ((_ extract 31 0) v_prenex_7))) (bvor .cse1 (bvneg .cse1))) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse0 (bvneg .cse0))) (_ bv31 32))))))) [2018-11-23 09:58:25,248 INFO L448 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-11-23 09:58:25,248 INFO L451 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: true [2018-11-23 09:58:25,248 INFO L448 ceAbstractionStarter]: For program point L53-1(line 53) no Hoare annotation was computed. [2018-11-23 09:58:25,248 INFO L448 ceAbstractionStarter]: For program point L53-2(line 53) no Hoare annotation was computed. [2018-11-23 09:58:25,248 INFO L444 ceAbstractionStarter]: At program point L53-3(line 53) the Hoare annotation is: (and (exists ((v_prenex_7 (_ BitVec 64))) (and (= main_~x~0 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7))) (= (bvadd (bvneg (bvlshr (let ((.cse0 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_7)) (bvlshr (let ((.cse1 ((_ extract 31 0) v_prenex_7))) (bvor .cse1 (bvneg .cse1))) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse0 (bvneg .cse0))) (_ bv31 32))) (_ bv1 32)) |main_#t~ret7|))) |main_#t~short9| (exists ((v_prenex_7 (_ BitVec 64))) (and (= main_~x~0 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7))) (= (_ bv4294967295 32) (bvneg (bvlshr (let ((.cse2 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_7)) (bvlshr (let ((.cse3 ((_ extract 31 0) v_prenex_7))) (bvor .cse3 (bvneg .cse3))) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse2 (bvneg .cse2))) (_ bv31 32))))))) [2018-11-23 09:58:25,248 INFO L448 ceAbstractionStarter]: For program point L53-4(line 53) no Hoare annotation was computed. [2018-11-23 09:58:25,248 INFO L448 ceAbstractionStarter]: For program point L53-6(lines 53 62) no Hoare annotation was computed. [2018-11-23 09:58:25,248 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2018-11-23 09:58:25,248 INFO L448 ceAbstractionStarter]: For program point L53-8(lines 53 62) no Hoare annotation was computed. [2018-11-23 09:58:25,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:58:25 BoogieIcfgContainer [2018-11-23 09:58:25,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:58:25,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:58:25,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:58:25,257 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:58:25,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:11" (3/4) ... [2018-11-23 09:58:25,260 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 09:58:25,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isfinite_double [2018-11-23 09:58:25,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 09:58:25,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 09:58:25,265 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-11-23 09:58:25,265 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 09:58:25,268 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-23 09:58:25,268 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 09:58:25,268 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 09:58:25,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 09:58:25,286 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 09:58:25,302 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2fa6f0b9-19fb-48cf-a29a-e697405667ec/bin-2019/uautomizer/witness.graphml [2018-11-23 09:58:25,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:58:25,302 INFO L168 Benchmark]: Toolchain (without parser) took 14486.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 950.8 MB in the beginning and 903.5 MB in the end (delta: 47.3 MB). Peak memory consumption was 213.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:25,303 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 09:58:25,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:25,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.11 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:58:25,304 INFO L168 Benchmark]: Boogie Preprocessor took 25.49 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:58:25,304 INFO L168 Benchmark]: RCFGBuilder took 295.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:25,304 INFO L168 Benchmark]: TraceAbstraction took 13912.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.2 MB in the end (delta: 225.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:25,304 INFO L168 Benchmark]: Witness Printer took 45.15 ms. Allocated memory is still 1.2 GB. Free memory was 910.2 MB in the beginning and 903.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:58:25,306 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 185.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 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 19.11 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.49 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 295.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13912.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.2 MB in the end (delta: 225.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 11.5 GB. * Witness Printer took 45.15 ms. Allocated memory is still 1.2 GB. Free memory was 910.2 MB in the beginning and 903.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 59]: 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: 35]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. SAFE Result, 13.8s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 12 SDslu, 252 SDs, 0 SdLazy, 182 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 172 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 16 QuantifiedInterpolants, 25899 SizeOfPredicates, 11 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...