./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 ............................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 ................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:37:30,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:37:30,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:37:30,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:37:30,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:37:30,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:37:30,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:37:30,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:37:30,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:37:30,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:37:30,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:37:30,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:37:30,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:37:30,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:37:30,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:37:30,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:37:30,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:37:30,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:37:30,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:37:30,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:37:30,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:37:30,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:37:30,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:37:30,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:37:30,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:37:30,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:37:30,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:37:30,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:37:30,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:37:30,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:37:30,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:37:30,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:37:30,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:37:30,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:37:30,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:37:30,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:37:30,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:37:30,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:37:30,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:37:30,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:37:30,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:37:30,706 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:37:30,763 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:37:30,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:37:30,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:37:30,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:37:30,767 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:37:30,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:37:30,768 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:37:30,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:37:30,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:37:30,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:37:30,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:37:30,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:37:30,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:37:30,771 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:37:30,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:37:30,771 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:37:30,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:37:30,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:37:30,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:37:30,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:37:30,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:37:30,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:37:30,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:37:30,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:37:30,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:37:30,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:37:30,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:37:30,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:37:30,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:37:30,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 [2020-11-30 00:37:31,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:37:31,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:37:31,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:37:31,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:37:31,180 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:37:31,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-11-30 00:37:31,315 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/780861a67/c90087f397254e8b8e43fdca8be87fc9/FLAGa1dd7124c [2020-11-30 00:37:31,975 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:37:31,976 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-11-30 00:37:31,984 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/780861a67/c90087f397254e8b8e43fdca8be87fc9/FLAGa1dd7124c [2020-11-30 00:37:32,356 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/780861a67/c90087f397254e8b8e43fdca8be87fc9 [2020-11-30 00:37:32,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:37:32,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:37:32,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:37:32,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:37:32,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:37:32,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f93370b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32, skipping insertion in model container [2020-11-30 00:37:32,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:37:32,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:37:32,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:37:32,670 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:37:32,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:37:32,751 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:37:32,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32 WrapperNode [2020-11-30 00:37:32,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:37:32,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:37:32,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:37:32,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:37:32,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:37:32,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:37:32,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:37:32,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:37:32,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... [2020-11-30 00:37:32,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:37:32,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:37:32,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:37:32,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:37:32,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:37:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:37:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:37:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-11-30 00:37:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:37:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-11-30 00:37:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:37:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:37:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:37:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:37:33,292 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:37:33,293 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 00:37:33,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:33 BoogieIcfgContainer [2020-11-30 00:37:33,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:37:33,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:37:33,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:37:33,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:37:33,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:37:32" (1/3) ... [2020-11-30 00:37:33,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753e4a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:33, skipping insertion in model container [2020-11-30 00:37:33,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:32" (2/3) ... [2020-11-30 00:37:33,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753e4a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:33, skipping insertion in model container [2020-11-30 00:37:33,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:33" (3/3) ... [2020-11-30 00:37:33,329 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake.c.v+cfa-reducer.c [2020-11-30 00:37:33,355 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:37:33,361 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 00:37:33,377 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 00:37:33,410 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:37:33,410 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:37:33,410 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:37:33,411 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:37:33,411 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:37:33,411 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:37:33,411 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:37:33,412 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:37:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-11-30 00:37:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:37:33,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:33,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:33,438 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2135388399, now seen corresponding path program 1 times [2020-11-30 00:37:33,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:37:33,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827401380] [2020-11-30 00:37:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:37:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:37:33,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:37:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:37:33,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:37:33,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:37:33,688 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:37:33,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:37:33,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:37:33 BoogieIcfgContainer [2020-11-30 00:37:33,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:37:33,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:37:33,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:37:33,736 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:37:33,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:33" (3/4) ... [2020-11-30 00:37:33,744 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 00:37:33,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:37:33,750 INFO L168 Benchmark]: Toolchain (without parser) took 1385.01 ms. Allocated memory is still 92.3 MB. Free memory was 61.4 MB in the beginning and 38.2 MB in the end (delta: 23.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:33,753 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 92.3 MB. Free memory was 51.9 MB in the beginning and 51.8 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:37:33,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.39 ms. Allocated memory is still 92.3 MB. Free memory was 61.2 MB in the beginning and 68.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:33,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 92.3 MB. Free memory was 68.8 MB in the beginning and 67.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:33,758 INFO L168 Benchmark]: Boogie Preprocessor took 29.42 ms. Allocated memory is still 92.3 MB. Free memory was 67.6 MB in the beginning and 66.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:37:33,759 INFO L168 Benchmark]: RCFGBuilder took 454.54 ms. Allocated memory is still 92.3 MB. Free memory was 66.3 MB in the beginning and 52.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:33,760 INFO L168 Benchmark]: TraceAbstraction took 412.20 ms. Allocated memory is still 92.3 MB. Free memory was 51.6 MB in the beginning and 38.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:37:33,762 INFO L168 Benchmark]: Witness Printer took 8.44 ms. Allocated memory is still 92.3 MB. Free memory is still 38.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:37:33,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 92.3 MB. Free memory was 51.9 MB in the beginning and 51.8 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 385.39 ms. Allocated memory is still 92.3 MB. Free memory was 61.2 MB in the beginning and 68.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 92.3 MB. Free memory was 68.8 MB in the beginning and 67.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.42 ms. Allocated memory is still 92.3 MB. Free memory was 67.6 MB in the beginning and 66.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 454.54 ms. Allocated memory is still 92.3 MB. Free memory was 66.3 MB in the beginning and 52.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 412.20 ms. Allocated memory is still 92.3 MB. Free memory was 51.6 MB in the beginning and 38.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Witness Printer took 8.44 ms. Allocated memory is still 92.3 MB. Free memory is still 38.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L17] float __return_72; [L18] int __return_87; VAL [__return_72=0, __return_87=0, __return_main=0] [L21] float main__a; [L22] float main__r; [L23] main__a = __VERIFIER_nondet_float() [L24] int main____CPAchecker_TMP_0; VAL [__return_72=0, __return_87=0, __return_main=0] [L25] COND TRUE main__a >= 0.10000000149011612 VAL [__return_72=0, __return_87=0, __return_main=0] [L27] COND TRUE main__a <= 100.0 [L29] main____CPAchecker_TMP_0 = 1 VAL [__return_72=0, __return_87=0, __return_main=0] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] float __tmp_1; [L34] __tmp_1 = main__a [L35] float InvSqrt__x; [L36] InvSqrt__x = __tmp_1 [L37] float InvSqrt__xhalf = 0.5 * InvSqrt__x; [L38] union float_int InvSqrt__i; [L39] InvSqrt__i.f = InvSqrt__x [L40] EXPR InvSqrt__i.i [L40] InvSqrt__i.i = 1597463007 - ((InvSqrt__i.i) >> 1) [L41] EXPR InvSqrt__i.f [L41] InvSqrt__x = InvSqrt__i.f [L42] InvSqrt__x = InvSqrt__x * (1.5 - ((InvSqrt__xhalf * InvSqrt__x) * InvSqrt__x)) [L43] __return_72 = InvSqrt__x [L44] main__r = __return_72 [L45] int main____CPAchecker_TMP_1; VAL [__return_72=50, __return_87=0, __return_main=0] [L46] COND FALSE !(main__r >= 0.0) VAL [__return_72=50, __return_87=0, __return_main=0] [L72] main____CPAchecker_TMP_1 = 0 VAL [__return_72=50, __return_87=0, __return_main=0] [L53] int __tmp_2; [L54] __tmp_2 = main____CPAchecker_TMP_1 [L55] int __VERIFIER_assert__cond; [L56] __VERIFIER_assert__cond = __tmp_2 VAL [__return_72=50, __return_87=0, __return_main=0] [L57] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_72=50, __return_87=0, __return_main=0] [L4] __assert_fail("0", "inv_sqrt_Quake.c.v+cfa-reducer.c", 4, "reach_error") VAL [__return_72=50, __return_87=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:37:36,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:37:36,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:37:36,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:37:36,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:37:36,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:37:36,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:37:36,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:37:36,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:37:36,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:37:36,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:37:36,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:37:36,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:37:36,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:37:36,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:37:36,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:37:36,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:37:37,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:37:37,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:37:37,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:37:37,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:37:37,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:37:37,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:37:37,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:37:37,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:37:37,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:37:37,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:37:37,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:37:37,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:37:37,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:37:37,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:37:37,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:37:37,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:37:37,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:37:37,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:37:37,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:37:37,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:37:37,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:37:37,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:37:37,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:37:37,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:37:37,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-30 00:37:37,130 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:37:37,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:37:37,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:37:37,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:37:37,136 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:37:37,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:37:37,137 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:37:37,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:37:37,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:37:37,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:37:37,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:37:37,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:37:37,140 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 00:37:37,140 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 00:37:37,140 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:37:37,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:37:37,141 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:37:37,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:37:37,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:37:37,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:37:37,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:37:37,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:37:37,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:37:37,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:37:37,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:37:37,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:37:37,144 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 00:37:37,144 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 00:37:37,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:37:37,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:37:37,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 00:37:37,145 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18a7fa5d929aa4f94783ce4ac14d173e66069fd4 [2020-11-30 00:37:37,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:37:37,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:37:37,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:37:37,768 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:37:37,769 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:37:37,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-11-30 00:37:37,865 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/7ed530077/28fb21d8087c4650a3df4042136c3329/FLAGce6cfabb6 [2020-11-30 00:37:38,533 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:37:38,536 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c.v+cfa-reducer.c [2020-11-30 00:37:38,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/7ed530077/28fb21d8087c4650a3df4042136c3329/FLAGce6cfabb6 [2020-11-30 00:37:38,846 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/data/7ed530077/28fb21d8087c4650a3df4042136c3329 [2020-11-30 00:37:38,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:37:38,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:37:38,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:37:38,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:37:38,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:37:38,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:37:38" (1/1) ... [2020-11-30 00:37:38,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410885c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:38, skipping insertion in model container [2020-11-30 00:37:38,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:37:38" (1/1) ... [2020-11-30 00:37:38,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:37:38,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:37:39,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:37:39,224 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:37:39,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:37:39,348 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:37:39,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39 WrapperNode [2020-11-30 00:37:39,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:37:39,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:37:39,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:37:39,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:37:39,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:37:39,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:37:39,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:37:39,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:37:39,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... [2020-11-30 00:37:39,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:37:39,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:37:39,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:37:39,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:37:39,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:37:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 00:37:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:37:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-11-30 00:37:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 00:37:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:37:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:37:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-11-30 00:37:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:37:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 00:37:42,935 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:37:42,935 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 00:37:42,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:42 BoogieIcfgContainer [2020-11-30 00:37:42,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:37:42,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:37:42,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:37:42,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:37:42,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:37:38" (1/3) ... [2020-11-30 00:37:42,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb94118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:42, skipping insertion in model container [2020-11-30 00:37:42,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:37:39" (2/3) ... [2020-11-30 00:37:42,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb94118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:37:42, skipping insertion in model container [2020-11-30 00:37:42,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:42" (3/3) ... [2020-11-30 00:37:42,950 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake.c.v+cfa-reducer.c [2020-11-30 00:37:42,965 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:37:42,971 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 00:37:42,987 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 00:37:43,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:37:43,017 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:37:43,017 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:37:43,018 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:37:43,018 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:37:43,018 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:37:43,018 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:37:43,018 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:37:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-11-30 00:37:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:37:43,041 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:37:43,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:37:43,042 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:37:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:37:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2135388399, now seen corresponding path program 1 times [2020-11-30 00:37:43,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:37:43,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986480357] [2020-11-30 00:37:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 00:37:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:37:46,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 00:37:46,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:37:47,120 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-30 00:37:47,958 WARN L193 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-11-30 00:37:50,150 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))))))) is different from false [2020-11-30 00:37:56,614 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from false [2020-11-30 00:37:58,736 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from true [2020-11-30 00:38:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:38:11,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:38:14,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) is different from false [2020-11-30 00:38:16,941 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) is different from true [2020-11-30 00:38:19,727 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) is different from false [2020-11-30 00:38:21,935 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) is different from true [2020-11-30 00:38:24,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) is different from false [2020-11-30 00:38:26,327 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) is different from true [2020-11-30 00:38:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:38:26,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986480357] [2020-11-30 00:38:26,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:38:26,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2020-11-30 00:38:26,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099263621] [2020-11-30 00:38:26,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 00:38:26,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:38:26,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:38:26,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=19, Unknown=9, NotChecked=60, Total=110 [2020-11-30 00:38:26,366 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 11 states. [2020-11-30 00:38:28,794 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-11-30 00:38:31,022 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (or (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 00:38:34,098 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from false [2020-11-30 00:38:36,326 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (or (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2020-11-30 00:38:39,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from false [2020-11-30 00:38:41,269 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) .cse0) .cse0))))))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~main__a~0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2020-11-30 00:38:43,463 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))))))) is different from false [2020-11-30 00:38:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:38:44,124 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-11-30 00:38:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:38:44,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2020-11-30 00:38:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:38:44,141 INFO L225 Difference]: With dead ends: 24 [2020-11-30 00:38:44,141 INFO L226 Difference]: Without dead ends: 12 [2020-11-30 00:38:44,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=30, Invalid=20, Unknown=16, NotChecked=144, Total=210 [2020-11-30 00:38:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-11-30 00:38:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-11-30 00:38:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-30 00:38:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-11-30 00:38:44,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-11-30 00:38:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:38:44,193 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-11-30 00:38:44,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 00:38:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-11-30 00:38:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:38:44,194 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:38:44,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:38:44,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 00:38:44,398 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:38:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:38:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2020-11-30 00:38:44,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:38:44,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084327088] [2020-11-30 00:38:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 00:38:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:38:45,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:38:45,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:38:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:38:45,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:38:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:38:45,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084327088] [2020-11-30 00:38:45,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:38:45,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 00:38:45,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078997610] [2020-11-30 00:38:45,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:38:45,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:38:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:38:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:38:45,337 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2020-11-30 00:38:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:38:47,995 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-11-30 00:38:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:38:47,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 00:38:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:38:47,997 INFO L225 Difference]: With dead ends: 16 [2020-11-30 00:38:47,998 INFO L226 Difference]: Without dead ends: 12 [2020-11-30 00:38:47,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:38:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-11-30 00:38:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-11-30 00:38:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-30 00:38:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2020-11-30 00:38:48,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 10 [2020-11-30 00:38:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:38:48,003 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2020-11-30 00:38:48,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:38:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-11-30 00:38:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 00:38:48,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:38:48,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:38:48,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 00:38:48,206 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:38:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:38:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1948390697, now seen corresponding path program 1 times [2020-11-30 00:38:48,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:38:48,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495395603] [2020-11-30 00:38:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 00:38:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:38:51,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 00:38:51,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:38:52,731 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-30 00:38:53,795 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-11-30 00:38:55,974 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-11-30 00:38:58,157 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-11-30 00:39:04,821 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-11-30 00:39:06,978 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))))))) is different from true [2020-11-30 00:39:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:39:20,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:39:23,800 WARN L193 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-11-30 00:39:25,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2020-11-30 00:39:28,097 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2020-11-30 00:39:30,906 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from false [2020-11-30 00:39:33,111 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) .cse2) .cse2))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse0)) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from true [2020-11-30 00:39:35,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2020-11-30 00:39:37,508 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2020-11-30 00:39:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:39:37,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495395603] [2020-11-30 00:39:37,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:39:37,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-11-30 00:39:37,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519044442] [2020-11-30 00:39:37,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 00:39:37,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:39:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 00:39:37,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=10, NotChecked=90, Total=156 [2020-11-30 00:39:37,527 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand 13 states. [2020-11-30 00:39:39,806 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from false [2020-11-30 00:39:42,030 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0)) .cse2) .cse2))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) is different from true [2020-11-30 00:39:44,311 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) .cse3) .cse3))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 10.0))))))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2020-11-30 00:40:40,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) .cse3) .cse3))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))))) is different from false [2020-11-30 00:40:42,573 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__a~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) (forall ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse3) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) .cse3) .cse3))))))))) (or (not (= c_ULTIMATE.start_main_~main__a~0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))))) is different from true [2020-11-30 00:40:44,768 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse2)) .cse1) .cse1))))))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))))) is different from false [2020-11-30 00:40:47,817 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse2)) .cse1) .cse1))))))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))))) is different from true [2020-11-30 00:40:50,021 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__r~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 32))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_4|))))) (and (= c_ULTIMATE.start_main_~main__r~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse1 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse2)) .cse1) .cse1))))))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from false [2020-11-30 00:40:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:40:50,164 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-11-30 00:40:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:40:50,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-11-30 00:40:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:40:50,165 INFO L225 Difference]: With dead ends: 12 [2020-11-30 00:40:50,165 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 00:40:50,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 100.5s TimeCoverageRelationStatistics Valid=37, Invalid=31, Unknown=18, NotChecked=220, Total=306 [2020-11-30 00:40:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 00:40:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 00:40:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 00:40:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 00:40:50,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-11-30 00:40:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:40:50,167 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:40:50,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 00:40:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:40:50,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 00:40:50,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 00:40:50,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 00:40:50,426 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 00:40:50,427 INFO L274 CegarLoopResult]: For program point L27(lines 27 90) no Hoare annotation was computed. [2020-11-30 00:40:50,427 INFO L274 CegarLoopResult]: For program point L25(lines 25 95) no Hoare annotation was computed. [2020-11-30 00:40:50,427 INFO L274 CegarLoopResult]: For program point L48(lines 48 74) no Hoare annotation was computed. [2020-11-30 00:40:50,427 INFO L274 CegarLoopResult]: For program point L46(lines 46 79) no Hoare annotation was computed. [2020-11-30 00:40:50,427 INFO L270 CegarLoopResult]: At program point L73(lines 48 74) the Hoare annotation is: (= (_ bv1 32) ULTIMATE.start_main_~main____CPAchecker_TMP_1~0) [2020-11-30 00:40:50,427 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-30 00:40:50,427 INFO L274 CegarLoopResult]: For program point L30(lines 30 85) no Hoare annotation was computed. [2020-11-30 00:40:50,428 INFO L277 CegarLoopResult]: At program point L94(lines 19 96) the Hoare annotation is: true [2020-11-30 00:40:50,428 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 00:40:50,428 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-30 00:40:50,428 INFO L274 CegarLoopResult]: For program point L57(lines 57 66) no Hoare annotation was computed. [2020-11-30 00:40:50,428 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-11-30 00:40:50,428 INFO L270 CegarLoopResult]: At program point L78(lines 46 79) the Hoare annotation is: false [2020-11-30 00:40:50,428 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-11-30 00:40:50,428 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-11-30 00:40:50,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:40:50 BoogieIcfgContainer [2020-11-30 00:40:50,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:40:50,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:40:50,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:40:50,444 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:40:50,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:37:42" (3/4) ... [2020-11-30 00:40:50,449 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 00:40:50,462 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-11-30 00:40:50,463 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-11-30 00:40:50,463 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:40:50,464 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:40:50,524 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0d25cf5f-c912-4453-bcf3-af6fd7dee8b4/bin/uautomizer/witness.graphml [2020-11-30 00:40:50,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:40:50,527 INFO L168 Benchmark]: Toolchain (without parser) took 191669.71 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 60.7 MB in the beginning and 62.5 MB in the end (delta: -1.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:40:50,527 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 75.5 MB. Free memory is still 58.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:40:50,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.64 ms. Allocated memory is still 75.5 MB. Free memory was 60.7 MB in the beginning and 59.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:40:50,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.27 ms. Allocated memory is still 75.5 MB. Free memory was 59.3 MB in the beginning and 57.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:40:50,529 INFO L168 Benchmark]: Boogie Preprocessor took 41.93 ms. Allocated memory is still 75.5 MB. Free memory was 57.6 MB in the beginning and 56.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:40:50,530 INFO L168 Benchmark]: RCFGBuilder took 3455.79 ms. Allocated memory is still 75.5 MB. Free memory was 56.1 MB in the beginning and 41.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:40:50,536 INFO L168 Benchmark]: TraceAbstraction took 187502.80 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 40.8 MB in the beginning and 65.0 MB in the end (delta: -24.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:40:50,537 INFO L168 Benchmark]: Witness Printer took 81.32 ms. Allocated memory is still 92.3 MB. Free memory was 65.0 MB in the beginning and 62.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:40:50,540 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 75.5 MB. Free memory is still 58.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 492.64 ms. Allocated memory is still 75.5 MB. Free memory was 60.7 MB in the beginning and 59.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.27 ms. Allocated memory is still 75.5 MB. Free memory was 59.3 MB in the beginning and 57.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.93 ms. Allocated memory is still 75.5 MB. Free memory was 57.6 MB in the beginning and 56.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3455.79 ms. Allocated memory is still 75.5 MB. Free memory was 56.1 MB in the beginning and 41.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 187502.80 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 40.8 MB in the beginning and 65.0 MB in the end (delta: -24.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 81.32 ms. Allocated memory is still 92.3 MB. Free memory was 65.0 MB in the beginning and 62.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1bv32 == main____CPAchecker_TMP_1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 187.3s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 93.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 SDtfs, 2 SDslu, 53 SDs, 0 SdLazy, 21 SolverSat, 0 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 140.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5 NumberOfFragments, 5 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 85.9s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 56 ConstructedInterpolants, 19 QuantifiedInterpolants, 33132 SizeOfPredicates, 21 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...