./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_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan --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 Taipan --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_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan --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 Taipan --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 13:23:53,941 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:23:53,942 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:23:53,948 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:23:53,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:23:53,949 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:23:53,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:23:53,952 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:23:53,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:23:53,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:23:53,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:23:53,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:23:53,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:23:53,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:23:53,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:23:53,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:23:53,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:23:53,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:23:53,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:23:53,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:23:53,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:23:53,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:23:53,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:23:53,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:23:53,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:23:53,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:23:53,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:23:53,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:23:53,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:23:53,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:23:53,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:23:53,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:23:53,969 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:23:53,969 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:23:53,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:23:53,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:23:53,971 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:23:53,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:23:53,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:23:53,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:23:53,983 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:23:53,983 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:23:53,983 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:23:53,983 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:23:53,983 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:23:53,983 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:23:53,984 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:23:53,984 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:23:53,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:23:53,984 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:23:53,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:23:53,986 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:23:53,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:23:53,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:23:53,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:23:53,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:23:53,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:23:53,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:23:53,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:23:53,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:23:53,987 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:23:53,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:23:53,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:23:53,987 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:23:53,988 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan 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 -> Taipan 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 13:23:54,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:23:54,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:23:54,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:23:54,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:23:54,022 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:23:54,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 13:23:54,059 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/0e37dbde6/7cfb0f7a6bed4035b797e0aafe768a7a/FLAG11e95a2e6 [2018-11-10 13:23:54,458 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:23:54,459 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 13:23:54,464 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/0e37dbde6/7cfb0f7a6bed4035b797e0aafe768a7a/FLAG11e95a2e6 [2018-11-10 13:23:54,472 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/0e37dbde6/7cfb0f7a6bed4035b797e0aafe768a7a [2018-11-10 13:23:54,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:23:54,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:23:54,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:23:54,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:23:54,477 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:23:54,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54, skipping insertion in model container [2018-11-10 13:23:54,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:23:54,496 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:23:54,592 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:23:54,595 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:23:54,607 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:23:54,615 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:23:54,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54 WrapperNode [2018-11-10 13:23:54,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:23:54,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:23:54,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:23:54,616 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:23:54,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:23:54,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:23:54,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:23:54,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:23:54,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... [2018-11-10 13:23:54,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:23:54,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:23:54,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:23:54,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:23:54,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/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 13:23:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:23:54,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:23:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:23:54,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:23:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:23:54,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:23:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 13:23:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 13:23:54,806 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:23:54,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:23:54 BoogieIcfgContainer [2018-11-10 13:23:54,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:23:54,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:23:54,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:23:54,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:23:54,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:23:54" (1/3) ... [2018-11-10 13:23:54,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3291d941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:23:54, skipping insertion in model container [2018-11-10 13:23:54,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:54" (2/3) ... [2018-11-10 13:23:54,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3291d941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:23:54, skipping insertion in model container [2018-11-10 13:23:54,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:23:54" (3/3) ... [2018-11-10 13:23:54,813 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-10 13:23:54,819 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:23:54,822 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:23:54,833 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:23:54,858 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:23:54,859 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:23:54,859 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:23:54,859 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:23:54,859 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:23:54,859 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:23:54,859 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:23:54,859 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:23:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-10 13:23:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 13:23:54,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:23:54,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:23:54,875 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:23:54,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:23:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-10 13:23:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:23:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:23:54,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:23:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:23:54,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:23:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:23:54,951 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 13:23:54,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:23:54,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:23:54,952 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:23:54,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:23:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:23:54,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:23:54,964 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 13:23:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:23:54,976 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-10 13:23:54,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:23:54,977 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 13:23:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:23:54,981 INFO L225 Difference]: With dead ends: 35 [2018-11-10 13:23:54,982 INFO L226 Difference]: Without dead ends: 16 [2018-11-10 13:23:54,984 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 13:23:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-10 13:23:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 13:23:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 13:23:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 13:23:55,010 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-10 13:23:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:23:55,010 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 13:23:55,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:23:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-10 13:23:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 13:23:55,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:23:55,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:23:55,011 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:23:55,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:23:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-10 13:23:55,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:23:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:23:55,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:23:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:23:55,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:23:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:23:55,071 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 13:23:55,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:23:55,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:23:55,071 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:23:55,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:23:55,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:23:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:23:55,073 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-10 13:23:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:23:55,087 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-10 13:23:55,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:23:55,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 13:23:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:23:55,088 INFO L225 Difference]: With dead ends: 30 [2018-11-10 13:23:55,088 INFO L226 Difference]: Without dead ends: 20 [2018-11-10 13:23:55,089 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 13:23:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-10 13:23:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-10 13:23:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 13:23:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 13:23:55,092 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-10 13:23:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:23:55,093 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 13:23:55,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:23:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-10 13:23:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 13:23:55,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:23:55,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:23:55,093 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:23:55,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:23:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-10 13:23:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:23:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:23:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:23:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:23:55,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:23:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:23:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:23:55,125 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:23:55,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:23:55 BoogieIcfgContainer [2018-11-10 13:23:55,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:23:55,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:23:55,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:23:55,144 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:23:55,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:23:54" (3/4) ... [2018-11-10 13:23:55,147 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:23:55,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:23:55,147 INFO L168 Benchmark]: Toolchain (without parser) took 673.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:23:55,148 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:23:55,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:23:55,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.69 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:23:55,149 INFO L168 Benchmark]: Boogie Preprocessor took 13.56 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:23:55,150 INFO L168 Benchmark]: RCFGBuilder took 165.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:23:55,152 INFO L168 Benchmark]: TraceAbstraction took 336.26 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.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:23:55,152 INFO L168 Benchmark]: Witness Printer took 2.85 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 13:23:55,155 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.69 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.56 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 165.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 336.26 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.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 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.2s 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 13:23:56,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:23:56,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:23:56,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:23:56,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:23:56,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:23:56,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:23:56,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:23:56,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:23:56,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:23:56,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:23:56,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:23:56,615 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:23:56,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:23:56,617 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:23:56,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:23:56,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:23:56,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:23:56,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:23:56,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:23:56,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:23:56,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:23:56,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:23:56,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:23:56,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:23:56,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:23:56,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:23:56,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:23:56,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:23:56,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:23:56,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:23:56,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:23:56,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:23:56,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:23:56,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:23:56,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:23:56,632 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 13:23:56,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:23:56,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:23:56,644 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:23:56,644 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:23:56,644 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:23:56,644 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:23:56,644 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:23:56,644 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:23:56,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:23:56,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:23:56,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:23:56,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:23:56,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:23:56,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:23:56,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:23:56,645 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 13:23:56,646 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 13:23:56,646 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:23:56,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:23:56,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:23:56,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:23:56,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:23:56,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:23:56,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:23:56,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:23:56,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:23:56,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:23:56,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:23:56,648 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 13:23:56,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:23:56,648 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 13:23:56,648 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 13:23:56,648 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_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan 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 -> Taipan 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 13:23:56,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:23:56,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:23:56,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:23:56,687 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:23:56,688 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:23:56,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 13:23:56,728 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/3808fee0a/526060ebe1044089a767041c13b76c9e/FLAG7a618aa04 [2018-11-10 13:23:57,048 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:23:57,049 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-10 13:23:57,052 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/3808fee0a/526060ebe1044089a767041c13b76c9e/FLAG7a618aa04 [2018-11-10 13:23:57,063 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/data/3808fee0a/526060ebe1044089a767041c13b76c9e [2018-11-10 13:23:57,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:23:57,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:23:57,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:23:57,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:23:57,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:23:57,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372ad371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57, skipping insertion in model container [2018-11-10 13:23:57,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:23:57,094 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:23:57,218 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:23:57,222 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:23:57,238 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:23:57,249 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:23:57,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57 WrapperNode [2018-11-10 13:23:57,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:23:57,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:23:57,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:23:57,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:23:57,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:23:57,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:23:57,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:23:57,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:23:57,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... [2018-11-10 13:23:57,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:23:57,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:23:57,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:23:57,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:23:57,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/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 13:23:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:23:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:23:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:23:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:23:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:23:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:23:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 13:23:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 13:24:00,670 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:24:00,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:24:00 BoogieIcfgContainer [2018-11-10 13:24:00,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:24:00,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:24:00,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:24:00,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:24:00,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:23:57" (1/3) ... [2018-11-10 13:24:00,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be8f9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:24:00, skipping insertion in model container [2018-11-10 13:24:00,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:23:57" (2/3) ... [2018-11-10 13:24:00,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be8f9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:24:00, skipping insertion in model container [2018-11-10 13:24:00,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:24:00" (3/3) ... [2018-11-10 13:24:00,677 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-10 13:24:00,682 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:24:00,686 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:24:00,695 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:24:00,712 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:24:00,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:24:00,713 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:24:00,713 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:24:00,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:24:00,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:24:00,714 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:24:00,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:24:00,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:24:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-10 13:24:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 13:24:00,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:24:00,732 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:24:00,733 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:24:00,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:24:00,738 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-10 13:24:00,740 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:24:00,740 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/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 13:24:00,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:24:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:24:00,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:24:00,799 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 13:24:00,799 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:24:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:24:00,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:24:00,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:24:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:24:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:24:00,821 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 13:24:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:24:00,833 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-10 13:24:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:24:00,834 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 13:24:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:24:00,839 INFO L225 Difference]: With dead ends: 35 [2018-11-10 13:24:00,839 INFO L226 Difference]: Without dead ends: 16 [2018-11-10 13:24:00,842 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 13:24:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-10 13:24:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 13:24:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 13:24:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 13:24:00,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-10 13:24:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:24:00,863 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 13:24:00,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:24:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-10 13:24:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 13:24:00,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:24:00,864 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:24:00,864 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:24:00,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:24:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-10 13:24:00,865 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:24:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/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 13:24:00,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:24:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:24:01,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:24:01,529 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 13:24:01,530 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:24:01,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:24:01,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:24:01,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:24:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:24:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:24:01,543 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-10 13:24:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:24:05,778 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-10 13:24:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:24:05,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 13:24:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:24:05,779 INFO L225 Difference]: With dead ends: 30 [2018-11-10 13:24:05,779 INFO L226 Difference]: Without dead ends: 20 [2018-11-10 13:24:05,780 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 13:24:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-10 13:24:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-10 13:24:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 13:24:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 13:24:05,783 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-10 13:24:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:24:05,784 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 13:24:05,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:24:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-10 13:24:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 13:24:05,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:24:05,784 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:24:05,784 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:24:05,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:24:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-10 13:24:05,785 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:24:05,785 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/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 13:24:05,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:24:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:24:07,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:24:33,815 WARN L179 SmtUtils]: Spent 21.38 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 13:24:52,204 WARN L179 SmtUtils]: Spent 13.69 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 13:24:54,500 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 13:24:56,756 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 13:25:08,416 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 13:25:20,105 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 13:25:26,990 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 13:25:29,251 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 13:25:29,254 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 13:25:29,255 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:25:29,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:25:29,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:25:29,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 13:25:29,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:25:29,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=22, Unknown=6, NotChecked=44, Total=90 [2018-11-10 13:25:29,275 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-11-10 13:25:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:41,076 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-10 13:25:41,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:25:41,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-10 13:25:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:41,114 INFO L225 Difference]: With dead ends: 26 [2018-11-10 13:25:41,114 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 13:25:41,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=22, Invalid=29, Unknown=7, NotChecked=52, Total=110 [2018-11-10 13:25:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 13:25:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 13:25:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 13:25:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 13:25:41,117 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-10 13:25:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:41,117 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 13:25:41,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 13:25:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-10 13:25:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 13:25:41,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:41,118 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 13:25:41,118 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:41,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1908428422, now seen corresponding path program 1 times [2018-11-10 13:25:41,119 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:25:41,119 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/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 13:25:41,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:42,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:25:42,380 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 13:25:42,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:25:42,403 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 13:25:42,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:25:42,449 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:25:42,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:25:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:25:43,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:25:43,368 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 13:25:43,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:25:43,375 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 13:25:43,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 13:25:43,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 6 [2018-11-10 13:25:43,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:25:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:25:43,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:25:43,473 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-10 13:25:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:25:53,546 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-10 13:25:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:25:53,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-10 13:25:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:25:53,547 INFO L225 Difference]: With dead ends: 41 [2018-11-10 13:25:53,547 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 13:25:53,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:25:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 13:25:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-10 13:25:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 13:25:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 13:25:53,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2018-11-10 13:25:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:25:53,552 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 13:25:53,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:25:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-10 13:25:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 13:25:53,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:25:53,552 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:25:53,552 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:25:53,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:25:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -611531512, now seen corresponding path program 1 times [2018-11-10 13:25:53,553 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:25:53,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-10 13:25:53,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:26:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:26:22,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:26:49,313 WARN L179 SmtUtils]: Spent 21.38 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 13:27:15,088 WARN L179 SmtUtils]: Spent 20.45 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 13:27:17,375 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 13:27:20,647 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 13:27:22,954 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 13:27:25,316 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 13:27:27,626 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 13:27:39,608 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 13:27:51,628 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 13:27:58,653 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 13:28:00,977 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 13:28:00,981 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 13:28:00,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:28:11,444 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 13:28:13,526 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 13:28:15,593 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 13:28:17,660 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 13:28:19,775 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 13:28:21,889 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 13:28:24,074 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 13:28:26,257 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 13:28:28,435 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 13:28:30,614 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 13:28:32,849 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 13:28:35,090 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 13:28:38,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) RNE (_ bv0 32)))) (not (fp.lt v_main_~term~0_26 (fp.div RNE c_~pi~0 ((_ to_fp 8 24) RNE (_ bv8 32))))) (let ((.cse1 (fp.mul RNE v_main_~term~0_26 (fp.div RNE v_main_~term~0_26 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE v_main_~term~0_26 ((_ 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_~term~0_26 ((_ 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_~term~0_26 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE v_main_~term~0_26 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))))))))) is different from true [2018-11-10 13:28:45,063 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) RNE (_ bv0 32)))) (not (fp.lt v_main_~term~0_26 (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_main_~term~0_26 (fp.div RNE v_main_~term~0_26 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE v_main_~term~0_26 ((_ 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_~term~0_26 ((_ 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_~term~0_26 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE v_main_~term~0_26 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))))))))) is different from false [2018-11-10 13:28:47,402 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) RNE (_ bv0 32)))) (not (fp.lt v_main_~term~0_26 (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_main_~term~0_26 (fp.div RNE v_main_~term~0_26 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse3 (fp.mul RNE .cse1 (fp.div RNE v_main_~term~0_26 ((_ 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_~term~0_26 ((_ 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_~term~0_26 (fp.mul RNE .cse0 .cse3)) (fp.mul RNE .cse0 (fp.mul RNE .cse2 (fp.div RNE v_main_~term~0_26 ((_ to_fp_unsigned 8 24) RNE (_ bv5 32)))))))))))) is different from true [2018-11-10 13:28:47,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:47,425 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:28:47,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-10 13:29:00,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:29:00,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-10 13:29:00,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:29:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:29:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=59, Unknown=24, NotChecked=420, Total=552 [2018-11-10 13:29:00,403 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 13 states. [2018-11-10 13:29:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:17,133 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-10 13:29:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 13:29:17,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-10 13:29:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:29:17,181 INFO L225 Difference]: With dead ends: 36 [2018-11-10 13:29:17,181 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 13:29:17,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 117.9s TimeCoverageRelationStatistics Valid=54, Invalid=72, Unknown=24, NotChecked=450, Total=600 [2018-11-10 13:29:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 13:29:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-10 13:29:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 13:29:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-10 13:29:17,186 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-11-10 13:29:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:29:17,187 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-10 13:29:17,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:29:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-10 13:29:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 13:29:17,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:29:17,187 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:17,188 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:29:17,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash 497228205, now seen corresponding path program 2 times [2018-11-10 13:29:17,188 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:29:17,188 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-10 13:29:17,191 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 13:30:09,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:30:09,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:30:09,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:30:33,995 WARN L179 SmtUtils]: Spent 18.88 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 13:30:58,704 WARN L179 SmtUtils]: Spent 18.92 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 13:31:00,983 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 13:31:03,468 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 13:31:06,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 ((.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 13:31:08,270 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_#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 true [2018-11-10 13:31:10,616 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 (bvadd c_main_~count~0 (_ bv4294967294 32)))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (_ bv6 32) c_main_~count~0) (= (fp.mul RNE .cse0 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32))))) c_main_~term~0) (= 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 13:31:12,979 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 (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (_ bv6 32) c_main_~count~0) (= (fp.mul RNE .cse0 (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 c_main_~x~0 (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0)) c_main_~oddExp~0) (= 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 13:31:15,362 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 (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul RNE .cse4 (fp.div RNE c_main_~x~0 ((_ to_fp_unsigned 8 24) RNE (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) RNE (_ bv4294967295 32)))) (and (= (_ bv6 32) c_main_~count~0) (= (fp.mul RNE .cse0 (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 c_main_~x~0 (fp.mul RNE .cse1 .cse2)) (fp.mul RNE .cse1 .cse0)) c_main_~oddExp~0) (= 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 13:31:17,897 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 13:31:20,390 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 13:31:33,594 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 13:31:46,798 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 13:31:54,393 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 13:31:56,918 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 13:31:56,928 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 13:31:56,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:32:07,353 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 13:32:09,453 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 13:32:11,540 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 13:32:13,619 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 13:32:15,760 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 13:32:17,896 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 13:32:20,107 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 13:32:22,319 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 13:32:24,513 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 13:32:26,709 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 13:32:28,958 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 13:32:31,213 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 13:32:33,529 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 13:32:35,846 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 13:32:38,165 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 13:32:40,474 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 13:32:42,834 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 13:32:45,201 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 13:32:48,698 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (fp.div RNE c_~pi~0 ((_ to_fp 8 24) RNE (_ bv8 32))))) (let ((.cse1 (fp.mul RNE v_main_~oddExp~0_24 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_main_~oddExp~0_24 ((_ 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_~oddExp~0_24 ((_ 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_~oddExp~0_24 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))) (not (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 13:32:56,233 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (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_main_~oddExp~0_24 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_main_~oddExp~0_24 ((_ 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_~oddExp~0_24 ((_ 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_~oddExp~0_24 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))) (not (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from false [2018-11-10 13:32:58,749 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (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_main_~oddExp~0_24 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv2 32)))))) (let ((.cse4 (fp.mul RNE .cse1 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv3 32)))))) (let ((.cse2 (fp.mul RNE .cse4 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv4 32)))))) (let ((.cse5 (fp.mul RNE .cse2 (fp.div RNE v_main_~oddExp~0_24 ((_ 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_~oddExp~0_24 ((_ 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_~oddExp~0_24 (fp.mul RNE .cse0 .cse4)) (fp.mul RNE .cse0 .cse5)) (fp.mul RNE .cse0 (fp.mul RNE .cse3 (fp.div RNE v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) RNE (_ bv7 32)))))))))))) (not (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) RNE (_ bv0 32)))))) is different from true [2018-11-10 13:32:58,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:32:58,780 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:32:58,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 13:33:23,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:33:23,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-10 13:33:23,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:33:23,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-10 13:33:23,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 13:33:23,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 13:33:23,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=60, Unknown=35, NotChecked=714, Total=870 [2018-11-10 13:33:23,629 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2018-11-10 13:33:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:42,727 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-10 13:33:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 13:33:42,832 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-10 13:33:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:42,833 INFO L225 Difference]: With dead ends: 41 [2018-11-10 13:33:42,833 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 13:33:42,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 140.0s TimeCoverageRelationStatistics Valid=66, Invalid=73, Unknown=35, NotChecked=756, Total=930 [2018-11-10 13:33:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 13:33:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 13:33:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 13:33:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-10 13:33:42,840 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2018-11-10 13:33:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:42,840 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-10 13:33:42,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 13:33:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-10 13:33:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 13:33:42,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:42,841 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 13:33:42,841 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:42,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:42,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1071354458, now seen corresponding path program 2 times [2018-11-10 13:33:42,842 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:33:42,842 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/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 13:33:42,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 13:33:45,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:33:45,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:33:46,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:46,081 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 13:33:46,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:33:46,152 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 13:33:46,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:33:46,194 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:33:46,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 13:34:00,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 13:34:00,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:00,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:00,352 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 13:34:00,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:00,361 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 13:34:00,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 13:34:00,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-11-10 13:34:00,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 13:34:00,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:34:00,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:00,554 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-10 13:34:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:22,260 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-10 13:34:22,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:34:22,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-10 13:34:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:22,261 INFO L225 Difference]: With dead ends: 72 [2018-11-10 13:34:22,261 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 13:34:22,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:34:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 13:34:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-11-10 13:34:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 13:34:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-10 13:34:22,268 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2018-11-10 13:34:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:22,268 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-10 13:34:22,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 13:34:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-10 13:34:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 13:34:22,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:22,269 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:22,269 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:22,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:22,269 INFO L82 PathProgramCache]: Analyzing trace with hash 703652904, now seen corresponding path program 3 times [2018-11-10 13:34:22,269 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 13:34:22,269 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4362f13-5408-4b3b-a064-b864aad7ed5b/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-10 13:34:22,273 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:15,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 13:36:15,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:16,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:42,157 WARN L179 SmtUtils]: Spent 18.78 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 13:37:04,544 WARN L179 SmtUtils]: Spent 16.27 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 13:37:06,830 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 13:37:09,208 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 13:37:11,998 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 13:37:14,736 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 13:37:17,054 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 13:37:19,419 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 13:37:21,786 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 13:37:24,349 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 13:37:26,981 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 13:37:29,565 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 13:37:32,161 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 13:37:34,699 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 13:37:48,159 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 13:37:59,985 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-10 13:38:00,186 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2018-11-10 13:38:00,186 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 13:38:00,188 INFO L168 Benchmark]: Toolchain (without parser) took 843122.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 951.9 MB in the beginning and 1.2 GB in the end (delta: -198.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:38:00,189 INFO L168 Benchmark]: CDTParser took 0.12 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 13:38:00,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.17 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 939.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:38:00,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.39 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:38:00,190 INFO L168 Benchmark]: Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 934.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:38:00,191 INFO L168 Benchmark]: RCFGBuilder took 3387.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:38:00,191 INFO L168 Benchmark]: TraceAbstraction took 839516.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:38:00,194 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.12 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 183.17 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 939.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.39 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 934.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3387.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 839516.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.4 MB). Peak memory consumption was 2.5 MB. 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...