./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b ........................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:11:57,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:11:57,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:11:57,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:11:57,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:11:57,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:11:57,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:11:57,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:11:57,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:11:57,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:11:57,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:11:57,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:11:57,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:11:57,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:11:57,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:11:57,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:11:57,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:11:57,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:11:57,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:11:57,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:11:57,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:11:57,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:11:57,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:11:57,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:11:57,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:11:57,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:11:57,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:11:57,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:11:57,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:11:57,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:11:57,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:11:57,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:11:57,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:11:57,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:11:57,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:11:57,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:11:57,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:11:57,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:11:57,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:11:57,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:11:57,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:11:57,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:11:57,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:11:57,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:11:57,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:11:57,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:11:57,673 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:11:57,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:11:57,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:11:57,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:11:57,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:11:57,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:11:57,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:11:57,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:11:57,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:11:57,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:11:57,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:11:57,676 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:11:57,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:11:57,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:11:57,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:11:57,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:11:57,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:11:57,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:11:57,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:11:57,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:11:57,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:11:57,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:11:57,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:11:57,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:11:57,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 -> 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b [2019-11-16 00:11:57,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:11:57,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:11:57,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:11:57,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:11:57,739 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:11:57,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-16 00:11:57,801 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/db8aaaa05/490e134ef41e4d0c85e2b70c1066320c/FLAG3c5062cba [2019-11-16 00:11:58,246 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:11:58,247 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-16 00:11:58,255 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/db8aaaa05/490e134ef41e4d0c85e2b70c1066320c/FLAG3c5062cba [2019-11-16 00:11:58,623 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/db8aaaa05/490e134ef41e4d0c85e2b70c1066320c [2019-11-16 00:11:58,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:11:58,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:11:58,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:58,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:11:58,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:11:58,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:58" (1/1) ... [2019-11-16 00:11:58,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df9745b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:58, skipping insertion in model container [2019-11-16 00:11:58,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:58" (1/1) ... [2019-11-16 00:11:58,645 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:11:58,665 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:11:58,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:58,933 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:11:58,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:59,003 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:11:59,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59 WrapperNode [2019-11-16 00:11:59,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:59,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:59,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:11:59,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:11:59,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:59,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:11:59,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:11:59,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:11:59,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... [2019-11-16 00:11:59,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:11:59,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:11:59,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:11:59,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:11:59,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 [2019-11-16 00:11:59,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:11:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-16 00:11:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:11:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-16 00:11:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:11:59,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:11:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:11:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:11:59,725 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:11:59,725 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-16 00:11:59,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:59 BoogieIcfgContainer [2019-11-16 00:11:59,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:11:59,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:11:59,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:11:59,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:11:59,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:58" (1/3) ... [2019-11-16 00:11:59,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3458b591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:59, skipping insertion in model container [2019-11-16 00:11:59,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:59" (2/3) ... [2019-11-16 00:11:59,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3458b591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:59, skipping insertion in model container [2019-11-16 00:11:59,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:59" (3/3) ... [2019-11-16 00:11:59,737 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a.c [2019-11-16 00:11:59,747 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:11:59,759 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:11:59,770 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:11:59,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:11:59,799 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:11:59,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:11:59,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:11:59,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:11:59,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:11:59,800 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:11:59,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:11:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-16 00:11:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:11:59,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:59,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:59,830 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:11:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-11-16 00:11:59,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:59,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887813330] [2019-11-16 00:11:59,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:59,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:59,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:59,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887813330] [2019-11-16 00:11:59,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:59,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:11:59,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556657452] [2019-11-16 00:11:59,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:11:59,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:11:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:11:59,979 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-16 00:11:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:59,995 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-11-16 00:11:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:11:59,997 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-16 00:11:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:00,007 INFO L225 Difference]: With dead ends: 69 [2019-11-16 00:12:00,008 INFO L226 Difference]: Without dead ends: 32 [2019-11-16 00:12:00,010 INFO L600 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 [2019-11-16 00:12:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-16 00:12:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-16 00:12:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:12:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-16 00:12:00,044 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-11-16 00:12:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:00,045 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-16 00:12:00,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:12:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-11-16 00:12:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:12:00,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:00,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:00,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-11-16 00:12:00,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:00,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210628423] [2019-11-16 00:12:00,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:00,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:00,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:00,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210628423] [2019-11-16 00:12:00,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:00,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:12:00,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881692725] [2019-11-16 00:12:00,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:00,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:00,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:00,109 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-11-16 00:12:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:00,123 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-11-16 00:12:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:00,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-16 00:12:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:00,125 INFO L225 Difference]: With dead ends: 57 [2019-11-16 00:12:00,125 INFO L226 Difference]: Without dead ends: 32 [2019-11-16 00:12:00,126 INFO L600 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 [2019-11-16 00:12:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-16 00:12:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-16 00:12:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:12:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-16 00:12:00,131 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-11-16 00:12:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:00,131 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-16 00:12:00,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-16 00:12:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:12:00,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:00,133 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:00,133 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-11-16 00:12:00,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:00,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418869712] [2019-11-16 00:12:00,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:00,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:00,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:00,322 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:00,324 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:12:00,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:12:00 BoogieIcfgContainer [2019-11-16 00:12:00,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:12:00,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:12:00,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:12:00,387 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:12:00,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:59" (3/4) ... [2019-11-16 00:12:00,390 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:12:00,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:12:00,394 INFO L168 Benchmark]: Toolchain (without parser) took 1766.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -119.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,394 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:00,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.77 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,403 INFO L168 Benchmark]: Boogie Preprocessor took 78.57 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. [2019-11-16 00:12:00,404 INFO L168 Benchmark]: RCFGBuilder took 593.31 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: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,405 INFO L168 Benchmark]: TraceAbstraction took 658.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:00,406 INFO L168 Benchmark]: Witness Printer took 5.23 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. [2019-11-16 00:12:00,413 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.77 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.57 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. * RCFGBuilder took 593.31 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: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 658.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.23 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: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of bitwiseAnd at line 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 72. Possible FailurePath: [L32-L41] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L43] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L146] double x = __VERIFIER_nondet_double(); [L148] EXPR x < 0 && isfinite_double(x) [L127] __int32_t hx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L129] ieee_double_shape_type gh_u; [L130] gh_u.value = (x) [L131] EXPR gh_u.parts.msw [L131] (hx) = gh_u.parts.msw [L133] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L148] EXPR x < 0 && isfinite_double(x) VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L148] COND TRUE (x < 0 && isfinite_double(x)) [L46] double hfsq, f, s, z, R, w, t1, t2, dk; [L47] __int32_t k, hx, i, j; [L48] __uint32_t lx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L51] ieee_double_shape_type ew_u; [L52] ew_u.value = (x) [L53] EXPR ew_u.parts.msw [L53] (hx) = ew_u.parts.msw [L54] EXPR ew_u.parts.lsw [L54] (lx) = ew_u.parts.lsw [L57] k = 0 VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L58] COND FALSE !(hx < 0x00100000) VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L71] COND TRUE hx >= 0x7ff00000 [L72] return x + x; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L150] double res = __ieee754_log(x); [L137] return x != x; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L153] COND TRUE !isnan_double(res) [L154] __VERIFIER_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 91 SDtfs, 0 SDslu, 38 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=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:12:02,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:02,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:02,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:02,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:02,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:02,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:02,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:02,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:02,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:02,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:02,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:02,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:02,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:02,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:02,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:02,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:02,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:02,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:02,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:02,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:02,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:02,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:02,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:02,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:02,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:02,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:02,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:02,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:02,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:02,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:02,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:02,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:02,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:02,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:02,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:02,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:02,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:02,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:02,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:02,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:02,650 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:12:02,679 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:02,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:02,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:02,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:02,684 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:02,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:02,685 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:12:02,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:12:02,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:02,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:12:02,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:12:02,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:12:02,686 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:12:02,686 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:12:02,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:12:02,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:12:02,687 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:02,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:12:02,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:02,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:02,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:12:02,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:12:02,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:12:02,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:02,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:12:02,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:12:02,692 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:12:02,692 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:12:02,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:12:02,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:12:02,693 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 -> 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b [2019-11-16 00:12:02,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:02,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:02,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:02,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:02,737 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:02,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-16 00:12:02,798 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/dfcd92f4f/8a3dea18c9014b72bfc4ebff1fa93b90/FLAG1363aa305 [2019-11-16 00:12:03,230 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:03,231 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-16 00:12:03,239 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/dfcd92f4f/8a3dea18c9014b72bfc4ebff1fa93b90/FLAG1363aa305 [2019-11-16 00:12:03,599 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/data/dfcd92f4f/8a3dea18c9014b72bfc4ebff1fa93b90 [2019-11-16 00:12:03,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:03,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:12:03,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:03,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:03,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:03,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:03" (1/1) ... [2019-11-16 00:12:03,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b28e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:03, skipping insertion in model container [2019-11-16 00:12:03,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:03" (1/1) ... [2019-11-16 00:12:03,620 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:03,654 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:03,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:03,919 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:04,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:04,053 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:04,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04 WrapperNode [2019-11-16 00:12:04,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:04,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:04,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:12:04,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:12:04,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:04,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:04,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:04,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:04,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... [2019-11-16 00:12:04,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:04,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:04,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:04,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:04,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 [2019-11-16 00:12:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-16 00:12:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-16 00:12:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:12:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:12:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:04,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:12:04,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:12:27,315 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:27,315 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-16 00:12:27,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:27 BoogieIcfgContainer [2019-11-16 00:12:27,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:27,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:12:27,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:12:27,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:12:27,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:03" (1/3) ... [2019-11-16 00:12:27,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df37e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:27, skipping insertion in model container [2019-11-16 00:12:27,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:04" (2/3) ... [2019-11-16 00:12:27,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df37e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:27, skipping insertion in model container [2019-11-16 00:12:27,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:27" (3/3) ... [2019-11-16 00:12:27,325 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a.c [2019-11-16 00:12:27,333 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:12:27,339 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:12:27,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:12:27,367 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:12:27,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:12:27,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:12:27,368 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:27,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:27,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:12:27,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:27,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:12:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-16 00:12:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:12:27,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:27,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:27,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-11-16 00:12:27,399 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:12:27,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353002309] [2019-11-16 00:12:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 [2019-11-16 00:12:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:27,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-16 00:12:27,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:27,584 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:12:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:27,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353002309] [2019-11-16 00:12:27,589 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:27,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:12:27,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373247112] [2019-11-16 00:12:27,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:12:27,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:12:27,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:12:27,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:12:27,608 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-16 00:12:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:27,627 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-11-16 00:12:27,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:12:27,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-16 00:12:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:27,637 INFO L225 Difference]: With dead ends: 69 [2019-11-16 00:12:27,637 INFO L226 Difference]: Without dead ends: 32 [2019-11-16 00:12:27,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:12:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-16 00:12:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-16 00:12:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:12:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-16 00:12:27,673 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-11-16 00:12:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:27,673 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-16 00:12:27,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:12:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-11-16 00:12:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:12:27,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:27,674 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:27,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-16 00:12:27,890 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-11-16 00:12:27,892 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:12:27,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008691153] [2019-11-16 00:12:27,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 [2019-11-16 00:12:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:28,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:28,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:28,057 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:12:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:28,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008691153] [2019-11-16 00:12:28,061 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:28,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:12:28,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689588902] [2019-11-16 00:12:28,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:12:28,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:12:28,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:12:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:28,064 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-11-16 00:12:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:28,092 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-11-16 00:12:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:12:28,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-16 00:12:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:28,099 INFO L225 Difference]: With dead ends: 57 [2019-11-16 00:12:28,099 INFO L226 Difference]: Without dead ends: 32 [2019-11-16 00:12:28,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:12:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-16 00:12:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-16 00:12:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:12:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-16 00:12:28,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-11-16 00:12:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:28,113 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-16 00:12:28,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:12:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-16 00:12:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:12:28,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:28,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:28,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-16 00:12:28,334 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:28,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-11-16 00:12:28,335 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:12:28,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217699724] [2019-11-16 00:12:28,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/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 [2019-11-16 00:12:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:28,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:12:28,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:28,630 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:12:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:28,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217699724] [2019-11-16 00:12:28,797 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:28,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-16 00:12:28,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088868478] [2019-11-16 00:12:28,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:12:28,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:12:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:12:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:28,799 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 10 states. [2019-11-16 00:12:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:35,382 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-11-16 00:12:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:35,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-16 00:12:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:35,416 INFO L225 Difference]: With dead ends: 37 [2019-11-16 00:12:35,416 INFO L226 Difference]: Without dead ends: 19 [2019-11-16 00:12:35,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:12:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-16 00:12:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-16 00:12:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:12:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-16 00:12:35,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-11-16 00:12:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:35,421 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-16 00:12:35,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:12:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-16 00:12:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:12:35,421 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:35,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:35,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-16 00:12:35,626 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -677236169, now seen corresponding path program 1 times [2019-11-16 00:12:35,627 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:12:35,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354892022] [2019-11-16 00:12:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-16 00:12:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:36,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:12:36,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:36,659 INFO L375 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 31 [2019-11-16 00:12:36,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-16 00:12:36,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:36,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-16 00:12:36,708 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:36,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,712 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:36,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,726 INFO L496 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. [2019-11-16 00:12:36,726 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:20 [2019-11-16 00:12:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:36,776 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:12:36,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,829 INFO L375 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 4 case distinctions, treesize of input 40 treesize of output 40 [2019-11-16 00:12:36,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 36 [2019-11-16 00:12:36,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:36,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2019-11-16 00:12:36,905 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:36,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,915 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:36,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:36,924 INFO L496 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. [2019-11-16 00:12:36,924 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:21 [2019-11-16 00:12:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:37,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354892022] [2019-11-16 00:12:37,058 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:37,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-16 00:12:37,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120396852] [2019-11-16 00:12:37,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:12:37,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:12:37,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:12:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:12:37,060 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-11-16 00:12:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:38,623 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-16 00:12:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:12:38,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-16 00:12:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:38,978 INFO L225 Difference]: With dead ends: 24 [2019-11-16 00:12:38,978 INFO L226 Difference]: Without dead ends: 19 [2019-11-16 00:12:38,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:12:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-16 00:12:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-16 00:12:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:12:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2019-11-16 00:12:38,983 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 17 [2019-11-16 00:12:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:38,983 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2019-11-16 00:12:38,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:12:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2019-11-16 00:12:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:12:38,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:38,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:39,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-16 00:12:39,184 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:12:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash 471217663, now seen corresponding path program 1 times [2019-11-16 00:12:39,185 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:12:39,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126910029] [2019-11-16 00:12:39,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-16 00:12:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:40,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:12:40,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:40,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:40,675 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:12:43,318 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start___ieee754_log_~x (_ FloatingPoint 11 53))) (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log_~x ULTIMATE.start___ieee754_log_~x) c_~zero~0))) (fp.eq .cse0 .cse0)))) is different from true [2019-11-16 00:12:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:43,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126910029] [2019-11-16 00:12:43,328 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:43,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-16 00:12:43,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613628353] [2019-11-16 00:12:43,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:12:43,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:12:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:12:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2019-11-16 00:12:43,330 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 10 states. [2019-11-16 00:12:45,717 WARN L860 $PredicateComparison]: unable to prove that (and (= (_ +zero 11 53) c_~zero~0) (forall ((ULTIMATE.start___ieee754_log_~x (_ FloatingPoint 11 53))) (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log_~x ULTIMATE.start___ieee754_log_~x) c_~zero~0))) (fp.eq .cse0 .cse0))))) is different from true [2019-11-16 00:12:46,484 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-11-16 00:12:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:46,485 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-11-16 00:12:46,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:12:46,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-16 00:12:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:46,486 INFO L225 Difference]: With dead ends: 19 [2019-11-16 00:12:46,486 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:12:46,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=38, Invalid=78, Unknown=2, NotChecked=38, Total=156 [2019-11-16 00:12:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:12:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:12:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:12:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:12:46,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-16 00:12:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:46,488 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:46,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:12:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:12:46,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:12:46,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-16 00:12:46,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:12:47,638 WARN L191 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2019-11-16 00:12:49,963 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-16 00:12:52,799 WARN L191 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2019-11-16 00:12:55,230 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-16 00:12:57,126 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-16 00:12:57,128 INFO L446 ceAbstractionStarter]: At program point L159(lines 139 160) the Hoare annotation is: true [2019-11-16 00:12:57,128 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2019-11-16 00:12:57,129 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-16 00:12:57,130 INFO L439 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (= (_ +zero 11 53) ~zero~0) (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) [2019-11-16 00:12:57,130 INFO L443 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-16 00:12:57,130 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 156) no Hoare annotation was computed. [2019-11-16 00:12:57,130 INFO L439 ceAbstractionStarter]: At program point L137(line 137) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~lx~1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_10|)) (fp.lt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= ULTIMATE.start___ieee754_log_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)))) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (not (fp.eq |ULTIMATE.start___ieee754_log_#res| |ULTIMATE.start___ieee754_log_#res|)) (fp.lt ULTIMATE.start_main_~x~0 .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|))) [2019-11-16 00:12:57,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2019-11-16 00:12:57,130 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:12:57,131 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2019-11-16 00:12:57,131 INFO L439 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~lx~1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_10|)) (fp.lt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= ULTIMATE.start___ieee754_log_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)))) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (not (fp.eq |ULTIMATE.start___ieee754_log_#res| |ULTIMATE.start___ieee754_log_#res|)) (fp.lt ULTIMATE.start_main_~x~0 .cse0))) [2019-11-16 00:12:57,131 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2019-11-16 00:12:57,131 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:12:57,131 INFO L439 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2019-11-16 00:12:57,131 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:12:57,131 INFO L443 ceAbstractionStarter]: For program point L148-2(lines 148 157) no Hoare annotation was computed. [2019-11-16 00:12:57,132 INFO L443 ceAbstractionStarter]: For program point L148-4(lines 148 157) no Hoare annotation was computed. [2019-11-16 00:12:57,132 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:12:57,132 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2019-11-16 00:12:57,132 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2019-11-16 00:12:57,132 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2019-11-16 00:12:57,132 INFO L439 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= (_ +zero 11 53) ~zero~0) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (fp.lt ULTIMATE.start_main_~x~0 .cse0))) [2019-11-16 00:12:57,132 INFO L443 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2019-11-16 00:12:57,132 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 134) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (= (_ +zero 11 53) ~zero~0) (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) [2019-11-16 00:12:57,133 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2019-11-16 00:12:57,133 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2019-11-16 00:12:57,133 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2019-11-16 00:12:57,133 INFO L439 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2019-11-16 00:12:57,133 INFO L443 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2019-11-16 00:12:57,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:12:57 BoogieIcfgContainer [2019-11-16 00:12:57,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:12:57,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:12:57,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:12:57,172 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:12:57,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:27" (3/4) ... [2019-11-16 00:12:57,175 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:12:57,185 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-16 00:12:57,186 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-16 00:12:57,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32]) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) [2019-11-16 00:12:57,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32]) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && 1bv32 == \result [2019-11-16 00:12:57,259 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_af4dc45a-0f3c-46cc-8383-066f0456555d/bin/uautomizer/witness.graphml [2019-11-16 00:12:57,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:12:57,260 INFO L168 Benchmark]: Toolchain (without parser) took 53657.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.3 MB in the beginning and 858.5 MB in the end (delta: 93.9 MB). Peak memory consumption was 217.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:57,261 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:57,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:57,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.26 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. [2019-11-16 00:12:57,262 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:57,263 INFO L168 Benchmark]: RCFGBuilder took 23173.23 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: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:57,263 INFO L168 Benchmark]: TraceAbstraction took 29853.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.1 MB in the end (delta: 207.0 MB). Peak memory consumption was 207.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:57,264 INFO L168 Benchmark]: Witness Printer took 87.65 ms. Allocated memory is still 1.2 GB. Free memory was 865.1 MB in the beginning and 858.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:57,266 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.26 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. * Boogie Preprocessor took 41.59 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 23173.23 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: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29853.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 865.1 MB in the end (delta: 207.0 MB). Peak memory consumption was 207.0 MB. Max. memory is 11.5 GB. * Witness Printer took 87.65 ms. Allocated memory is still 1.2 GB. Free memory was 865.1 MB in the beginning and 858.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: 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: 139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant [2019-11-16 00:12:57,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32]) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant [2019-11-16 00:12:57,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~Pluszero~LONGDOUBLE() == zero) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 50]: Loop Invariant [2019-11-16 00:12:57,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~Pluszero~LONGDOUBLE() == zero && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 128]: Loop Invariant [2019-11-16 00:12:57,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~Pluszero~LONGDOUBLE() == zero) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 137]: Loop Invariant [2019-11-16 00:12:57,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-16 00:12:57,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-16 00:12:57,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32]) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && 1bv32 == \result - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 29.7s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.4s, HoareTripleCheckerStatistics: 128 SDtfs, 120 SDslu, 94 SDs, 0 SdLazy, 48 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 14 NumberOfFragments, 112 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 144 ConstructedInterpolants, 35 QuantifiedInterpolants, 14508 SizeOfPredicates, 21 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...