./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 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.1-wip.dd.multireach-323-8d31f38 [2021-07-04 23:47:27,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-04 23:47:27,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-04 23:47:27,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-04 23:47:27,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-04 23:47:27,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-04 23:47:27,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-04 23:47:27,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-04 23:47:27,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-04 23:47:27,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-04 23:47:27,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-04 23:47:27,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-04 23:47:27,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-04 23:47:27,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-04 23:47:27,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-04 23:47:27,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-04 23:47:27,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-04 23:47:27,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-04 23:47:27,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-04 23:47:27,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-04 23:47:27,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-04 23:47:27,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-04 23:47:27,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-04 23:47:27,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-04 23:47:27,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-04 23:47:27,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-04 23:47:27,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-04 23:47:27,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-04 23:47:27,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-04 23:47:27,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-04 23:47:27,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-04 23:47:27,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-04 23:47:27,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-04 23:47:27,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-04 23:47:27,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-04 23:47:27,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-04 23:47:27,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-04 23:47:27,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-04 23:47:27,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-04 23:47:27,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-04 23:47:27,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-04 23:47:27,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-07-04 23:47:27,479 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-04 23:47:27,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-04 23:47:27,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-04 23:47:27,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-04 23:47:27,482 INFO L138 SettingsManager]: * Use SBE=true [2021-07-04 23:47:27,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-04 23:47:27,482 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-04 23:47:27,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-04 23:47:27,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-04 23:47:27,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-04 23:47:27,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-04 23:47:27,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-04 23:47:27,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-04 23:47:27,484 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-04 23:47:27,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-04 23:47:27,484 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-04 23:47:27,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-04 23:47:27,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-04 23:47:27,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-04 23:47:27,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-04 23:47:27,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-04 23:47:27,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-04 23:47:27,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-04 23:47:27,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-04 23:47:27,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-04 23:47:27,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-04 23:47:27,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-04 23:47:27,486 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-04 23:47:27,486 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2021-07-04 23:47:27,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-04 23:47:27,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-04 23:47:27,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-04 23:47:27,783 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-04 23:47:27,784 INFO L275 PluginConnector]: CDTParser initialized [2021-07-04 23:47:27,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-07-04 23:47:27,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a93b2a3/7c4186d414ac49549a3a9080bdb29fad/FLAGf039e08a7 [2021-07-04 23:47:28,217 INFO L306 CDTParser]: Found 1 translation units. [2021-07-04 23:47:28,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-07-04 23:47:28,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a93b2a3/7c4186d414ac49549a3a9080bdb29fad/FLAGf039e08a7 [2021-07-04 23:47:28,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a93b2a3/7c4186d414ac49549a3a9080bdb29fad [2021-07-04 23:47:28,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-04 23:47:28,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-04 23:47:28,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-04 23:47:28,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-04 23:47:28,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-04 23:47:28,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51035019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28, skipping insertion in model container [2021-07-04 23:47:28,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-04 23:47:28,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-04 23:47:28,333 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-07-04 23:47:28,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-04 23:47:28,348 INFO L203 MainTranslator]: Completed pre-run [2021-07-04 23:47:28,360 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-07-04 23:47:28,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-04 23:47:28,381 INFO L208 MainTranslator]: Completed translation [2021-07-04 23:47:28,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28 WrapperNode [2021-07-04 23:47:28,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-04 23:47:28,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-04 23:47:28,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-04 23:47:28,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-04 23:47:28,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-04 23:47:28,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-04 23:47:28,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-04 23:47:28,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-04 23:47:28,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-04 23:47:28,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-04 23:47:28,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-04 23:47:28,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-04 23:47:28,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (1/1) ... [2021-07-04 23:47:28,464 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-04 23:47:28,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-04 23:47:28,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-07-04 23:47:28,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-07-04 23:47:28,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-04 23:47:28,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-04 23:47:28,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-04 23:47:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-04 23:47:28,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-04 23:47:28,791 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-07-04 23:47:28,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.07 11:47:28 BoogieIcfgContainer [2021-07-04 23:47:28,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-04 23:47:28,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-04 23:47:28,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-04 23:47:28,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-04 23:47:28,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.07 11:47:28" (1/3) ... [2021-07-04 23:47:28,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ac1783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.07 11:47:28, skipping insertion in model container [2021-07-04 23:47:28,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:28" (2/3) ... [2021-07-04 23:47:28,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ac1783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.07 11:47:28, skipping insertion in model container [2021-07-04 23:47:28,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.07 11:47:28" (3/3) ... [2021-07-04 23:47:28,817 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-07-04 23:47:28,822 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-04 23:47:28,822 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-04 23:47:28,885 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-04 23:47:28,889 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-04 23:47:28,904 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-04 23:47:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-07-04 23:47:28,917 INFO L517 BasicCegarLoop]: Found error trace [2021-07-04 23:47:28,917 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-04 23:47:28,933 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-04 23:47:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-04 23:47:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-07-04 23:47:28,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-04 23:47:28,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904400920] [2021-07-04 23:47:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-04 23:47:28,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-04 23:47:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-04 23:47:29,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:29,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:29,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:29,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-04 23:47:29,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-04 23:47:29,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904400920] [2021-07-04 23:47:29,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904400920] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-04 23:47:29,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-04 23:47:29,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-04 23:47:29,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504522100] [2021-07-04 23:47:29,077 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-04 23:47:29,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-04 23:47:29,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-04 23:47:29,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-04 23:47:29,086 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-04 23:47:29,093 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-07-04 23:47:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-04 23:47:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-07-04 23:47:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-04 23:47:29,098 INFO L225 Difference]: With dead ends: 21 [2021-07-04 23:47:29,098 INFO L226 Difference]: Without dead ends: 8 [2021-07-04 23:47:29,100 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-04 23:47:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-07-04 23:47:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-07-04 23:47:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-07-04 23:47:29,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-07-04 23:47:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-04 23:47:29,115 INFO L442 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-07-04 23:47:29,115 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-07-04 23:47:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-07-04 23:47:29,116 INFO L517 BasicCegarLoop]: Found error trace [2021-07-04 23:47:29,116 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-04 23:47:29,116 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-04 23:47:29,116 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-04 23:47:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-04 23:47:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-07-04 23:47:29,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-04 23:47:29,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031463600] [2021-07-04 23:47:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-04 23:47:29,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-04 23:47:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-04 23:47:29,133 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-04 23:47:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-04 23:47:29,158 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-04 23:47:29,175 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-04 23:47:29,175 INFO L639 BasicCegarLoop]: Counterexample is feasible [2021-07-04 23:47:29,177 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-04 23:47:29,177 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-04 23:47:29,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.07 11:47:29 BoogieIcfgContainer [2021-07-04 23:47:29,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-04 23:47:29,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-04 23:47:29,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-04 23:47:29,198 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-04 23:47:29,198 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.07 11:47:28" (3/4) ... [2021-07-04 23:47:29,200 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-07-04 23:47:29,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-04 23:47:29,202 INFO L168 Benchmark]: Toolchain (without parser) took 966.52 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 32.8 MB in the beginning and 46.1 MB in the end (delta: -13.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-04 23:47:29,202 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 54.5 MB. Free memory is still 36.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-04 23:47:29,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.44 ms. Allocated memory is still 54.5 MB. Free memory was 32.6 MB in the beginning and 38.1 MB in the end (delta: -5.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-07-04 23:47:29,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.68 ms. Allocated memory is still 54.5 MB. Free memory was 38.1 MB in the beginning and 36.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-04 23:47:29,208 INFO L168 Benchmark]: Boogie Preprocessor took 31.55 ms. Allocated memory is still 54.5 MB. Free memory was 36.6 MB in the beginning and 35.6 MB in the end (delta: 973.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-04 23:47:29,208 INFO L168 Benchmark]: RCFGBuilder took 334.07 ms. Allocated memory is still 54.5 MB. Free memory was 35.6 MB in the beginning and 24.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-04 23:47:29,209 INFO L168 Benchmark]: TraceAbstraction took 403.35 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 23.9 MB in the beginning and 46.5 MB in the end (delta: -22.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2021-07-04 23:47:29,209 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 67.1 MB. Free memory was 46.5 MB in the beginning and 46.1 MB in the end (delta: 380.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-04 23:47:29,214 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.16 ms. Allocated memory is still 54.5 MB. Free memory is still 36.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 146.44 ms. Allocated memory is still 54.5 MB. Free memory was 32.6 MB in the beginning and 38.1 MB in the end (delta: -5.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.68 ms. Allocated memory is still 54.5 MB. Free memory was 38.1 MB in the beginning and 36.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.55 ms. Allocated memory is still 54.5 MB. Free memory was 36.6 MB in the beginning and 35.6 MB in the end (delta: 973.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 334.07 ms. Allocated memory is still 54.5 MB. Free memory was 35.6 MB in the beginning and 24.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 403.35 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 23.9 MB in the beginning and 46.5 MB in the end (delta: -22.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.76 ms. Allocated memory is still 67.1 MB. Free memory was 46.5 MB in the beginning and 46.1 MB in the end (delta: 380.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is 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] [L16] reach_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 296.4ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 5.8ms, AutomataDifference: 22.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 5.1ms SsaConstructionTime, 29.2ms SatisfiabilityAnalysisTime, 23.6ms InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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 [2021-07-04 23:47:29,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-04 23:47:30,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-04 23:47:30,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-04 23:47:30,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-04 23:47:30,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-04 23:47:30,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-04 23:47:30,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-04 23:47:30,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-04 23:47:30,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-04 23:47:30,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-04 23:47:30,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-04 23:47:30,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-04 23:47:30,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-04 23:47:30,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-04 23:47:30,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-04 23:47:30,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-04 23:47:30,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-04 23:47:30,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-04 23:47:30,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-04 23:47:30,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-04 23:47:30,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-04 23:47:30,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-04 23:47:30,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-04 23:47:30,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-04 23:47:30,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-04 23:47:30,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-04 23:47:30,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-04 23:47:30,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-04 23:47:30,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-04 23:47:30,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-04 23:47:30,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-04 23:47:30,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-04 23:47:30,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-04 23:47:30,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-04 23:47:30,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-04 23:47:30,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-04 23:47:30,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-04 23:47:30,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-04 23:47:30,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-04 23:47:30,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-04 23:47:30,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-04 23:47:30,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-07-04 23:47:30,890 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-04 23:47:30,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-04 23:47:30,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-04 23:47:30,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-04 23:47:30,892 INFO L138 SettingsManager]: * Use SBE=true [2021-07-04 23:47:30,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-04 23:47:30,892 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-04 23:47:30,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-04 23:47:30,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-04 23:47:30,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-04 23:47:30,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-04 23:47:30,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-04 23:47:30,894 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-07-04 23:47:30,894 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-07-04 23:47:30,895 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-04 23:47:30,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-04 23:47:30,895 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-04 23:47:30,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-04 23:47:30,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-04 23:47:30,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-04 23:47:30,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-04 23:47:30,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-04 23:47:30,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-04 23:47:30,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-04 23:47:30,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-04 23:47:30,896 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-07-04 23:47:30,897 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-07-04 23:47:30,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-04 23:47:30,897 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-04 23:47:30,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-07-04 23:47:30,897 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2021-07-04 23:47:31,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-04 23:47:31,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-04 23:47:31,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-04 23:47:31,132 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-04 23:47:31,133 INFO L275 PluginConnector]: CDTParser initialized [2021-07-04 23:47:31,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-07-04 23:47:31,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce50593a9/4fcb9e2c27c945989759320b49e7153f/FLAG1dae56691 [2021-07-04 23:47:31,543 INFO L306 CDTParser]: Found 1 translation units. [2021-07-04 23:47:31,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-07-04 23:47:31,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce50593a9/4fcb9e2c27c945989759320b49e7153f/FLAG1dae56691 [2021-07-04 23:47:31,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce50593a9/4fcb9e2c27c945989759320b49e7153f [2021-07-04 23:47:31,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-04 23:47:31,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-04 23:47:31,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-04 23:47:31,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-04 23:47:31,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-04 23:47:31,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.07 11:47:31" (1/1) ... [2021-07-04 23:47:31,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382271c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:31, skipping insertion in model container [2021-07-04 23:47:31,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.07 11:47:31" (1/1) ... [2021-07-04 23:47:31,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-04 23:47:31,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-04 23:47:32,051 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-07-04 23:47:32,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-04 23:47:32,065 INFO L203 MainTranslator]: Completed pre-run [2021-07-04 23:47:32,108 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-07-04 23:47:32,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-04 23:47:32,119 INFO L208 MainTranslator]: Completed translation [2021-07-04 23:47:32,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32 WrapperNode [2021-07-04 23:47:32,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-04 23:47:32,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-04 23:47:32,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-04 23:47:32,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-04 23:47:32,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-04 23:47:32,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-04 23:47:32,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-04 23:47:32,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-04 23:47:32,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-04 23:47:32,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-04 23:47:32,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-04 23:47:32,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-04 23:47:32,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (1/1) ... [2021-07-04 23:47:32,159 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-04 23:47:32,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-04 23:47:32,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-07-04 23:47:32,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-07-04 23:47:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-07-04 23:47:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-04 23:47:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-04 23:47:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-04 23:47:36,702 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-04 23:47:36,702 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-07-04 23:47:36,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.07 11:47:36 BoogieIcfgContainer [2021-07-04 23:47:36,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-04 23:47:36,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-04 23:47:36,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-04 23:47:36,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-04 23:47:36,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.07 11:47:31" (1/3) ... [2021-07-04 23:47:36,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f7b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.07 11:47:36, skipping insertion in model container [2021-07-04 23:47:36,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.07 11:47:32" (2/3) ... [2021-07-04 23:47:36,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f7b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.07 11:47:36, skipping insertion in model container [2021-07-04 23:47:36,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.07 11:47:36" (3/3) ... [2021-07-04 23:47:36,718 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-07-04 23:47:36,736 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-04 23:47:36,736 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-04 23:47:36,816 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-04 23:47:36,825 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-04 23:47:36,826 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-04 23:47:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-07-04 23:47:36,853 INFO L517 BasicCegarLoop]: Found error trace [2021-07-04 23:47:36,853 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-04 23:47:36,853 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-04 23:47:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-04 23:47:36,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-07-04 23:47:36,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-07-04 23:47:36,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350155791] [2021-07-04 23:47:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-04 23:47:36,885 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-07-04 23:47:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-07-04 23:47:36,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-07-04 23:47:36,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-07-04 23:47:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-04 23:47:37,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-07-04 23:47:37,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-04 23:47:37,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-04 23:47:37,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-07-04 23:47:37,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:37,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:47:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-04 23:47:37,517 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-07-04 23:47:37,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350155791] [2021-07-04 23:47:37,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350155791] provided 2 perfect and 0 imperfect interpolant sequences [2021-07-04 23:47:37,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-07-04 23:47:37,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-07-04 23:47:37,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886087181] [2021-07-04 23:47:37,522 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-04 23:47:37,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-07-04 23:47:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-04 23:47:37,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-04 23:47:37,531 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-04 23:47:37,539 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-07-04 23:47:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-04 23:47:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-07-04 23:47:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-04 23:47:37,545 INFO L225 Difference]: With dead ends: 21 [2021-07-04 23:47:37,545 INFO L226 Difference]: Without dead ends: 8 [2021-07-04 23:47:37,546 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-04 23:47:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-07-04 23:47:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-07-04 23:47:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-07-04 23:47:37,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-07-04 23:47:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-04 23:47:37,564 INFO L442 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-07-04 23:47:37,564 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:47:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-07-04 23:47:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-07-04 23:47:37,564 INFO L517 BasicCegarLoop]: Found error trace [2021-07-04 23:47:37,564 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-04 23:47:37,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-07-04 23:47:37,785 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-07-04 23:47:37,786 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-04 23:47:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-04 23:47:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-07-04 23:47:37,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-07-04 23:47:37,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884270351] [2021-07-04 23:47:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-04 23:47:37,791 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-07-04 23:47:37,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-07-04 23:47:37,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-07-04 23:47:37,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-07-04 23:47:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-04 23:47:39,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2021-07-04 23:47:39,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-04 23:47:39,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-04 23:47:39,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-04 23:47:39,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-04 23:47:39,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-04 23:47:39,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-04 23:47:39,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-04 23:47:39,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-04 23:47:39,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:39,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-04 23:47:40,261 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-07-04 23:47:40,266 INFO L142 QuantifierPusher]: treesize reduction 19, result has 57.8 percent of original size [2021-07-04 23:47:40,267 INFO L147 QuantifierPusher]: treesize reduction 4, result has 84.6 percent of original size 22 [2021-07-04 23:47:40,269 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-07-04 23:47:40,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-04 23:47:40,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-04 23:47:40,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-04 23:47:40,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-07-04 23:47:40,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,394 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:40,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:47:40,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:47:40,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:40,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:47:40,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:47:40,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:40,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:47:40,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:47:40,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:40,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:40,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:47:40,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:47:42,529 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 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (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 .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .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)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse2))))) is different from false [2021-07-04 23:47:42,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:42,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:42,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:42,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:47:42,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-07-04 23:47:42,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:42,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:42,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:42,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 118 [2021-07-04 23:47:42,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 119 [2021-07-04 23:47:42,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:42,557 INFO L732 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-07-04 23:47:42,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:47:42,606 INFO L739 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:42,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:42,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:44,742 INFO L732 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-07-04 23:47:44,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:47:44,746 INFO L739 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:44,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:44,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:46,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:46,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:46,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:49,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:49,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:49,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:49,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:47:49,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:49,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:49,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 115 [2021-07-04 23:47:51,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:51,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:51,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-07-04 23:47:51,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 238 [2021-07-04 23:47:51,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:51,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:51,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 220 [2021-07-04 23:47:51,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 221 [2021-07-04 23:47:57,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:57,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-07-04 23:47:57,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:57,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:57,558 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:57,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:57,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 258 [2021-07-04 23:47:57,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:57,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:57,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:57,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:57,563 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:57,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:57,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-07-04 23:47:57,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 258 [2021-07-04 23:47:59,903 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse3) (fp.geq ULTIMATE.start_main_~I~0 .cse1))))) (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (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)))))) .cse6)) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (fp.geq ULTIMATE.start_main_~I~0 .cse4))))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse9 (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8) .cse9))) (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse10)))))))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse7 .cse8) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (fp.geq .cse7 .cse9) (fp.geq ULTIMATE.start_main_~I~0 .cse9)))))))) is different from false [2021-07-04 23:47:59,930 INFO L142 QuantifierPusher]: treesize reduction 125, result has 52.3 percent of original size [2021-07-04 23:47:59,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:59,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:59,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:59,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:59,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:59,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:59,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 137 [2021-07-04 23:47:59,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:59,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:59,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:59,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:59,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:47:59,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:47:59,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:47:59,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:47:59,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:02,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:02,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:02,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:04,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:04,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:04,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:04,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:48:08,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:08,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:08,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:08,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:08,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:08,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:08,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:08,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:48:08,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:08,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:08,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:08,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:08,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:08,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:08,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:08,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:48:10,706 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ 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 v_prenex_1 .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 v_prenex_1 .cse0) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse2)))) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse5) .cse3))) (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)))))) .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse3))))) is different from false [2021-07-04 23:48:12,805 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ 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 v_prenex_1 .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 v_prenex_1 .cse0) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse2)))) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse5) .cse3))) (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)))))) .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse3))))) is different from true [2021-07-04 23:48:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-04 23:48:12,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-07-04 23:48:12,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:48:12,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:48:12,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:48:12,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:48:12,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:48:12,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:48:12,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:48:12,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:48:12,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:12,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-04 23:48:12,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-04 23:48:12,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:12,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-04 23:48:12,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-04 23:48:12,932 INFO L142 QuantifierPusher]: treesize reduction 23, result has 42.5 percent of original size [2021-07-04 23:48:12,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-04 23:48:12,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:12,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-04 23:48:13,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:13,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:13,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:13,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-07-04 23:48:13,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-07-04 23:48:13,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:13,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:13,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:13,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-07-04 23:48:13,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-07-04 23:48:13,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:13,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2021-07-04 23:48:13,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:13,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2021-07-04 23:48:15,328 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 [2021-07-04 23:48:17,483 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 [2021-07-04 23:48:17,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:17,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-07-04 23:48:17,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:17,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-07-04 23:48:17,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:17,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-07-04 23:48:17,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:17,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-07-04 23:48:19,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (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 [2021-07-04 23:48:21,858 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (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 [2021-07-04 23:48:21,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-07-04 23:48:21,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-07-04 23:48:21,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-07-04 23:48:21,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-07-04 23:48:21,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,915 INFO L142 QuantifierPusher]: treesize reduction 18, result has 53.8 percent of original size [2021-07-04 23:48:21,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-04 23:48:21,917 INFO L732 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2021-07-04 23:48:21,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:48:21,919 INFO L739 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:21,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:21,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:48:21,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-07-04 23:48:21,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-07-04 23:48:21,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,929 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:21,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:21,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:48:21,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:21,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:21,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:21,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:21,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:48:24,023 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.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 .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse3) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse4)))))) is different from false [2021-07-04 23:48:26,341 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.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 .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse3) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse4)))))) is different from true [2021-07-04 23:48:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-04 23:48:26,342 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-07-04 23:48:26,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884270351] [2021-07-04 23:48:26,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884270351] provided 2 perfect and 0 imperfect interpolant sequences [2021-07-04 23:48:26,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-07-04 23:48:26,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-07-04 23:48:26,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610218863] [2021-07-04 23:48:26,343 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-04 23:48:26,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-07-04 23:48:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-04 23:48:26,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2021-07-04 23:48:26,345 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:48:28,524 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.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 .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse3) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse4)))))) is different from false [2021-07-04 23:48:30,866 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.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 .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse3) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse4)))))) is different from true [2021-07-04 23:48:33,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3) .cse2))) (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)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse5 .cse6 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and .cse0 (or (not .cse5) (not .cse6))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0))) is different from false [2021-07-04 23:48:35,189 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3) .cse2))) (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)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse5 .cse6 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and .cse0 (or (not .cse5) (not .cse6))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0))) is different from true [2021-07-04 23:48:37,328 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse0))) (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 .cse1 .cse0) (fp.leq .cse1 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0))) is different from false [2021-07-04 23:48:39,525 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse0))) (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 .cse1 .cse0) (fp.leq .cse1 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0))) is different from true [2021-07-04 23:48:41,678 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 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (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 .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .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)))))) c_ULTIMATE.start_main_~S~0) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) is different from false [2021-07-04 23:48:43,850 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse3) (fp.geq ULTIMATE.start_main_~I~0 .cse1))))) (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (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)))))) .cse6)) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (fp.geq ULTIMATE.start_main_~I~0 .cse4))))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse9 (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8) .cse9))) (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse10)))))))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse7 .cse8) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (fp.geq .cse7 .cse9) (fp.geq ULTIMATE.start_main_~I~0 .cse9))))))))) is different from false [2021-07-04 23:48:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-04 23:48:43,978 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2021-07-04 23:48:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-04 23:48:43,979 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-07-04 23:48:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-04 23:48:43,979 INFO L225 Difference]: With dead ends: 12 [2021-07-04 23:48:43,980 INFO L226 Difference]: Without dead ends: 8 [2021-07-04 23:48:43,981 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40108.4ms TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2021-07-04 23:48:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-07-04 23:48:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-07-04 23:48:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:48:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2021-07-04 23:48:43,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2021-07-04 23:48:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-04 23:48:43,983 INFO L442 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2021-07-04 23:48:43,983 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:48:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2021-07-04 23:48:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-07-04 23:48:43,983 INFO L517 BasicCegarLoop]: Found error trace [2021-07-04 23:48:43,983 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-04 23:48:44,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-07-04 23:48:44,193 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-07-04 23:48:44,193 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-04 23:48:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-04 23:48:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2021-07-04 23:48:44,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-07-04 23:48:44,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085824081] [2021-07-04 23:48:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-04 23:48:44,194 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-07-04 23:48:44,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-07-04 23:48:44,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-07-04 23:48:44,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-07-04 23:48:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-04 23:48:53,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-07-04 23:48:53,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-04 23:48:53,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-04 23:48:53,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-04 23:48:53,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-04 23:48:53,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-04 23:48:53,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-04 23:48:53,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-04 23:48:53,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-07-04 23:48:53,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:53,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-07-04 23:48:54,241 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-07-04 23:48:54,245 INFO L142 QuantifierPusher]: treesize reduction 19, result has 52.5 percent of original size [2021-07-04 23:48:54,247 INFO L147 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size 17 [2021-07-04 23:48:54,247 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-07-04 23:48:54,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-04 23:48:54,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-04 23:48:54,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-04 23:48:54,503 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-07-04 23:48:54,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:48:54,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:54,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:48:54,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:48:54,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:54,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:48:54,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:48:54,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:54,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:48:54,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:48:54,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,537 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:54,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:54,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:48:54,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-04 23:48:56,684 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 1.0))) (and (= 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)))))))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) is different from false [2021-07-04 23:48:56,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:56,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:56,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:56,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-04 23:48:56,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-07-04 23:48:56,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:56,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:56,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:56,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2021-07-04 23:48:56,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 118 [2021-07-04 23:48:56,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:56,715 INFO L732 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-07-04 23:48:56,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:48:56,717 INFO L739 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:56,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:56,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:58,876 INFO L732 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-07-04 23:48:58,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:48:58,882 INFO L739 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:48:58,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:48:58,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:01,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:01,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:01,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:03,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:03,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:03,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:03,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:03,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:03,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:03,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2021-07-04 23:49:05,340 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:05,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:05,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-07-04 23:49:05,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 236 [2021-07-04 23:49:05,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:05,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:05,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 217 [2021-07-04 23:49:05,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 218 [2021-07-04 23:49:11,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,806 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:11,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:11,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:11,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:11,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:11,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-07-04 23:49:11,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 257 [2021-07-04 23:49:11,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:11,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:11,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:11,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-07-04 23:49:11,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:11,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:11,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:11,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 257 [2021-07-04 23:49:14,237 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (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))))) .cse2) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 (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))))))))))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse3 .cse4) (not (fp.geq ULTIMATE.start_main_~I~0 .cse4)) (fp.geq .cse3 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse5))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and .cse2 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse7 (let ((.cse8 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7))) (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse9)) (not (fp.geq ULTIMATE.start_main_~I~0 .cse9)) (fp.geq ULTIMATE.start_main_~I~0 .cse7))))))) is different from false [2021-07-04 23:49:14,270 INFO L142 QuantifierPusher]: treesize reduction 124, result has 52.5 percent of original size [2021-07-04 23:49:14,271 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:14,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:14,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:14,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:14,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:14,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:14,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 137 [2021-07-04 23:49:14,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:14,293 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:14,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:14,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:14,294 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:14,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:14,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:14,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:14,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:16,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:16,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:16,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:18,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:18,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:18,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:18,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:22,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:22,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:22,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:22,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:22,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:22,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:22,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:22,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:22,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:22,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:22,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:22,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:22,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:22,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:22,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:22,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:25,215 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 (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (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))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven v_prenex_2 .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))))))))) .cse4)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse4)))))) is different from false [2021-07-04 23:49:27,313 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 (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (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))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven v_prenex_2 .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))))))))) .cse4)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse4)))))) is different from true [2021-07-04 23:49:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-04 23:49:27,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-07-04 23:49:27,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:49:27,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:49:27,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:49:27,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-04 23:49:27,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:49:27,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:49:27,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:49:27,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-04 23:49:27,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:27,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-04 23:49:27,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-04 23:49:27,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:27,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-04 23:49:27,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-04 23:49:27,474 INFO L142 QuantifierPusher]: treesize reduction 23, result has 42.5 percent of original size [2021-07-04 23:49:27,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-04 23:49:27,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-04 23:49:27,758 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2021-07-04 23:49:27,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:27,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:27,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-04 23:49:27,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:27,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:27,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-04 23:49:27,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2021-07-04 23:49:27,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:27,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2021-07-04 23:49:29,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) is different from false [2021-07-04 23:49:32,082 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) is different from true [2021-07-04 23:49:32,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:32,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-04 23:49:32,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:32,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-04 23:49:32,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:32,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-04 23:49:32,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:32,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-07-04 23:49:34,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) is different from false [2021-07-04 23:49:36,410 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) is different from true [2021-07-04 23:49:36,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-07-04 23:49:36,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 126 [2021-07-04 23:49:36,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-07-04 23:49:36,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 126 [2021-07-04 23:49:36,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,448 INFO L142 QuantifierPusher]: treesize reduction 18, result has 53.8 percent of original size [2021-07-04 23:49:36,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-04 23:49:36,450 INFO L732 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2021-07-04 23:49:36,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:49:36,451 INFO L739 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:36,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:36,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:36,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-07-04 23:49:36,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2021-07-04 23:49:36,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,459 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:36,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:36,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:36,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,462 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:36,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-04 23:49:36,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-04 23:49:36,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-04 23:49:36,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-07-04 23:49:38,557 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0)) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (fp.geq (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))))))))) .cse0)))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2)) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3) (fp.leq (fp.add c_currentRoundingMode .cse2 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (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))))) is different from false [2021-07-04 23:49:40,819 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0)) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (fp.geq (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))))))))) .cse0)))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2)) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3) (fp.leq (fp.add c_currentRoundingMode .cse2 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (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))))) is different from true [2021-07-04 23:49:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-04 23:49:40,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-07-04 23:49:40,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085824081] [2021-07-04 23:49:40,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085824081] provided 2 perfect and 0 imperfect interpolant sequences [2021-07-04 23:49:40,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-07-04 23:49:40,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-07-04 23:49:40,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800920150] [2021-07-04 23:49:40,820 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-04 23:49:40,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-07-04 23:49:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-04 23:49:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2021-07-04 23:49:40,821 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:49:42,972 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0)) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (fp.geq (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))))))))) .cse0)))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2)) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3) (fp.leq (fp.add c_currentRoundingMode .cse2 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (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))))) is different from false [2021-07-04 23:49:45,259 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0)) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (fp.geq (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))))))))) .cse0)))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2)) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3) (fp.leq (fp.add c_currentRoundingMode .cse2 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (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))))) is different from true [2021-07-04 23:49:47,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse5 .cse6 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and .cse4 (or (not .cse5) (not .cse6))))))) is different from false [2021-07-04 23:49:49,554 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse5 .cse6 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and .cse4 (or (not .cse5) (not .cse6))))))) is different from true [2021-07-04 23:49:51,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) is different from false [2021-07-04 23:49:53,868 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) is different from true [2021-07-04 23:49:56,017 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (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 (= 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)))))))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) is different from false [2021-07-04 23:49:58,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse1))))) .cse0) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 (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))))))))))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse3 .cse4) (not (fp.geq ULTIMATE.start_main_~I~0 .cse4)) (fp.geq .cse3 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse5))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse7 (let ((.cse8 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7))) (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse9)) (not (fp.geq ULTIMATE.start_main_~I~0 .cse9)) (fp.geq ULTIMATE.start_main_~I~0 .cse7)))))))) is different from false [2021-07-04 23:49:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-04 23:49:58,210 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2021-07-04 23:49:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-04 23:49:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-07-04 23:49:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-04 23:49:58,210 INFO L225 Difference]: With dead ends: 8 [2021-07-04 23:49:58,210 INFO L226 Difference]: Without dead ends: 0 [2021-07-04 23:49:58,210 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40606.7ms TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2021-07-04 23:49:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-04 23:49:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-04 23:49:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:49:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-04 23:49:58,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2021-07-04 23:49:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-04 23:49:58,211 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-04 23:49:58,211 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-04 23:49:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-04 23:49:58,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-04 23:49:58,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-04 23:49:58,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:49:58,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-04 23:49:58,219 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-04 23:49:58,219 INFO L765 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-07-04 23:49:58,219 INFO L762 garLoopResultBuilder]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point L13(lines 27 28) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L762 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-07-04 23:49:58,220 INFO L765 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-07-04 23:49:58,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-07-04 23:49:58,421 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-07-04 23:49:58,421 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-04 23:49:58,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.07 11:49:58 BoogieIcfgContainer [2021-07-04 23:49:58,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-04 23:49:58,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-04 23:49:58,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-04 23:49:58,434 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-04 23:49:58,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.07 11:47:36" (3/4) ... [2021-07-04 23:49:58,436 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-07-04 23:49:58,444 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-07-04 23:49:58,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-07-04 23:49:58,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-04 23:49:58,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-04 23:49:58,478 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-04 23:49:58,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-04 23:49:58,478 INFO L168 Benchmark]: Toolchain (without parser) took 146515.87 ms. Allocated memory was 71.3 MB in the beginning and 102.8 MB in the end (delta: 31.5 MB). Free memory was 54.2 MB in the beginning and 69.4 MB in the end (delta: -15.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 16.1 GB. [2021-07-04 23:49:58,479 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 71.3 MB. Free memory is still 53.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-04 23:49:58,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.82 ms. Allocated memory is still 71.3 MB. Free memory was 54.1 MB in the beginning and 54.9 MB in the end (delta: -825.8 kB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2021-07-04 23:49:58,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.16 ms. Allocated memory is still 71.3 MB. Free memory was 54.6 MB in the beginning and 53.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-04 23:49:58,481 INFO L168 Benchmark]: Boogie Preprocessor took 13.80 ms. Allocated memory is still 71.3 MB. Free memory was 53.2 MB in the beginning and 52.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-04 23:49:58,481 INFO L168 Benchmark]: RCFGBuilder took 4557.51 ms. Allocated memory is still 71.3 MB. Free memory was 52.0 MB in the beginning and 39.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-04 23:49:58,481 INFO L168 Benchmark]: TraceAbstraction took 141719.94 ms. Allocated memory was 71.3 MB in the beginning and 102.8 MB in the end (delta: 31.5 MB). Free memory was 39.4 MB in the beginning and 71.3 MB in the end (delta: -31.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-04 23:49:58,481 INFO L168 Benchmark]: Witness Printer took 44.11 ms. Allocated memory is still 102.8 MB. Free memory was 71.3 MB in the beginning and 69.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-04 23:49:58,482 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.14 ms. Allocated memory is still 71.3 MB. Free memory is still 53.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 156.82 ms. Allocated memory is still 71.3 MB. Free memory was 54.1 MB in the beginning and 54.9 MB in the end (delta: -825.8 kB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 19.16 ms. Allocated memory is still 71.3 MB. Free memory was 54.6 MB in the beginning and 53.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 13.80 ms. Allocated memory is still 71.3 MB. Free memory was 53.2 MB in the beginning and 52.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4557.51 ms. Allocated memory is still 71.3 MB. Free memory was 52.0 MB in the beginning and 39.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 141719.94 ms. Allocated memory was 71.3 MB in the beginning and 102.8 MB in the end (delta: 31.5 MB). Free memory was 39.4 MB in the beginning and 71.3 MB in the end (delta: -31.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 44.11 ms. Allocated memory is still 102.8 MB. Free memory was 71.3 MB in the beginning and 69.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 141613.5ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 11.4ms, AutomataDifference: 35050.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5.7ms, InitialAbstractionConstructionTime: 15.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 16 SDs, 0 SdLazy, 12 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 234.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 80715.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 10.0ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 1.4ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 38.0ms SsaConstructionTime, 11831.2ms SatisfiabilityAnalysisTime, 93864.6ms InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 1755 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 - 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 RESULT: Ultimate proved your program to be correct! [2021-07-04 23:49:58,717 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-07-04 23:49:58,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...