./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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 5fe31b16a9cb808afe0897c04a27b4a4516ff173 ............................................................................................................................................................................................................................................................................................................. 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_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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 5fe31b16a9cb808afe0897c04a27b4a4516ff173 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:16:42,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:16:42,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:16:42,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:16:42,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:16:42,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:16:42,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:16:42,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:16:42,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:16:42,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:16:42,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:16:42,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:16:42,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:16:42,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:16:42,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:16:42,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:16:42,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:16:42,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:16:42,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:16:42,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:16:42,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:16:42,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:16:42,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:16:42,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:16:42,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:16:42,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:16:42,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:16:42,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:16:42,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:16:42,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:16:42,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:16:42,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:16:42,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:16:42,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:16:42,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:16:42,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:16:42,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:16:42,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:16:42,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:16:42,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:16:42,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:16:42,782 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:16:42,794 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:16:42,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:16:42,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:16:42,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:16:42,795 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:16:42,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:16:42,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:16:42,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:16:42,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:16:42,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:16:42,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:16:42,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:16:42,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:16:42,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:16:42,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:16:42,798 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:16:42,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:16:42,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:16:42,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:16:42,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:16:42,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:16:42,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:16:42,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:16:42,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:16:42,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:16:42,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:16:42,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:16:42,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:16:42,801 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_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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 -> 5fe31b16a9cb808afe0897c04a27b4a4516ff173 [2019-11-20 01:16:42,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:16:42,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:16:42,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:16:42,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:16:42,947 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:16:42,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-20 01:16:43,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/8ff1519ed/c7a64450235c4a45bb8b3ad903682310/FLAGef0c5f14b [2019-11-20 01:16:43,459 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:16:43,470 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-20 01:16:43,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/8ff1519ed/c7a64450235c4a45bb8b3ad903682310/FLAGef0c5f14b [2019-11-20 01:16:43,795 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/8ff1519ed/c7a64450235c4a45bb8b3ad903682310 [2019-11-20 01:16:43,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:16:43,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:16:43,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:16:43,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:16:43,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:16:43,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:16:43" (1/1) ... [2019-11-20 01:16:43,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b52f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:43, skipping insertion in model container [2019-11-20 01:16:43,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:16:43" (1/1) ... [2019-11-20 01:16:43,811 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:16:43,846 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:16:44,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:16:44,086 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:16:44,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:16:44,176 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:16:44,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44 WrapperNode [2019-11-20 01:16:44,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:16:44,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:16:44,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:16:44,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:16:44,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:16:44,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:16:44,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:16:44,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:16:44,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... [2019-11-20 01:16:44,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:16:44,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:16:44,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:16:44,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:16:44,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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-20 01:16:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:16:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 01:16:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 01:16:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 01:16:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:16:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:16:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 01:16:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:16:45,127 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:16:45,127 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 01:16:45,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:16:45 BoogieIcfgContainer [2019-11-20 01:16:45,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:16:45,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:16:45,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:16:45,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:16:45,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:16:43" (1/3) ... [2019-11-20 01:16:45,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2611afee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:16:45, skipping insertion in model container [2019-11-20 01:16:45,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:44" (2/3) ... [2019-11-20 01:16:45,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2611afee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:16:45, skipping insertion in model container [2019-11-20 01:16:45,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:16:45" (3/3) ... [2019-11-20 01:16:45,137 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2019-11-20 01:16:45,143 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:16:45,149 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:16:45,156 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:16:45,180 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:16:45,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:16:45,181 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:16:45,181 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:16:45,181 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:16:45,181 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:16:45,181 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:16:45,182 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:16:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-20 01:16:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:16:45,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:45,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:45,210 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:45,216 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-20 01:16:45,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:45,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586062805] [2019-11-20 01:16:45,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:45,320 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-20 01:16:45,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586062805] [2019-11-20 01:16:45,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:45,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:16:45,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297522510] [2019-11-20 01:16:45,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:16:45,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:16:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:16:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:16:45,342 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-20 01:16:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:45,375 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-20 01:16:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:16:45,376 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 01:16:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:45,389 INFO L225 Difference]: With dead ends: 212 [2019-11-20 01:16:45,389 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 01:16:45,392 INFO L630 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-20 01:16:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 01:16:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 01:16:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 01:16:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-20 01:16:45,431 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-20 01:16:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:45,432 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-20 01:16:45,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:16:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-20 01:16:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:16:45,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:45,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:45,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-20 01:16:45,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:45,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909927887] [2019-11-20 01:16:45,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:16:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:16:45,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:16:45,610 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:16:45,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:16:45 BoogieIcfgContainer [2019-11-20 01:16:45,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:16:45,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:16:45,656 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:16:45,657 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:16:45,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:16:45" (3/4) ... [2019-11-20 01:16:45,659 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 01:16:45,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:16:45,661 INFO L168 Benchmark]: Toolchain (without parser) took 1862.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -99.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:45,662 INFO L168 Benchmark]: CDTParser took 0.22 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-20 01:16:45,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:45,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.72 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-20 01:16:45,663 INFO L168 Benchmark]: Boogie Preprocessor took 61.38 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:45,664 INFO L168 Benchmark]: RCFGBuilder took 827.01 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:45,664 INFO L168 Benchmark]: TraceAbstraction took 526.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:45,665 INFO L168 Benchmark]: Witness Printer took 3.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:16:45,667 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.22 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.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.72 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 61.38 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 827.01 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 526.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 234]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = __VERIFIER_nondet_float(); [L230] float y = -1.0f / 0.0f; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L97] COND FALSE !(hb > ha) [L104] a = x [L105] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L231] float res = __ieee754_hypotf(x, y); [L212] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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-678e011 [2019-11-20 01:16:47,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:16:47,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:16:47,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:16:47,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:16:47,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:16:47,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:16:47,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:16:47,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:16:47,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:16:47,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:16:47,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:16:47,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:16:47,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:16:47,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:16:47,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:16:47,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:16:47,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:16:47,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:16:47,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:16:47,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:16:47,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:16:47,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:16:47,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:16:47,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:16:47,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:16:47,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:16:47,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:16:47,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:16:47,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:16:47,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:16:47,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:16:47,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:16:47,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:16:47,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:16:47,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:16:47,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:16:47,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:16:47,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:16:47,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:16:47,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:16:47,519 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 01:16:47,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:16:47,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:16:47,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:16:47,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:16:47,542 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:16:47,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:16:47,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:16:47,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:16:47,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:16:47,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:16:47,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:16:47,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:16:47,545 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:16:47,545 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:16:47,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:16:47,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:16:47,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:16:47,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:16:47,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:16:47,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:16:47,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:16:47,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:16:47,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:16:47,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:16:47,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:16:47,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:16:47,549 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:16:47,549 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:16:47,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:16:47,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:16:47,550 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_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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 -> 5fe31b16a9cb808afe0897c04a27b4a4516ff173 [2019-11-20 01:16:47,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:16:47,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:16:47,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:16:47,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:16:47,915 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:16:47,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-20 01:16:47,967 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/89c8eb8a0/7438498293604f18b06df054d6c8929b/FLAG09f1bf3a7 [2019-11-20 01:16:48,388 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:16:48,389 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-20 01:16:48,395 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/89c8eb8a0/7438498293604f18b06df054d6c8929b/FLAG09f1bf3a7 [2019-11-20 01:16:48,407 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/data/89c8eb8a0/7438498293604f18b06df054d6c8929b [2019-11-20 01:16:48,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:16:48,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:16:48,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:16:48,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:16:48,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:16:48,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:48,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d536ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48, skipping insertion in model container [2019-11-20 01:16:48,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:48,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:16:48,448 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:16:48,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:16:48,679 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:16:48,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:16:48,887 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:16:48,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48 WrapperNode [2019-11-20 01:16:48,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:16:48,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:16:48,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:16:48,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:16:48,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:48,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:48,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:16:48,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:16:48,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:16:48,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:16:48,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:48,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:48,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:48,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:49,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:49,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:49,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... [2019-11-20 01:16:49,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:16:49,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:16:49,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:16:49,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:16:49,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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-20 01:16:49,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:16:49,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-11-20 01:16:49,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 01:16:49,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:16:49,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:16:49,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-20 01:16:49,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 01:16:49,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:16:55,327 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:16:55,328 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 01:16:55,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:16:55 BoogieIcfgContainer [2019-11-20 01:16:55,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:16:55,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:16:55,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:16:55,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:16:55,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:16:48" (1/3) ... [2019-11-20 01:16:55,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bab211e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:16:55, skipping insertion in model container [2019-11-20 01:16:55,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:16:48" (2/3) ... [2019-11-20 01:16:55,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bab211e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:16:55, skipping insertion in model container [2019-11-20 01:16:55,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:16:55" (3/3) ... [2019-11-20 01:16:55,336 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2019-11-20 01:16:55,346 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:16:55,352 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:16:55,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:16:55,382 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:16:55,382 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:16:55,382 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:16:55,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:16:55,382 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:16:55,383 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:16:55,383 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:16:55,383 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:16:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-20 01:16:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:16:55,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:55,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:55,405 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-20 01:16:55,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:16:55,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608460906] [2019-11-20 01:16:55,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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-20 01:16:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:55,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 01:16:55,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:55,550 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-20 01:16:55,550 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:16:55,554 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-20 01:16:55,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608460906] [2019-11-20 01:16:55,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:55,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:16:55,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295654805] [2019-11-20 01:16:55,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:16:55,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:16:55,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:16:55,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:16:55,571 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-20 01:16:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:55,597 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-20 01:16:55,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:16:55,598 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 01:16:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:55,609 INFO L225 Difference]: With dead ends: 212 [2019-11-20 01:16:55,609 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 01:16:55,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-20 01:16:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 01:16:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 01:16:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 01:16:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-20 01:16:55,653 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-20 01:16:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:55,653 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-20 01:16:55,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:16:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-20 01:16:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:16:55,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:55,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:55,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 01:16:55,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-20 01:16:55,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:16:55,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984665510] [2019-11-20 01:16:55,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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-20 01:16:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:56,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:16:56,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:56,272 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-20 01:16:56,272 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:16:56,763 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-20 01:16:56,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984665510] [2019-11-20 01:16:56,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:16:56,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 01:16:56,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115357057] [2019-11-20 01:16:56,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:16:56,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:16:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:16:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:16:56,767 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 12 states. [2019-11-20 01:16:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:58,679 INFO L93 Difference]: Finished difference Result 444 states and 576 transitions. [2019-11-20 01:16:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:16:58,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-20 01:16:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:58,689 INFO L225 Difference]: With dead ends: 444 [2019-11-20 01:16:58,689 INFO L226 Difference]: Without dead ends: 358 [2019-11-20 01:16:58,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:16:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-20 01:16:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 113. [2019-11-20 01:16:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-20 01:16:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2019-11-20 01:16:58,730 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 21 [2019-11-20 01:16:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:58,731 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2019-11-20 01:16:58,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:16:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2019-11-20 01:16:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:16:58,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:58,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:58,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 01:16:58,950 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2019-11-20 01:16:58,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:16:58,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097622848] [2019-11-20 01:16:58,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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-20 01:16:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:59,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 01:16:59,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:00,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:17:00,736 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-20 01:17:00,736 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:17:02,161 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-20 01:17:03,035 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 01:17:04,530 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 01:17:05,813 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 01:17:07,435 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 01:17:18,147 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-20 01:17:18,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097622848] [2019-11-20 01:17:18,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:18,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 26 [2019-11-20 01:17:18,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211696038] [2019-11-20 01:17:18,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 01:17:18,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:17:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 01:17:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=566, Unknown=1, NotChecked=0, Total=650 [2019-11-20 01:17:18,151 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 26 states. [2019-11-20 01:17:21,368 WARN L191 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 01:17:23,377 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-20 01:17:25,475 WARN L191 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-20 01:17:29,170 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-20 01:17:33,454 WARN L191 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-20 01:17:37,219 WARN L191 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-20 01:17:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:37,414 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2019-11-20 01:17:37,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:17:37,415 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 21 [2019-11-20 01:17:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:37,415 INFO L225 Difference]: With dead ends: 157 [2019-11-20 01:17:37,416 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 01:17:37,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=304, Invalid=1101, Unknown=1, NotChecked=0, Total=1406 [2019-11-20 01:17:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 01:17:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-11-20 01:17:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 01:17:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-20 01:17:37,421 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2019-11-20 01:17:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:37,421 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-20 01:17:37,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 01:17:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-20 01:17:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:17:37,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:37,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:37,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 01:17:37,636 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:17:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-11-20 01:17:37,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:17:37,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089298830] [2019-11-20 01:17:37,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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-20 01:17:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:37,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 01:17:37,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:38,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:17:38,068 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-20 01:17:38,068 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:17:40,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2019-11-20 01:17:42,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_2_5 (_ BitVec 32)) (v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= c_ULTIMATE.start___ieee754_hypotf_~y (fp ((_ extract 31 31) v_skolemized_v_prenex_2_5) ((_ extract 30 23) v_skolemized_v_prenex_2_5) ((_ extract 22 0) v_skolemized_v_prenex_2_5)))) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)) (let ((.cse0 (bvand (_ bv2147483647 32) v_skolemized_v_prenex_2_5))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2019-11-20 01:17:42,665 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-20 01:17:42,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089298830] [2019-11-20 01:17:42,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:42,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-20 01:17:42,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402053603] [2019-11-20 01:17:42,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:17:42,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:17:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:17:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=336, Unknown=2, NotChecked=74, Total=462 [2019-11-20 01:17:42,667 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 22 states. [2019-11-20 01:17:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:43,875 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-11-20 01:17:43,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:17:43,876 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-20 01:17:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:43,877 INFO L225 Difference]: With dead ends: 54 [2019-11-20 01:17:43,877 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 01:17:43,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=207, Invalid=729, Unknown=2, NotChecked=118, Total=1056 [2019-11-20 01:17:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 01:17:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-20 01:17:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 01:17:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-20 01:17:43,882 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2019-11-20 01:17:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:43,882 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-20 01:17:43,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:17:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-20 01:17:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:17:43,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:43,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:44,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 01:17:44,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:17:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2019-11-20 01:17:44,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:17:44,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970183956] [2019-11-20 01:17:44,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/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-20 01:17:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:44,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:17:44,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:44,292 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-20 01:17:44,293 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:17:44,447 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-20 01:17:44,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970183956] [2019-11-20 01:17:44,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:44,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 01:17:44,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490262761] [2019-11-20 01:17:44,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:17:44,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:17:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:17:44,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:17:44,449 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2019-11-20 01:17:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:44,727 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-20 01:17:44,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:17:44,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-20 01:17:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:44,728 INFO L225 Difference]: With dead ends: 36 [2019-11-20 01:17:44,728 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 01:17:44,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:17:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 01:17:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 01:17:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 01:17:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-20 01:17:44,732 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2019-11-20 01:17:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:44,732 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-20 01:17:44,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:17:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-20 01:17:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:17:44,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:17:44,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:17:44,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 01:17:44,934 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:17:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:17:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2115534276, now seen corresponding path program 1 times [2019-11-20 01:17:44,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:17:44,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68742457] [2019-11-20 01:17:44,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d88869f-3cca-4cd0-9b46-c3fd0669a7f8/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 01:17:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:17:45,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 01:17:45,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:17:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:17:45,321 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-20 01:17:45,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:17:47,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5) (_ bv2155872256 32)) (_ bv0 32)))) is different from false [2019-11-20 01:17:49,856 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_2_7 (_ BitVec 32)) (v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) (let ((.cse0 (bvand (_ bv2147483647 32) v_skolemized_v_prenex_2_7))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5) (_ bv2155872256 32)) (_ bv0 32)) (not (= c_ULTIMATE.start___ieee754_hypotf_~y (fp ((_ extract 31 31) v_skolemized_v_prenex_2_7) ((_ extract 30 23) v_skolemized_v_prenex_2_7) ((_ extract 22 0) v_skolemized_v_prenex_2_7)))))) is different from false [2019-11-20 01:17:49,875 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-20 01:17:49,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68742457] [2019-11-20 01:17:49,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:17:49,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2019-11-20 01:17:49,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994632636] [2019-11-20 01:17:49,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 01:17:49,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:17:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 01:17:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=413, Unknown=2, NotChecked=82, Total=552 [2019-11-20 01:17:49,879 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 24 states. [2019-11-20 01:17:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:17:50,966 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-20 01:17:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:17:50,966 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-11-20 01:17:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:17:50,966 INFO L225 Difference]: With dead ends: 27 [2019-11-20 01:17:50,967 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:17:50,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=190, Invalid=808, Unknown=2, NotChecked=122, Total=1122 [2019-11-20 01:17:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:17:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:17:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:17:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:17:50,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-20 01:17:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:17:50,968 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:17:50,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 01:17:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:17:50,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:17:51,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 01:17:51,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:17:51,357 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 156 [2019-11-20 01:17:53,311 WARN L191 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 156 DAG size of output: 95 [2019-11-20 01:18:01,357 WARN L191 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 185 DAG size of output: 118 [2019-11-20 01:18:05,023 WARN L191 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 166 DAG size of output: 102 [2019-11-20 01:18:05,067 INFO L444 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-11-20 01:18:05,067 INFO L444 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-11-20 01:18:05,067 INFO L444 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-11-20 01:18:05,067 INFO L444 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2019-11-20 01:18:05,067 INFO L444 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-11-20 01:18:05,067 INFO L440 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-11-20 01:18:05,068 INFO L444 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-11-20 01:18:05,068 INFO L444 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-11-20 01:18:05,068 INFO L440 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-11-20 01:18:05,068 INFO L444 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-11-20 01:18:05,068 INFO L447 ceAbstractionStarter]: At program point L237(lines 222 238) the Hoare annotation is: true [2019-11-20 01:18:05,068 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-11-20 01:18:05,068 INFO L444 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-11-20 01:18:05,068 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-11-20 01:18:05,068 INFO L440 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-11-20 01:18:05,069 INFO L444 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-11-20 01:18:05,069 INFO L444 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-11-20 01:18:05,069 INFO L440 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-11-20 01:18:05,069 INFO L444 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-11-20 01:18:05,069 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-11-20 01:18:05,069 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L440 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse2 (let ((.cse6 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (or (and .cse6 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse6 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0))))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~hb~0) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse5) .cse4) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse2 (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))))) [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-11-20 01:18:05,070 INFO L440 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-11-20 01:18:05,070 INFO L444 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-11-20 01:18:05,071 INFO L440 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-11-20 01:18:05,071 INFO L440 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-11-20 01:18:05,071 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-11-20 01:18:05,071 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-11-20 01:18:05,071 INFO L444 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 01:18:05,071 INFO L444 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-11-20 01:18:05,071 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-11-20 01:18:05,071 INFO L444 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-11-20 01:18:05,074 INFO L440 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse4 (let ((.cse9 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (or (and .cse9 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse9 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0))))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse1) .cse0) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse3) .cse2) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse4 (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ULTIMATE.start_isinf_float_~x) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~hb~0) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) .cse4 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))))) [2019-11-20 01:18:05,074 INFO L444 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-11-20 01:18:05,074 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-11-20 01:18:05,074 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-11-20 01:18:05,074 INFO L440 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-11-20 01:18:05,075 INFO L444 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-11-20 01:18:05,075 INFO L440 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-11-20 01:18:05,075 INFO L444 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-11-20 01:18:05,075 INFO L440 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-11-20 01:18:05,075 INFO L444 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-11-20 01:18:05,075 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-11-20 01:18:05,075 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-20 01:18:05,075 INFO L440 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-11-20 01:18:05,076 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:18:05,077 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-11-20 01:18:05,077 INFO L440 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-11-20 01:18:05,077 INFO L444 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-11-20 01:18:05,077 INFO L440 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse7 (= (bvadd |ULTIMATE.start_isinf_float_#res| (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (let ((.cse13 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (or (and .cse13 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse13 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0))))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse1) .cse0) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse3) .cse2) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (bvsgt (bvadd (bvneg .cse5) .cse4) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse6 .cse7 (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (let ((.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ULTIMATE.start_isinf_float_~x) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse11 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) .cse7 (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~hb~0) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) .cse6 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse12 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))))) [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L440 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L440 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-11-20 01:18:05,078 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L440 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-11-20 01:18:05,079 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 236) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L440 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-11-20 01:18:05,080 INFO L440 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-11-20 01:18:05,080 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-11-20 01:18:05,084 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 01:18:05,097 INFO L168 Benchmark]: Toolchain (without parser) took 76681.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.1 MB). Free memory was 959.1 MB in the beginning and 933.7 MB in the end (delta: 25.4 MB). Peak memory consumption was 275.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:18:05,097 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:18:05,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:18:05,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.61 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:18:05,099 INFO L168 Benchmark]: Boogie Preprocessor took 67.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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:18:05,102 INFO L168 Benchmark]: RCFGBuilder took 6306.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:18:05,103 INFO L168 Benchmark]: TraceAbstraction took 69760.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 134.1 MB). Peak memory consumption was 239.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:18:05,109 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.49 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 477.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.61 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6306.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69760.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 134.1 MB). Peak memory consumption was 239.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...