./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ................................................................................................................................................................................................................................................................................. 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_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 15:15:57,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:15:57,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:15:58,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:15:58,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:15:58,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:15:58,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:15:58,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:15:58,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:15:58,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:15:58,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:15:58,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:15:58,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:15:58,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:15:58,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:15:58,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:15:58,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:15:58,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:15:58,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:15:58,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:15:58,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:15:58,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:15:58,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:15:58,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:15:58,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:15:58,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:15:58,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:15:58,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:15:58,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:15:58,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:15:58,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:15:58,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:15:58,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:15:58,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:15:58,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:15:58,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:15:58,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:15:58,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:15:58,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:15:58,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:15:58,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:15:58,098 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:15:58,127 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:15:58,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:15:58,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:15:58,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:15:58,134 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:15:58,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:15:58,135 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:15:58,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:15:58,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:15:58,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:15:58,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:15:58,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:15:58,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:15:58,136 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:15:58,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:15:58,137 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:15:58,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:15:58,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:15:58,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:15:58,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:15:58,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:15:58,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:15:58,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:15:58,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:15:58,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:15:58,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:15:58,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:15:58,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:15:58,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:15:58,142 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_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2020-12-01 15:15:58,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:15:58,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:15:58,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:15:58,456 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:15:58,457 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:15:58,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-12-01 15:15:58,558 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/acfd05cb0/124f73bf1d2743ca94644e0943e47fb6/FLAG2ca9b94bd [2020-12-01 15:15:59,109 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:15:59,109 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-12-01 15:15:59,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/acfd05cb0/124f73bf1d2743ca94644e0943e47fb6/FLAG2ca9b94bd [2020-12-01 15:15:59,481 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/acfd05cb0/124f73bf1d2743ca94644e0943e47fb6 [2020-12-01 15:15:59,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:15:59,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:15:59,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:15:59,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:15:59,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:15:59,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edcfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59, skipping insertion in model container [2020-12-01 15:15:59,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:15:59,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:15:59,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:15:59,765 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:15:59,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:15:59,817 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:15:59,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59 WrapperNode [2020-12-01 15:15:59,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:15:59,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:15:59,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:15:59,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:15:59,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:15:59,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:15:59,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:15:59,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:15:59,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... [2020-12-01 15:15:59,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:15:59,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:15:59,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:15:59,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:15:59,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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-12-01 15:16:00,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:16:00,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:16:00,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:16:00,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:16:00,348 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:16:00,348 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-01 15:16:00,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:00 BoogieIcfgContainer [2020-12-01 15:16:00,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:16:00,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:16:00,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:16:00,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:16:00,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:15:59" (1/3) ... [2020-12-01 15:16:00,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19793419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:16:00, skipping insertion in model container [2020-12-01 15:16:00,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:15:59" (2/3) ... [2020-12-01 15:16:00,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19793419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:16:00, skipping insertion in model container [2020-12-01 15:16:00,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:00" (3/3) ... [2020-12-01 15:16:00,360 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-12-01 15:16:00,375 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:16:00,378 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-01 15:16:00,390 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-01 15:16:00,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:16:00,417 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:16:00,417 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:16:00,418 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:16:00,418 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:16:00,418 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:16:00,418 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:16:00,418 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:16:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-12-01 15:16:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 15:16:00,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:16:00,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:16:00,439 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:16:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:16:00,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2020-12-01 15:16:00,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:16:00,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333313421] [2020-12-01 15:16:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:16:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:16:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:16:00,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333313421] [2020-12-01 15:16:00,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:16:00,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:16:00,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588499511] [2020-12-01 15:16:00,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-01 15:16:00,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:16:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-01 15:16:00,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-01 15:16:00,678 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-12-01 15:16:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:16:00,698 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-12-01 15:16:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-01 15:16:00,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-12-01 15:16:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:16:00,709 INFO L225 Difference]: With dead ends: 22 [2020-12-01 15:16:00,710 INFO L226 Difference]: Without dead ends: 8 [2020-12-01 15:16:00,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-01 15:16:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-12-01 15:16:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-12-01 15:16:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-12-01 15:16:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-12-01 15:16:00,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2020-12-01 15:16:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:16:00,778 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-12-01 15:16:00,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-01 15:16:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-12-01 15:16:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 15:16:00,780 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:16:00,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:16:00,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:16:00,781 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:16:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:16:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2020-12-01 15:16:00,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:16:00,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632685930] [2020-12-01 15:16:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:16:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:16:00,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:16:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:16:00,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:16:00,947 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:16:00,948 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:16:00,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:16:01,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:16:00 BoogieIcfgContainer [2020-12-01 15:16:01,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:16:01,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:16:01,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:16:01,002 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:16:01,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:00" (3/4) ... [2020-12-01 15:16:01,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-01 15:16:01,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:16:01,012 INFO L168 Benchmark]: Toolchain (without parser) took 1515.79 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 61.8 MB in the beginning and 89.9 MB in the end (delta: -28.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:16:01,013 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 90.2 MB. Free memory was 46.6 MB in the beginning and 46.6 MB in the end (delta: 71.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:16:01,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.12 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 61.6 MB in the beginning and 90.6 MB in the end (delta: -29.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:16:01,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.40 ms. Allocated memory is still 113.2 MB. Free memory was 90.2 MB in the beginning and 89.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:16:01,018 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 ms. Allocated memory is still 113.2 MB. Free memory was 89.0 MB in the beginning and 88.1 MB in the end (delta: 911.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:16:01,019 INFO L168 Benchmark]: RCFGBuilder took 438.52 ms. Allocated memory is still 113.2 MB. Free memory was 88.1 MB in the beginning and 77.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 15:16:01,021 INFO L168 Benchmark]: TraceAbstraction took 648.37 ms. Allocated memory is still 113.2 MB. Free memory was 76.4 MB in the beginning and 90.5 MB in the end (delta: -14.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:16:01,023 INFO L168 Benchmark]: Witness Printer took 6.12 ms. Allocated memory is still 113.2 MB. Free memory was 90.5 MB in the beginning and 89.9 MB in the end (delta: 590.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:16:01,038 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.35 ms. Allocated memory is still 90.2 MB. Free memory was 46.6 MB in the beginning and 46.6 MB in the end (delta: 71.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 323.12 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 61.6 MB in the beginning and 90.6 MB in the end (delta: -29.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.40 ms. Allocated memory is still 113.2 MB. Free memory was 90.2 MB in the beginning and 89.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.11 ms. Allocated memory is still 113.2 MB. Free memory was 89.0 MB in the beginning and 88.1 MB in the end (delta: 911.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 438.52 ms. Allocated memory is still 113.2 MB. Free memory was 88.1 MB in the beginning and 77.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 648.37 ms. Allocated memory is still 113.2 MB. Free memory was 76.4 MB in the beginning and 90.5 MB in the end (delta: -14.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 16.1 GB. * Witness Printer took 6.12 ms. Allocated memory is still 113.2 MB. Free memory was 90.5 MB in the beginning and 89.9 MB in the end (delta: 590.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L14] COND FALSE !(!cond) VAL [sqrt2=11863283/8388608] [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L3] __assert_fail("0", "sqrt_poly.c", 3, "reach_error") VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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-69874e2 [2020-12-01 15:16:03,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:16:03,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:16:03,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:16:03,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:16:03,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:16:03,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:16:03,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:16:03,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:16:03,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:16:03,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:16:03,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:16:03,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:16:03,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:16:03,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:16:03,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:16:03,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:16:03,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:16:03,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:16:03,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:16:03,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:16:03,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:16:03,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:16:03,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:16:04,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:16:04,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:16:04,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:16:04,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:16:04,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:16:04,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:16:04,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:16:04,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:16:04,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:16:04,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:16:04,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:16:04,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:16:04,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:16:04,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:16:04,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:16:04,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:16:04,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:16:04,024 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-01 15:16:04,076 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:16:04,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:16:04,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:16:04,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:16:04,081 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:16:04,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:16:04,082 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:16:04,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:16:04,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:16:04,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:16:04,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:16:04,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:16:04,084 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-01 15:16:04,085 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-01 15:16:04,085 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:16:04,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:16:04,085 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:16:04,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:16:04,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:16:04,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:16:04,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:16:04,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:16:04,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:16:04,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:16:04,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:16:04,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:16:04,097 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-01 15:16:04,097 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-01 15:16:04,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:16:04,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:16:04,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-01 15:16:04,098 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_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2020-12-01 15:16:04,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:16:04,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:16:04,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:16:04,589 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:16:04,590 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:16:04,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-12-01 15:16:04,692 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/14c7484ba/d675829b48bb4fb7a95e9b04138039f5/FLAG91ce16729 [2020-12-01 15:16:05,434 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:16:05,435 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-12-01 15:16:05,450 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/14c7484ba/d675829b48bb4fb7a95e9b04138039f5/FLAG91ce16729 [2020-12-01 15:16:05,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/data/14c7484ba/d675829b48bb4fb7a95e9b04138039f5 [2020-12-01 15:16:05,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:16:05,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:16:05,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:16:05,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:16:05,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:16:05,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:16:05" (1/1) ... [2020-12-01 15:16:05,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497cf8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05, skipping insertion in model container [2020-12-01 15:16:05,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:16:05" (1/1) ... [2020-12-01 15:16:05,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:16:05,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:16:06,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:16:06,081 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:16:06,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:16:06,135 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:16:06,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06 WrapperNode [2020-12-01 15:16:06,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:16:06,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:16:06,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:16:06,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:16:06,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:16:06,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:16:06,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:16:06,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:16:06,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... [2020-12-01 15:16:06,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:16:06,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:16:06,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:16:06,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:16:06,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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-12-01 15:16:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-01 15:16:06,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:16:06,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:16:06,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:16:11,073 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:16:11,073 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-01 15:16:11,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:11 BoogieIcfgContainer [2020-12-01 15:16:11,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:16:11,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:16:11,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:16:11,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:16:11,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:16:05" (1/3) ... [2020-12-01 15:16:11,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:16:11, skipping insertion in model container [2020-12-01 15:16:11,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:06" (2/3) ... [2020-12-01 15:16:11,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:16:11, skipping insertion in model container [2020-12-01 15:16:11,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:11" (3/3) ... [2020-12-01 15:16:11,087 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-12-01 15:16:11,105 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:16:11,109 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-01 15:16:11,123 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-01 15:16:11,149 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:16:11,149 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:16:11,149 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:16:11,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:16:11,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:16:11,150 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:16:11,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:16:11,150 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:16:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-12-01 15:16:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 15:16:11,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:16:11,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:16:11,168 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:16:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:16:11,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2020-12-01 15:16:11,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-01 15:16:11,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104079959] [2020-12-01 15:16:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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-12-01 15:16:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:16:12,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-01 15:16:12,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:16:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:16:12,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-01 15:16:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:16:12,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104079959] [2020-12-01 15:16:12,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:16:12,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-01 15:16:12,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493489855] [2020-12-01 15:16:12,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-01 15:16:12,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-01 15:16:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-01 15:16:12,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-01 15:16:12,555 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-12-01 15:16:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:16:12,572 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-12-01 15:16:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-01 15:16:12,574 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-12-01 15:16:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:16:12,585 INFO L225 Difference]: With dead ends: 22 [2020-12-01 15:16:12,585 INFO L226 Difference]: Without dead ends: 8 [2020-12-01 15:16:12,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-01 15:16:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-12-01 15:16:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-12-01 15:16:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-12-01 15:16:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-12-01 15:16:12,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2020-12-01 15:16:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:16:12,627 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-12-01 15:16:12,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-01 15:16:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-12-01 15:16:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 15:16:12,628 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:16:12,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:16:12,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-01 15:16:12,853 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:16:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:16:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2020-12-01 15:16:12,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-01 15:16:12,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834430227] [2020-12-01 15:16:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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-12-01 15:16:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:16:15,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-01 15:16:15,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:16:15,624 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-01 15:16:17,987 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-12-01 15:16:18,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:16:22,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:16:35,125 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq .cse2 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse2 .cse1)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse6) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and .cse7 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))))) is different from false [2020-12-01 15:16:45,839 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)))))) is different from false [2020-12-01 15:16:47,941 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4)))))) is different from true [2020-12-01 15:16:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:16:47,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-01 15:16:50,370 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2020-12-01 15:16:52,509 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2020-12-01 15:16:54,670 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-12-01 15:16:56,804 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-12-01 15:16:56,846 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-01 15:16:56,847 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-01 15:16:56,852 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-01 15:16:58,878 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-12-01 15:17:01,145 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-12-01 15:17:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:17:01,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834430227] [2020-12-01 15:17:01,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:17:01,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-12-01 15:17:01,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516184693] [2020-12-01 15:17:01,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:17:01,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-01 15:17:01,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:17:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2020-12-01 15:17:01,151 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2020-12-01 15:17:03,300 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-12-01 15:17:05,594 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-12-01 15:17:07,717 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from false [2020-12-01 15:17:09,860 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from true [2020-12-01 15:17:11,984 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-12-01 15:17:14,127 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-12-01 15:17:16,270 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-12-01 15:17:18,407 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.geq .cse3 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse3 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse6)))))) .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0) (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))))) is different from false [2020-12-01 15:17:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:17:18,537 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-12-01 15:17:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:17:18,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-12-01 15:17:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:17:18,538 INFO L225 Difference]: With dead ends: 12 [2020-12-01 15:17:18,538 INFO L226 Difference]: Without dead ends: 8 [2020-12-01 15:17:18,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2020-12-01 15:17:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-12-01 15:17:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-12-01 15:17:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-12-01 15:17:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-12-01 15:17:18,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-12-01 15:17:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:17:18,543 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-12-01 15:17:18,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:17:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-12-01 15:17:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 15:17:18,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:17:18,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:17:18,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-01 15:17:18,770 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:17:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:17:18,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2020-12-01 15:17:18,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-01 15:17:18,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175483241] [2020-12-01 15:17:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/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-12-01 15:17:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:17:27,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-01 15:17:27,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:17:27,923 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-01 15:17:28,161 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-01 15:17:30,313 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-12-01 15:17:30,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:17:34,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:17:47,700 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse1)) (fp.geq .cse0 .cse2) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (not (fp.leq (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.geq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7))) is different from false [2020-12-01 15:17:58,539 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from false [2020-12-01 15:18:00,639 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from true [2020-12-01 15:18:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:18:00,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-01 15:18:01,016 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-01 15:18:03,160 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-12-01 15:18:05,290 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-12-01 15:18:07,438 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-12-01 15:18:09,582 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-12-01 15:18:09,598 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-01 15:18:09,599 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-01 15:18:09,601 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-01 15:18:11,698 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-12-01 15:18:13,959 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-12-01 15:18:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:18:13,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175483241] [2020-12-01 15:18:13,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:18:13,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-12-01 15:18:13,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016254879] [2020-12-01 15:18:13,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:18:13,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-01 15:18:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:18:13,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2020-12-01 15:18:13,963 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand 13 states. [2020-12-01 15:18:16,129 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-12-01 15:18:18,393 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-12-01 15:18:20,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from false [2020-12-01 15:18:22,694 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from true [2020-12-01 15:18:24,835 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-12-01 15:18:26,975 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-12-01 15:18:29,120 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) is different from false [2020-12-01 15:18:31,285 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (not (fp.geq ULTIMATE.start_main_~I~0 .cse2)) (fp.geq .cse1 .cse3) (fp.geq ULTIMATE.start_main_~I~0 .cse3) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse6 (let ((.cse7 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse6))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse5)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.geq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0)))) is different from false [2020-12-01 15:18:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:18:31,308 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-12-01 15:18:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:18:31,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-12-01 15:18:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:18:31,309 INFO L225 Difference]: With dead ends: 8 [2020-12-01 15:18:31,309 INFO L226 Difference]: Without dead ends: 0 [2020-12-01 15:18:31,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2020-12-01 15:18:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-01 15:18:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-01 15:18:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-01 15:18:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-01 15:18:31,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-12-01 15:18:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:18:31,311 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-01 15:18:31,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:18:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-01 15:18:31,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-01 15:18:31,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-01 15:18:31,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-01 15:18:31,552 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-01 15:18:31,552 INFO L265 CegarLoopResult]: At program point L31(lines 20 32) the Hoare annotation is: true [2020-12-01 15:18:31,552 INFO L262 CegarLoopResult]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2020-12-01 15:18:31,552 INFO L262 CegarLoopResult]: For program point L13(lines 27 28) no Hoare annotation was computed. [2020-12-01 15:18:31,553 INFO L262 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-12-01 15:18:31,553 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-01 15:18:31,553 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-01 15:18:31,553 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-01 15:18:31,553 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-12-01 15:18:31,553 INFO L262 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-12-01 15:18:31,554 INFO L262 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-12-01 15:18:31,554 INFO L262 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-12-01 15:18:31,554 INFO L265 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: true [2020-12-01 15:18:31,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:18:31 BoogieIcfgContainer [2020-12-01 15:18:31,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:18:31,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:18:31,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:18:31,565 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:18:31,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:11" (3/4) ... [2020-12-01 15:18:31,569 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-01 15:18:31,582 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-12-01 15:18:31,582 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-01 15:18:31,582 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-01 15:18:31,582 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-01 15:18:31,621 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1ade96f7-4e22-4b33-bcc3-d15070d2b1f5/bin/uautomizer/witness.graphml [2020-12-01 15:18:31,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:18:31,623 INFO L168 Benchmark]: Toolchain (without parser) took 145827.09 ms. Allocated memory is still 67.1 MB. Free memory was 43.8 MB in the beginning and 44.8 MB in the end (delta: -924.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:18:31,623 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 52.4 MB. Free memory was 33.1 MB in the beginning and 33.1 MB in the end (delta: 35.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:18:31,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.25 ms. Allocated memory is still 67.1 MB. Free memory was 43.7 MB in the beginning and 50.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 15:18:31,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.84 ms. Allocated memory is still 67.1 MB. Free memory was 50.7 MB in the beginning and 49.9 MB in the end (delta: 759.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:18:31,625 INFO L168 Benchmark]: Boogie Preprocessor took 57.82 ms. Allocated memory is still 67.1 MB. Free memory was 49.7 MB in the beginning and 48.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:18:31,626 INFO L168 Benchmark]: RCFGBuilder took 4792.68 ms. Allocated memory is still 67.1 MB. Free memory was 48.6 MB in the beginning and 37.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 15:18:31,627 INFO L168 Benchmark]: TraceAbstraction took 140485.55 ms. Allocated memory is still 67.1 MB. Free memory was 36.5 MB in the beginning and 47.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:18:31,627 INFO L168 Benchmark]: Witness Printer took 57.70 ms. Allocated memory is still 67.1 MB. Free memory was 46.9 MB in the beginning and 44.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:18:31,631 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.18 ms. Allocated memory is still 52.4 MB. Free memory was 33.1 MB in the beginning and 33.1 MB in the end (delta: 35.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 335.25 ms. Allocated memory is still 67.1 MB. Free memory was 43.7 MB in the beginning and 50.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.84 ms. Allocated memory is still 67.1 MB. Free memory was 50.7 MB in the beginning and 49.9 MB in the end (delta: 759.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.82 ms. Allocated memory is still 67.1 MB. Free memory was 49.7 MB in the beginning and 48.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4792.68 ms. Allocated memory is still 67.1 MB. Free memory was 48.6 MB in the beginning and 37.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 140485.55 ms. Allocated memory is still 67.1 MB. Free memory was 36.5 MB in the beginning and 47.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. * Witness Printer took 57.70 ms. Allocated memory is still 67.1 MB. Free memory was 46.9 MB in the beginning and 44.8 MB in the end (delta: 2.1 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: 3]: 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 140.3s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 34.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 16 SDs, 0 SdLazy, 12 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 79.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 12.0s SatisfiabilityAnalysisTime, 92.6s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 10554 SizeOfPredicates, 15 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 20 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...