./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fd0e678ea36c7b474907750a18ff4e57877f684 ............................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fd0e678ea36c7b474907750a18ff4e57877f684 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:11:41,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:11:41,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:11:41,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:11:41,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:11:41,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:11:41,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:11:41,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:11:41,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:11:41,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:11:41,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:11:41,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:11:41,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:11:41,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:11:41,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:11:41,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:11:41,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:11:41,804 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:11:41,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:11:41,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:11:41,807 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:11:41,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:11:41,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:11:41,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:11:41,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:11:41,810 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:11:41,811 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:11:41,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:11:41,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:11:41,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:11:41,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:11:41,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:11:41,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:11:41,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:11:41,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:11:41,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:11:41,815 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:11:41,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:11:41,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:11:41,826 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:11:41,826 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:11:41,826 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:11:41,826 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:11:41,826 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:11:41,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:11:41,827 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:11:41,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:11:41,827 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:11:41,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:11:41,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:11:41,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:11:41,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:11:41,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:11:41,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:11:41,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:11:41,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:11:41,829 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:11:41,829 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:11:41,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:11:41,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-11-10 10:11:41,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:11:41,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:11:41,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:11:41,866 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:11:41,867 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:11:41,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 10:11:41,912 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/429eca2a0/fdc3eb6af9ff4564b0ac497d0519c39e/FLAG846e494ed [2018-11-10 10:11:42,315 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:11:42,315 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 10:11:42,320 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/429eca2a0/fdc3eb6af9ff4564b0ac497d0519c39e/FLAG846e494ed [2018-11-10 10:11:42,330 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/429eca2a0/fdc3eb6af9ff4564b0ac497d0519c39e [2018-11-10 10:11:42,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:11:42,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:11:42,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:11:42,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:11:42,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:11:42,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56afb46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42, skipping insertion in model container [2018-11-10 10:11:42,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:11:42,358 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:11:42,463 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:11:42,465 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:11:42,478 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:11:42,487 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:11:42,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42 WrapperNode [2018-11-10 10:11:42,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:11:42,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:11:42,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:11:42,487 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:11:42,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... [2018-11-10 10:11:42,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:11:42,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:11:42,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:11:42,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:11:42,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:11:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:11:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:11:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 10:11:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:11:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:11:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 10:11:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 10:11:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-10 10:11:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:11:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:11:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:11:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:11:42,687 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:11:42,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:11:42 BoogieIcfgContainer [2018-11-10 10:11:42,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:11:42,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:11:42,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:11:42,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:11:42,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:11:42" (1/3) ... [2018-11-10 10:11:42,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188f9904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:11:42, skipping insertion in model container [2018-11-10 10:11:42,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:42" (2/3) ... [2018-11-10 10:11:42,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188f9904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:11:42, skipping insertion in model container [2018-11-10 10:11:42,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:11:42" (3/3) ... [2018-11-10 10:11:42,693 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-10 10:11:42,701 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:11:42,707 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:11:42,719 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:11:42,743 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:11:42,744 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:11:42,744 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:11:42,744 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:11:42,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:11:42,744 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:11:42,744 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:11:42,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:11:42,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:11:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-10 10:11:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:11:42,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:11:42,763 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:11:42,764 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:11:42,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:11:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-10 10:11:42,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:11:42,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:11:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:11:42,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:11:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:11:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:42,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:11:42,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:11:42,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:11:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:11:42,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:11:42,867 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 10:11:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:11:42,884 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-10 10:11:42,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:11:42,885 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 10:11:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:11:42,890 INFO L225 Difference]: With dead ends: 35 [2018-11-10 10:11:42,890 INFO L226 Difference]: Without dead ends: 16 [2018-11-10 10:11:42,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:11:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-10 10:11:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 10:11:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 10:11:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 10:11:42,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-10 10:11:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:11:42,914 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 10:11:42,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:11:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-10 10:11:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:11:42,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:11:42,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:11:42,915 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:11:42,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:11:42,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-10 10:11:42,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:11:42,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:11:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:11:42,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:11:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:11:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:42,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:11:42,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:11:42,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:11:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:11:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:11:42,974 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-10 10:11:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:11:42,997 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-10 10:11:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:11:42,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 10:11:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:11:42,998 INFO L225 Difference]: With dead ends: 30 [2018-11-10 10:11:42,998 INFO L226 Difference]: Without dead ends: 20 [2018-11-10 10:11:42,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:11:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-10 10:11:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-10 10:11:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 10:11:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 10:11:43,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-10 10:11:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:11:43,003 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 10:11:43,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:11:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-10 10:11:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:11:43,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:11:43,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:11:43,004 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:11:43,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:11:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-10 10:11:43,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:11:43,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:11:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:11:43,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:11:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:11:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:11:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:11:43,036 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:11:43,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:11:43 BoogieIcfgContainer [2018-11-10 10:11:43,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:11:43,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:11:43,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:11:43,053 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:11:43,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:11:42" (3/4) ... [2018-11-10 10:11:43,056 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:11:43,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:11:43,057 INFO L168 Benchmark]: Toolchain (without parser) took 723.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:11:43,059 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:11:43,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:11:43,060 INFO L168 Benchmark]: Boogie Preprocessor took 20.14 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:11:43,060 INFO L168 Benchmark]: RCFGBuilder took 179.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:11:43,062 INFO L168 Benchmark]: TraceAbstraction took 364.47 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:11:43,062 INFO L168 Benchmark]: Witness Printer took 3.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:11:43,065 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.14 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 364.47 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 14, overapproximation of to_real at line 12, overapproximation of someBinaryArithmeticFLOAToperation at line 27. Possible FailurePath: [L5] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L11] float x = __VERIFIER_nondet_float() ; [L12] float octant1 = 0 ; [L13] float octant2 = pi/8 ; [L15] float oddExp = x ; [L16] float evenExp = 1.0 ; [L17] float term = x ; [L18] unsigned int count = 2 ; [L19] int multFactor = 0 ; [L20] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L22] COND TRUE 1 [L24] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] COND FALSE, EXPR !((count>>1 % 2 == 0) ? 1 : -1) VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L27] evenExp = evenExp + multFactor*term [L29] count++ [L31] term = term * (x/count) [L33] oddExp = oddExp + multFactor*term [L35] count++ [L37] temp = __VERIFIER_nondet_int() [L38] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=3] [L41] CALL __VERIFIER_assert( evenExp >= oddExp ) VAL [\old(cond)=0, pi=314159/100000] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 1 SDslu, 13 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:11:44,472 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:11:44,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:11:44,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:11:44,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:11:44,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:11:44,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:11:44,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:11:44,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:11:44,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:11:44,487 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:11:44,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:11:44,488 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:11:44,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:11:44,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:11:44,490 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:11:44,491 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:11:44,492 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:11:44,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:11:44,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:11:44,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:11:44,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:11:44,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:11:44,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:11:44,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:11:44,500 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:11:44,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:11:44,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:11:44,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:11:44,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:11:44,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:11:44,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:11:44,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:11:44,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:11:44,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:11:44,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:11:44,506 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 10:11:44,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:11:44,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:11:44,517 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:11:44,518 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:11:44,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:11:44,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:11:44,518 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:11:44,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:11:44,519 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:11:44,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:11:44,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:11:44,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:11:44,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:11:44,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:11:44,520 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:11:44,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:11:44,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:11:44,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:11:44,521 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:11:44,521 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:11:44,521 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 10:11:44,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:11:44,521 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:11:44,521 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:11:44,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-11-10 10:11:44,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:11:44,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:11:44,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:11:44,563 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:11:44,563 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:11:44,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 10:11:44,600 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/d5b82314c/900c37a3cf7c46069d70ccad4fa89515/FLAG787c3313a [2018-11-10 10:11:44,922 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:11:44,922 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 10:11:44,926 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/d5b82314c/900c37a3cf7c46069d70ccad4fa89515/FLAG787c3313a [2018-11-10 10:11:44,936 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/data/d5b82314c/900c37a3cf7c46069d70ccad4fa89515 [2018-11-10 10:11:44,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:11:44,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:11:44,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:11:44,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:11:44,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:11:44,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:11:44" (1/1) ... [2018-11-10 10:11:44,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff5fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:44, skipping insertion in model container [2018-11-10 10:11:44,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:11:44" (1/1) ... [2018-11-10 10:11:44,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:11:44,965 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:11:45,085 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:11:45,089 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:11:45,105 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:11:45,117 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:11:45,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45 WrapperNode [2018-11-10 10:11:45,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:11:45,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:11:45,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:11:45,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:11:45,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... [2018-11-10 10:11:45,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... [2018-11-10 10:11:45,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... [2018-11-10 10:11:45,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... [2018-11-10 10:11:45,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... [2018-11-10 10:11:45,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... [2018-11-10 10:11:45,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... [2018-11-10 10:11:45,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:11:45,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:11:45,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:11:45,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:11:45,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:11:45,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:11:45,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:11:45,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 10:11:45,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:11:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:11:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 10:11:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 10:11:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-10 10:11:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:11:45,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:11:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:11:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:11:48,670 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:11:48,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:11:48 BoogieIcfgContainer [2018-11-10 10:11:48,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:11:48,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:11:48,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:11:48,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:11:48,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:11:44" (1/3) ... [2018-11-10 10:11:48,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316bd385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:11:48, skipping insertion in model container [2018-11-10 10:11:48,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:11:45" (2/3) ... [2018-11-10 10:11:48,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316bd385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:11:48, skipping insertion in model container [2018-11-10 10:11:48,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:11:48" (3/3) ... [2018-11-10 10:11:48,678 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-10 10:11:48,685 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:11:48,691 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:11:48,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:11:48,718 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:11:48,718 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:11:48,718 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:11:48,719 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:11:48,719 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:11:48,719 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:11:48,719 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:11:48,719 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:11:48,719 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:11:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-10 10:11:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 10:11:48,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:11:48,735 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:11:48,737 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:11:48,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:11:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-10 10:11:48,743 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:11:48,744 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-10 10:11:48,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:11:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:48,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:11:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:48,800 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:11:48,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:11:48,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:11:48,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:11:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:11:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:11:48,822 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 10:11:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:11:48,837 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-10 10:11:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:11:48,838 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 10:11:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:11:48,843 INFO L225 Difference]: With dead ends: 35 [2018-11-10 10:11:48,843 INFO L226 Difference]: Without dead ends: 16 [2018-11-10 10:11:48,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:11:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-10 10:11:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 10:11:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 10:11:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 10:11:48,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-10 10:11:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:11:48,867 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 10:11:48,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:11:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-10 10:11:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:11:48,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:11:48,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:11:48,868 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:11:48,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:11:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-10 10:11:48,869 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:11:48,869 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 10:11:48,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:11:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:49,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:11:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:49,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:11:49,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:11:49,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:11:49,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:11:49,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:11:49,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:11:49,574 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-10 10:11:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:11:54,507 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-10 10:11:54,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:11:54,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 10:11:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:11:54,508 INFO L225 Difference]: With dead ends: 30 [2018-11-10 10:11:54,508 INFO L226 Difference]: Without dead ends: 20 [2018-11-10 10:11:54,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:11:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-10 10:11:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-10 10:11:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 10:11:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 10:11:54,512 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-10 10:11:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:11:54,513 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 10:11:54,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:11:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-10 10:11:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:11:54,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:11:54,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:11:54,514 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:11:54,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:11:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-10 10:11:54,514 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:11:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-10 10:11:54,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:11:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:11:56,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:15,812 WARN L179 SmtUtils]: Spent 13.23 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 10:12:17,829 WARN L832 $PredicateComparison]: unable to prove that (and (= c_main_~x~0 c_main_~oddExp~0) (= (bvadd c_main_~count~0 (_ bv4294967294 32)) (_ bv0 32)) (= c_main_~evenExp~0 ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))) (= c_main_~term~0 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) is different from false [2018-11-10 10:12:20,132 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (and (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (fp.add RNE main_~x~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) c_main_~oddExp~0) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:12:22,397 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (and (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (fp.add RNE main_~x~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) c_main_~oddExp~0) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:12:34,133 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (fp.geq (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE main_~x~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (fp.lt v_prenex_2 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (let ((.cse2 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE v_prenex_2 (fp.div RNE v_prenex_2 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (fp.geq (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse2 .cse3)) (fp.add RNE v_prenex_2 (fp.mul RNE .cse2 (fp.mul RNE .cse3 (fp.div RNE v_prenex_2 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))))) (fp.gt v_prenex_2 ((_ to_fp 8 24) RNE (_ bv0 32))))) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-10 10:12:45,893 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (fp.lt v_prenex_2 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE v_prenex_2 (fp.div RNE v_prenex_2 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (fp.geq (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE v_prenex_2 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE v_prenex_2 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))))) (fp.gt v_prenex_2 ((_ to_fp 8 24) RNE (_ bv0 32))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse2 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (fp.geq (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse2 .cse3)) (fp.add RNE main_~x~0 (fp.mul RNE .cse2 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from false [2018-11-10 10:12:52,777 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (fp.geq (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE main_~x~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from false [2018-11-10 10:12:55,054 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (fp.geq (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE main_~x~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from true [2018-11-10 10:12:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:12:55,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:12:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:12:55,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:12:55,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:12:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:12:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=16, Unknown=7, NotChecked=50, Total=90 [2018-11-10 10:12:55,075 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-11-10 10:13:27,104 WARN L179 SmtUtils]: Spent 23.50 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 10:13:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:13:34,959 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-10 10:13:35,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:13:35,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-10 10:13:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:13:35,041 INFO L225 Difference]: With dead ends: 26 [2018-11-10 10:13:35,041 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 10:13:35,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=25, Invalid=30, Unknown=7, NotChecked=70, Total=132 [2018-11-10 10:13:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 10:13:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 10:13:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 10:13:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 10:13:35,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-10 10:13:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:13:35,047 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 10:13:35,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:13:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-10 10:13:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:13:35,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:13:35,048 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:13:35,048 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:13:35,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:13:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1908428422, now seen corresponding path program 1 times [2018-11-10 10:13:35,048 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:13:35,048 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-10 10:13:35,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:13:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:36,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:13:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:36,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:13:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:36,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:13:36,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 10:13:36,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:13:36,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:13:36,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:13:36,422 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-10 10:13:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:13:45,617 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-10 10:13:45,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:13:45,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-10 10:13:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:13:45,619 INFO L225 Difference]: With dead ends: 41 [2018-11-10 10:13:45,619 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 10:13:45,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:13:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 10:13:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-10 10:13:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 10:13:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 10:13:45,624 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2018-11-10 10:13:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:13:45,624 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 10:13:45,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:13:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-10 10:13:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:13:45,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:13:45,625 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:13:45,625 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:13:45,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:13:45,626 INFO L82 PathProgramCache]: Analyzing trace with hash -611531512, now seen corresponding path program 1 times [2018-11-10 10:13:45,626 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:13:45,626 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-10 10:13:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:14:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:16,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:14:41,633 WARN L179 SmtUtils]: Spent 19.09 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 10:15:12,878 WARN L179 SmtUtils]: Spent 25.67 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 10:15:15,178 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (_ bv4 32) c_main_~count~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from false [2018-11-10 10:15:17,590 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse2))) (= (_ bv4 32) c_main_~count~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:15:19,901 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse2))) (= (_ bv4 32) c_main_~count~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:15:22,262 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse1 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (and (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))))) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 .cse2))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from false [2018-11-10 10:15:24,575 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse1 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (and (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))))) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 .cse2))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from true [2018-11-10 10:15:36,632 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_5 ((_ to_fp 8 24) RNE (_ bv0 32))) (fp.lt v_prenex_5 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (let ((.cse1 (fp.mul RNE v_prenex_5 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE v_prenex_5 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))))))))))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse5 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse7 (fp.mul RNE .cse5 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse6 (fp.mul RNE .cse7 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse4 .cse5)) (fp.mul RNE .cse4 .cse6)) (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse4 .cse7)) (fp.mul RNE .cse4 (fp.mul RNE .cse6 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from false [2018-11-10 10:15:48,680 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) (and (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_5 ((_ to_fp 8 24) RNE (_ bv0 32))) (fp.lt v_prenex_5 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (let ((.cse5 (fp.mul RNE v_prenex_5 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse7 (fp.mul RNE .cse5 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse6 (fp.mul RNE .cse7 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse4 .cse5)) (fp.mul RNE .cse4 .cse6)) (fp.add RNE (fp.add RNE v_prenex_5 (fp.mul RNE .cse4 .cse7)) (fp.mul RNE .cse4 (fp.mul RNE .cse6 (fp.div RNE v_prenex_5 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-10 10:15:55,816 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from false [2018-11-10 10:15:58,167 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from true [2018-11-10 10:15:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-10 10:15:58,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:16:07,736 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-10 10:16:09,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-10 10:16:11,892 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-10 10:16:13,963 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-10 10:16:16,090 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-10 10:16:18,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-10 10:16:20,430 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse1 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-10 10:16:22,640 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse1 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-10 10:16:24,848 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-10 10:16:27,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-10 10:16:29,290 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-10 10:16:31,519 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-10 10:16:34,463 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) RNE (_ bv0 32)))) (let ((.cse1 (fp.mul RNE v_main_~oddExp~0_14 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE v_main_~oddExp~0_14 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))))))) (not (fp.lt v_main_~oddExp~0_14 (fp.div RNE c_~pi~0 ((_ to_fp 8 24) RNE (_ bv8 32))))))) is different from true [2018-11-10 10:16:41,462 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) RNE (_ bv0 32)))) (let ((.cse1 (fp.mul RNE v_main_~oddExp~0_14 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE v_main_~oddExp~0_14 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))))))) (not (fp.lt v_main_~oddExp~0_14 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32))))))) is different from false [2018-11-10 10:16:43,791 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) RNE (_ bv0 32)))) (let ((.cse1 (fp.mul RNE v_main_~oddExp~0_14 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (fp.geq (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE v_main_~oddExp~0_14 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))))))) (not (fp.lt v_main_~oddExp~0_14 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32))))))) is different from true [2018-11-10 10:16:43,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:16:43,812 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:16:43,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:16:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-10 10:16:56,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:16:56,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-10 10:16:56,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:16:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:16:56,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=58, Unknown=25, NotChecked=420, Total=552 [2018-11-10 10:16:56,860 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 13 states. [2018-11-10 10:17:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:17:12,463 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-10 10:17:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:17:12,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-10 10:17:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:17:12,479 INFO L225 Difference]: With dead ends: 36 [2018-11-10 10:17:12,479 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 10:17:12,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 120.1s TimeCoverageRelationStatistics Valid=54, Invalid=71, Unknown=25, NotChecked=450, Total=600 [2018-11-10 10:17:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 10:17:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-10 10:17:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 10:17:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-10 10:17:12,484 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-11-10 10:17:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:17:12,484 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-10 10:17:12,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:17:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-10 10:17:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:17:12,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:17:12,485 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:17:12,485 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:17:12,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:17:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash 497228205, now seen corresponding path program 2 times [2018-11-10 10:17:12,486 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:17:12,486 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-10 10:17:12,489 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 10:18:03,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:18:03,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:18:03,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:18:27,897 WARN L179 SmtUtils]: Spent 17.77 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 10:18:57,828 WARN L179 SmtUtils]: Spent 23.81 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 10:19:00,113 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (= (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))) c_main_~term~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from false [2018-11-10 10:19:02,532 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (and (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse2)) c_main_~oddExp~0) (= (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:19:04,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (and (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse2)) c_main_~oddExp~0) (= (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 10:19:06,904 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (and (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse2)) c_main_~oddExp~0) (= (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))) c_main_~term~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:19:09,729 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 c_main_~term~0))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from false [2018-11-10 10:19:12,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 c_main_~term~0))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-11-10 10:19:14,401 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse4 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse0 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 .cse4))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from false [2018-11-10 10:19:16,759 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse4 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse0 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 .cse4))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from false [2018-11-10 10:19:19,278 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (and (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))))) is different from false [2018-11-10 10:19:21,742 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (and (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))))) is different from true [2018-11-10 10:19:34,800 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_7 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (let ((.cse1 (fp.mul RNE v_prenex_7 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE v_prenex_7 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse7 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse10 (fp.mul RNE .cse7 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse8 (fp.mul RNE .cse10 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse11 (fp.mul RNE .cse8 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse9 (fp.mul RNE .cse11 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse6 .cse7)) (fp.mul RNE .cse6 .cse8)) (fp.mul RNE .cse6 .cse9)) (fp.add RNE (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse6 .cse10)) (fp.mul RNE .cse6 .cse11)) (fp.mul RNE .cse6 (fp.mul RNE .cse9 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from false [2018-11-10 10:19:47,875 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_7 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (let ((.cse1 (fp.mul RNE v_prenex_7 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE v_prenex_7 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32))))))) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse7 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse10 (fp.mul RNE .cse7 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse8 (fp.mul RNE .cse10 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse11 (fp.mul RNE .cse8 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse9 (fp.mul RNE .cse11 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse6 .cse7)) (fp.mul RNE .cse6 .cse8)) (fp.mul RNE .cse6 .cse9)) (fp.add RNE (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse6 .cse10)) (fp.mul RNE .cse6 .cse11)) (fp.mul RNE .cse6 (fp.mul RNE .cse9 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from false [2018-11-10 10:19:55,425 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_7 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (let ((.cse1 (fp.mul RNE v_prenex_7 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE v_prenex_7 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))))) is different from false [2018-11-10 10:19:57,908 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_7 ((_ to_fp 8 24) RNE (_ bv0 32))) (not (let ((.cse1 (fp.mul RNE v_prenex_7 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE v_prenex_7 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_prenex_7 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))))) is different from true [2018-11-10 10:19:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-11-10 10:19:57,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:20:06,427 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-10 10:20:08,516 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-10 10:20:10,586 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-10 10:20:12,656 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-10 10:20:14,777 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-10 10:20:16,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (fp.geq (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-10 10:20:19,098 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse1 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-10 10:20:21,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse1 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-10 10:20:23,493 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-10 10:20:25,678 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse0 .cse1)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-10 10:20:27,923 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-10 10:20:30,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-10 10:20:32,486 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse1 .cse5)) (fp.mul RNE .cse1 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-10 10:20:34,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse1 .cse5)) (fp.mul RNE .cse1 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-10 10:20:37,100 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-10 10:20:39,430 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse2 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 c_main_~term~0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.add RNE (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-10 10:20:41,788 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from false [2018-11-10 10:20:44,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~term~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE c_main_~evenExp~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE c_main_~oddExp~0 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from true [2018-11-10 10:20:47,645 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~term~0_34 (fp.div RNE c_~pi~0 ((_ to_fp 8 24) RNE (_ bv8 32))))) (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) RNE (_ bv0 32)))) (let ((.cse1 (fp.mul RNE v_main_~term~0_34 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE v_main_~term~0_34 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))))) is different from true [2018-11-10 10:20:55,167 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) RNE (_ bv0 32)))) (let ((.cse1 (fp.mul RNE v_main_~term~0_34 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE v_main_~term~0_34 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))) (not (fp.lt v_main_~term~0_34 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32))))))) is different from false [2018-11-10 10:20:57,679 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) RNE (_ bv0 32)))) (let ((.cse1 (fp.mul RNE v_main_~term~0_34 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.add RNE (fp.add RNE (fp.add RNE v_main_~term~0_34 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_main_~term~0_34 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))) (not (fp.lt v_main_~term~0_34 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32))))))) is different from true [2018-11-10 10:20:57,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:20:57,708 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:20:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:21:22,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:21:22,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-10 10:21:22,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:21:22,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-10 10:21:22,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 10:21:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 10:21:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=60, Unknown=35, NotChecked=714, Total=870 [2018-11-10 10:21:22,833 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2018-11-10 10:21:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:21:33,453 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-10 10:21:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 10:21:33,503 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-10 10:21:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:21:33,504 INFO L225 Difference]: With dead ends: 41 [2018-11-10 10:21:33,504 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 10:21:33,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 145.3s TimeCoverageRelationStatistics Valid=66, Invalid=73, Unknown=35, NotChecked=756, Total=930 [2018-11-10 10:21:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 10:21:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 10:21:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 10:21:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-10 10:21:33,510 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2018-11-10 10:21:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:21:33,510 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-10 10:21:33,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 10:21:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-10 10:21:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:21:33,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:21:33,511 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:21:33,511 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:21:33,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:21:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1071354458, now seen corresponding path program 2 times [2018-11-10 10:21:33,512 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:21:33,512 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-10 10:21:33,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:21:35,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:21:35,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:21:36,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:21:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:21:36,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:21:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:21:36,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:21:36,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-10 10:21:36,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:21:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:21:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:21:36,249 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-10 10:21:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:21:58,079 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-10 10:21:58,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:21:58,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-10 10:21:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:21:58,080 INFO L225 Difference]: With dead ends: 72 [2018-11-10 10:21:58,080 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 10:21:58,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:21:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 10:21:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-11-10 10:21:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 10:21:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-10 10:21:58,086 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2018-11-10 10:21:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:21:58,086 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-10 10:21:58,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:21:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-10 10:21:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:21:58,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:21:58,087 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:21:58,087 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:21:58,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:21:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash 703652904, now seen corresponding path program 3 times [2018-11-10 10:21:58,087 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:21:58,088 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5912dc9f-c87d-47e6-9dda-f6313cd43040/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-10 10:21:58,090 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 10:23:49,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 10:23:49,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:23:49,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:24:13,405 WARN L179 SmtUtils]: Spent 17.37 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 10:24:44,889 WARN L179 SmtUtils]: Spent 24.80 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 10:24:47,185 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (_ bv4 32) c_main_~count~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from false [2018-11-10 10:24:49,258 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1))) (= (_ bv4 32) c_main_~count~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))) is different from true [2018-11-10 10:24:51,565 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse2))) (= (_ bv4 32) c_main_~count~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:24:53,890 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse1 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse2))) (= (_ bv4 32) c_main_~count~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 10:24:56,292 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 c_main_~term~0))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from false [2018-11-10 10:24:58,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse0 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 c_main_~term~0))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))) is different from true [2018-11-10 10:25:01,008 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse4 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse0 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 .cse4))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from false [2018-11-10 10:25:03,380 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse2 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse4 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse0 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse1 .cse3)) (fp.mul RNE .cse1 .cse4))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))) is different from false [2018-11-10 10:25:05,983 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse3 (fp.mul RNE .cse5 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3))) (= (_ bv8 32) c_main_~count~0) (= (fp.add RNE (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32))))))))) is different from false [2018-11-10 10:25:08,575 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse5 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse5 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse6 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse3 (fp.mul RNE .cse6 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse4 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3))) (= (_ bv8 32) c_main_~count~0) (= (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))) c_main_~term~0) (= (fp.add RNE (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 .cse6)) (fp.mul RNE .cse0 .cse4)) c_main_~oddExp~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))))) is different from false [2018-11-10 10:25:11,173 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul RNE c_main_~x~0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse5 (fp.mul RNE .cse1 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse5 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse6 (fp.mul RNE .cse2 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse3 (fp.mul RNE .cse6 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse4 (fp.mul RNE .cse3 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3))) (= (_ bv8 32) c_main_~count~0) (= (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE c_main_~count~0))) c_main_~term~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.add RNE (fp.add RNE (fp.add RNE c_main_~x~0 (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 .cse6)) (fp.mul RNE .cse0 .cse4)) c_main_~oddExp~0) (fp.lt c_main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))))) is different from false [2018-11-10 10:25:13,759 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse1 (fp.mul RNE .cse5 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse6 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse2 (fp.mul RNE .cse6 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse7 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (let ((.cse3 (fp.mul RNE .cse7 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse4 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv8 32)))))) (and (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse4 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv9 32))))))) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 .cse6)) (fp.mul RNE .cse0 .cse7)) (fp.mul RNE .cse0 .cse4))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))))))) is different from false [2018-11-10 10:25:16,278 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse1 (fp.mul RNE .cse5 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse6 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse2 (fp.mul RNE .cse6 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse7 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (let ((.cse3 (fp.mul RNE .cse7 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse4 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv8 32)))))) (and (= c_main_~oddExp~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse4 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv9 32))))))) (= c_main_~evenExp~0 (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 .cse6)) (fp.mul RNE .cse0 .cse7)) (fp.mul RNE .cse0 .cse4))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))))))))) is different from true [2018-11-10 10:25:29,643 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse1 (fp.mul RNE main_~x~0 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse5 (fp.mul RNE .cse1 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse5 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse6 (fp.mul RNE .cse2 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse3 (fp.mul RNE .cse6 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (let ((.cse7 (fp.mul RNE .cse3 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse4 (fp.mul RNE .cse7 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv8 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse0 .cse1)) (fp.mul RNE .cse0 .cse2)) (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 .cse4)) (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE main_~x~0 (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 .cse6)) (fp.mul RNE .cse0 .cse7)) (fp.mul RNE .cse0 (fp.mul RNE .cse4 (fp.div RNE main_~x~0 ((_ to_fp_unsigned 8 24) RNE (_ bv9 32)))))))))))))) (fp.lt main_~x~0 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (fp.gt main_~x~0 ((_ to_fp 8 24) RNE (_ bv0 32)))))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((v_prenex_10 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_10 ((_ to_fp 8 24) RNE (_ bv0 32))) (fp.lt v_prenex_10 (fp.div RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 314159.0 100000.0))) ((_ to_fp 8 24) RNE (_ bv8 32)))) (not (let ((.cse9 (fp.mul RNE v_prenex_10 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse13 (fp.mul RNE .cse9 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse10 (fp.mul RNE .cse13 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse14 (fp.mul RNE .cse10 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))) (let ((.cse11 (fp.mul RNE .cse14 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv6 32)))))) (let ((.cse15 (fp.mul RNE .cse11 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))) (let ((.cse8 ((_ to_fp 8 24) RNE (_ bv4294967295 32))) (.cse12 (fp.mul RNE .cse15 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv8 32)))))) (fp.geq (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE 1.0)) (fp.mul RNE .cse8 .cse9)) (fp.mul RNE .cse8 .cse10)) (fp.mul RNE .cse8 .cse11)) (fp.mul RNE .cse8 .cse12)) (fp.add RNE (fp.add RNE (fp.add RNE (fp.add RNE v_prenex_10 (fp.mul RNE .cse8 .cse13)) (fp.mul RNE .cse8 .cse14)) (fp.mul RNE .cse8 .cse15)) (fp.mul RNE .cse8 (fp.mul RNE .cse12 (fp.div RNE v_prenex_10 ((_ to_fp_unsigned 8 24) RNE (_ bv9 32))))))))))))))))))) is different from false [2018-11-10 10:25:41,473 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-10 10:25:41,674 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2018-11-10 10:25:41,675 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) 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:123) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-11-10 10:25:41,677 INFO L168 Benchmark]: Toolchain (without parser) took 836738.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -245.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:25:41,678 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:25:41,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:41,678 INFO L168 Benchmark]: Boogie Preprocessor took 28.19 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:41,678 INFO L168 Benchmark]: RCFGBuilder took 3524.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:41,679 INFO L168 Benchmark]: TraceAbstraction took 833005.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:25:41,681 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.19 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3524.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 833005.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...