./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a4836c40967b3aafd0bbb2ea7228f657b02305b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a4836c40967b3aafd0bbb2ea7228f657b02305b ...................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:38:43,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:38:43,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:38:43,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:38:43,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:38:43,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:38:43,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:38:43,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:38:43,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:38:43,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:38:43,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:38:43,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:38:43,598 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:38:43,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:38:43,599 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:38:43,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:38:43,601 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:38:43,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:38:43,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:38:43,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:38:43,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:38:43,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:38:43,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:38:43,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:38:43,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:38:43,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:38:43,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:38:43,610 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:38:43,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:38:43,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:38:43,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:38:43,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:38:43,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:38:43,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:38:43,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:38:43,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:38:43,614 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 06:38:43,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:38:43,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:38:43,625 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:38:43,625 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:38:43,626 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:38:43,626 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:38:43,626 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:38:43,626 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:38:43,626 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:38:43,626 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:38:43,626 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:38:43,627 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:38:43,627 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:38:43,627 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:38:43,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:38:43,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:38:43,629 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:38:43,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:38:43,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:38:43,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:38:43,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:38:43,631 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:38:43,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:38:43,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:38:43,632 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:38:43,632 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:38:43,632 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:38:43,632 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:38:43,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:38:43,633 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 06:38:43,633 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2018-11-23 06:38:43,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:38:43,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:38:43,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:38:43,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:38:43,669 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:38:43,669 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 06:38:43,706 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/067aa94a5/9919698b487a4a7f8547e08ee2f273d0/FLAGe9107e9a0 [2018-11-23 06:38:44,094 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:38:44,095 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 06:38:44,098 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/067aa94a5/9919698b487a4a7f8547e08ee2f273d0/FLAGe9107e9a0 [2018-11-23 06:38:44,108 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/067aa94a5/9919698b487a4a7f8547e08ee2f273d0 [2018-11-23 06:38:44,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:38:44,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:38:44,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:44,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:38:44,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:38:44,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44, skipping insertion in model container [2018-11-23 06:38:44,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:38:44,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:38:44,240 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:44,243 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:38:44,253 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:44,261 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:38:44,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44 WrapperNode [2018-11-23 06:38:44,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:44,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:38:44,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:38:44,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:38:44,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:38:44,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:38:44,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:38:44,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:38:44,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... [2018-11-23 06:38:44,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:38:44,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:38:44,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:38:44,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:38:44,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:38:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:38:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:38:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:38:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:38:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:38:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:38:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 06:38:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 06:38:44,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:38:44,457 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:38:44,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:44 BoogieIcfgContainer [2018-11-23 06:38:44,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:38:44,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:38:44,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:38:44,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:38:44,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:38:44" (1/3) ... [2018-11-23 06:38:44,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e342563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:44, skipping insertion in model container [2018-11-23 06:38:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:44" (2/3) ... [2018-11-23 06:38:44,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e342563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:44, skipping insertion in model container [2018-11-23 06:38:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:44" (3/3) ... [2018-11-23 06:38:44,463 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 06:38:44,469 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:38:44,474 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:38:44,488 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:38:44,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:38:44,515 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:38:44,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:38:44,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:38:44,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:38:44,515 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:38:44,515 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:38:44,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:38:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 06:38:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:38:44,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:44,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:44,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:38:44,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2111486095, now seen corresponding path program 1 times [2018-11-23 06:38:44,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:38:44,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:44,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:44,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:38:44,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:38:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:38:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:38:44,625 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~sqrt2~0)|=3.0, ~sqrt2~0=3.0] [?] ~sqrt2~0 := 1.4142135381698608; VAL [|old(~sqrt2~0)|=3.0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] assume true; VAL [|old(~sqrt2~0)|=3.0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] RET #27#return; VAL [~sqrt2~0=(/ 11863283.0 8388608.0)] [?] CALL call #t~ret1 := main(); VAL [~sqrt2~0=(/ 11863283.0 8388608.0)] [?] havoc ~S~0;havoc ~I~0;~I~0 := #t~nondet0;havoc #t~nondet0;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~I~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~I~0, 3.0) then 1 else 0); VAL [main_~I~0=2.0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] assume ~someBinaryDOUBLEComparisonOperation(~I~0, 2.0);~S~0 := ~someBinaryArithmeticDOUBLEoperation(~sqrt2~0, ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0), ~someBinaryArithmeticDOUBLEoperation(0.5, ~someBinaryArithmeticDOUBLEoperation(0.125, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0)))))); VAL [main_~I~0=2.0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~S~0, 2.0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~sqrt2~0=(/ 11863283.0 8388608.0)] [?] CALL call ULTIMATE.init(); VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=3.0] [L13] ~sqrt2~0 := 1.4142135381698608; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] ensures true; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] RET call ULTIMATE.init(); VAL [~sqrt2~0=11863283/8388608] [?] CALL call #t~ret1 := main(); VAL [~sqrt2~0=11863283/8388608] [L17] havoc ~S~0; [L17] havoc ~I~0; [L19] ~I~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~I~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~I~0, 3.0) then 1 else 0); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L22-L23] assume ~someBinaryDOUBLEComparisonOperation(~I~0, 2.0); [L22] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~sqrt2~0, ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0), ~someBinaryArithmeticDOUBLEoperation(0.5, ~someBinaryArithmeticDOUBLEoperation(0.125, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0)))))); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L25] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~S~0, 2.0) then 1 else 0)); VAL [#in~cond=0, ~sqrt2~0=11863283/8388608] [L11] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assert false; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=3.0] [L13] ~sqrt2~0 := 1.4142135381698608; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] ensures true; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] RET call ULTIMATE.init(); VAL [~sqrt2~0=11863283/8388608] [?] CALL call #t~ret1 := main(); VAL [~sqrt2~0=11863283/8388608] [L17] havoc ~S~0; [L17] havoc ~I~0; [L19] ~I~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~I~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~I~0, 3.0) then 1 else 0); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L22-L23] assume ~someBinaryDOUBLEComparisonOperation(~I~0, 2.0); [L22] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~sqrt2~0, ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0), ~someBinaryArithmeticDOUBLEoperation(0.5, ~someBinaryArithmeticDOUBLEoperation(0.125, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0)))))); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L25] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~S~0, 2.0) then 1 else 0)); VAL [#in~cond=0, ~sqrt2~0=11863283/8388608] [L11] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assert false; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [?] CALL call ULTIMATE.init(); VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=3.0] [L13] ~sqrt2~0 := 1.4142135381698608; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] RET call ULTIMATE.init(); VAL [~sqrt2~0=11863283/8388608] [?] CALL call #t~ret1 := main(); VAL [~sqrt2~0=11863283/8388608] [L17] havoc ~S~0; [L17] havoc ~I~0; [L19] ~I~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~I~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~I~0, 3.0) then 1 else 0); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~I~0, 2.0) [L22] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~sqrt2~0, ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0), ~someBinaryArithmeticDOUBLEoperation(0.5, ~someBinaryArithmeticDOUBLEoperation(0.125, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0)))))); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L25] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~S~0, 2.0) then 1 else 0)); VAL [#in~cond=0, ~sqrt2~0=11863283/8388608] [L11] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assert false; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=3.0] [L13] ~sqrt2~0 := 1.4142135381698608; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] RET call ULTIMATE.init(); VAL [~sqrt2~0=11863283/8388608] [?] CALL call #t~ret1 := main(); VAL [~sqrt2~0=11863283/8388608] [L17] havoc ~S~0; [L17] havoc ~I~0; [L19] ~I~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~I~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~I~0, 3.0) then 1 else 0); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~I~0, 2.0) [L22] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~sqrt2~0, ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0), ~someBinaryArithmeticDOUBLEoperation(0.5, ~someBinaryArithmeticDOUBLEoperation(0.125, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0)))))); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L25] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~S~0, 2.0) then 1 else 0)); VAL [#in~cond=0, ~sqrt2~0=11863283/8388608] [L11] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assert false; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [?] CALL call ULTIMATE.init(); VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=3.0] [L13] ~sqrt2~0 := 1.4142135381698608; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] RET call ULTIMATE.init(); VAL [~sqrt2~0=11863283/8388608] [?] CALL call #t~ret1 := main(); VAL [~sqrt2~0=11863283/8388608] [L17] havoc ~S~0; [L17] havoc ~I~0; [L19] ~I~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~I~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~I~0, 3.0) then 1 else 0); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~I~0, 2.0) [L22] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~sqrt2~0, ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0), ~someBinaryArithmeticDOUBLEoperation(0.5, ~someBinaryArithmeticDOUBLEoperation(0.125, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0)))))); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L25] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~S~0, 2.0) then 1 else 0)); VAL [#in~cond=0, ~sqrt2~0=11863283/8388608] [L11] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assert false; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=3.0] [L13] ~sqrt2~0 := 1.4142135381698608; VAL [old(~sqrt2~0)=3.0, ~sqrt2~0=11863283/8388608] [?] RET call ULTIMATE.init(); VAL [~sqrt2~0=11863283/8388608] [?] CALL call #t~ret1 := main(); VAL [~sqrt2~0=11863283/8388608] [L17] havoc ~S~0; [L17] havoc ~I~0; [L19] ~I~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~I~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~I~0, 3.0) then 1 else 0); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~I~0, 2.0) [L22] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~sqrt2~0, ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0), ~someBinaryArithmeticDOUBLEoperation(0.5, ~someBinaryArithmeticDOUBLEoperation(0.125, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~I~0, 2.0), 1.0)))))); VAL [~I~0=2.0, ~sqrt2~0=11863283/8388608] [L25] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, 1.0) && ~someBinaryDOUBLEComparisonOperation(~S~0, 2.0) then 1 else 0)); VAL [#in~cond=0, ~sqrt2~0=11863283/8388608] [L11] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L11] assert false; VAL [#in~cond=0, ~cond=0, ~sqrt2~0=11863283/8388608] [L13] double sqrt2 = 1.414213538169860839843750; VAL [\old(sqrt2)=3, sqrt2=11863283/8388608] [L17] double S, I; [L19] I = __VERIFIER_nondet_double() [L22] COND TRUE I >= 2. [L22] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [I=2, sqrt2=11863283/8388608] [L25] CALL __VERIFIER_assert(S >= 1. && S <= 2.) VAL [\old(cond)=0, sqrt2=11863283/8388608] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] [L11] __VERIFIER_error() VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] ----- [2018-11-23 06:38:44,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:38:44 BoogieIcfgContainer [2018-11-23 06:38:44,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:38:44,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:38:44,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:38:44,650 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:38:44,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:44" (3/4) ... [2018-11-23 06:38:44,653 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:38:44,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:38:44,654 INFO L168 Benchmark]: Toolchain (without parser) took 542.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:38:44,655 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:38:44,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:38:44,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.38 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:38:44,657 INFO L168 Benchmark]: Boogie Preprocessor took 11.76 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:38:44,657 INFO L168 Benchmark]: RCFGBuilder took 170.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:38:44,658 INFO L168 Benchmark]: TraceAbstraction took 192.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:38:44,658 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:38:44,661 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.38 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.76 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 192.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22. Possible FailurePath: [L13] double sqrt2 = 1.414213538169860839843750; VAL [\old(sqrt2)=3, sqrt2=11863283/8388608] [L17] double S, I; [L19] I = __VERIFIER_nondet_double() [L22] COND TRUE I >= 2. [L22] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [I=2, sqrt2=11863283/8388608] [L25] CALL __VERIFIER_assert(S >= 1. && S <= 2.) VAL [\old(cond)=0, sqrt2=11863283/8388608] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] [L11] __VERIFIER_error() VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 06:38:46,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:38:46,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:38:46,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:38:46,097 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:38:46,098 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:38:46,098 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:38:46,100 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:38:46,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:38:46,101 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:38:46,102 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:38:46,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:38:46,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:38:46,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:38:46,104 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:38:46,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:38:46,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:38:46,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:38:46,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:38:46,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:38:46,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:38:46,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:38:46,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:38:46,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:38:46,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:38:46,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:38:46,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:38:46,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:38:46,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:38:46,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:38:46,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:38:46,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:38:46,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:38:46,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:38:46,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:38:46,118 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:38:46,119 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 06:38:46,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:38:46,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:38:46,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:38:46,129 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:38:46,129 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:38:46,129 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:38:46,130 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:38:46,130 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:38:46,130 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:38:46,130 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:38:46,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:38:46,131 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:38:46,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:38:46,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:38:46,132 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:38:46,132 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:38:46,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:38:46,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:38:46,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:38:46,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:38:46,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:38:46,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:38:46,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:38:46,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:38:46,133 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 06:38:46,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:38:46,136 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:38:46,136 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:38:46,136 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2018-11-23 06:38:46,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:38:46,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:38:46,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:38:46,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:38:46,179 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:38:46,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 06:38:46,220 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/9fda208b2/eef5321525b4451690e5fcbcbed11601/FLAGbc0d2b441 [2018-11-23 06:38:46,513 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:38:46,513 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 06:38:46,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/9fda208b2/eef5321525b4451690e5fcbcbed11601/FLAGbc0d2b441 [2018-11-23 06:38:46,525 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/data/9fda208b2/eef5321525b4451690e5fcbcbed11601 [2018-11-23 06:38:46,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:38:46,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:38:46,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:46,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:38:46,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:38:46,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cfd9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46, skipping insertion in model container [2018-11-23 06:38:46,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:38:46,551 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:38:46,662 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:46,666 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:38:46,679 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:46,688 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:38:46,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46 WrapperNode [2018-11-23 06:38:46,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:46,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:38:46,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:38:46,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:38:46,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:38:46,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:38:46,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:38:46,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:38:46,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... [2018-11-23 06:38:46,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:38:46,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:38:46,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:38:46,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:38:46,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:38:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:38:46,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:38:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:38:46,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:38:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:38:46,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:38:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 06:38:46,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 06:38:51,060 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:38:51,061 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:38:51,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:51 BoogieIcfgContainer [2018-11-23 06:38:51,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:38:51,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:38:51,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:38:51,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:38:51,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:38:46" (1/3) ... [2018-11-23 06:38:51,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3798b4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:51, skipping insertion in model container [2018-11-23 06:38:51,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:46" (2/3) ... [2018-11-23 06:38:51,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3798b4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:51, skipping insertion in model container [2018-11-23 06:38:51,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:51" (3/3) ... [2018-11-23 06:38:51,066 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 06:38:51,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:38:51,080 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:38:51,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:38:51,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:38:51,108 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:38:51,108 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:38:51,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:38:51,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:38:51,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:38:51,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:38:51,109 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:38:51,109 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:38:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 06:38:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:38:51,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:51,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:51,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:38:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2111486095, now seen corresponding path program 1 times [2018-11-23 06:38:51,131 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:38:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 06:38:51,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:54,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:56,241 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) c_main_~S~0) (fp.geq main_~I~0 .cse2) (fp.geq main_~I~0 .cse0) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) is different from false [2018-11-23 06:38:58,331 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) c_main_~S~0) (fp.geq main_~I~0 .cse2) (fp.geq main_~I~0 .cse0) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) is different from true [2018-11-23 06:39:15,160 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse0) (fp.geq v_prenex_1 .cse1) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse1) .cse0))) (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 v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse3) (and (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse5 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven main_~I~0 .cse4) .cse5))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse7)))))))) (and (fp.geq main_~I~0 .cse4) (fp.geq main_~I~0 .cse5) (fp.leq .cse6 .cse4) (fp.geq .cse6 .cse5) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_3 .cse8) (fp.leq v_prenex_3 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse8)) (fp.geq v_prenex_3 .cse10)))) .cse3))) is different from false [2018-11-23 06:39:29,951 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_3 .cse1) (fp.leq v_prenex_3 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (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 v_prenex_3 .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.geq v_prenex_3 .cse3))))) (and .cse0 (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse4) (fp.geq v_prenex_1 .cse5) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse5) .cse4))) (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse6)))))) .cse5)) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) (and (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse9 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven main_~I~0 .cse7) .cse8))) (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.geq main_~I~0 .cse7) (fp.geq main_~I~0 .cse8) (fp.leq .cse9 .cse7) (fp.geq .cse9 .cse8) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2018-11-23 06:39:40,485 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse0) (fp.geq v_prenex_1 .cse1) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse1) .cse0))) (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 v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_3 .cse3) (fp.leq v_prenex_3 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .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)))))) .cse3)) (fp.geq v_prenex_3 .cse5))))) is different from false [2018-11-23 06:39:42,577 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse0) (fp.geq v_prenex_1 .cse1) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse1) .cse0))) (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 v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_3 .cse3) (fp.leq v_prenex_3 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .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)))))) .cse3)) (fp.geq v_prenex_3 .cse5))))) is different from true [2018-11-23 06:39:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:42,582 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:39:42,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:39:42,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:39:42,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:39:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:39:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=8, Unknown=6, NotChecked=28, Total=56 [2018-11-23 06:39:42,617 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 8 states. [2018-11-23 06:39:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:47,300 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 06:39:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:39:47,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-11-23 06:39:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:47,307 INFO L225 Difference]: With dead ends: 31 [2018-11-23 06:39:47,307 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 06:39:47,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=14, Invalid=8, Unknown=6, NotChecked=28, Total=56 [2018-11-23 06:39:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 06:39:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 06:39:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 06:39:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2018-11-23 06:39:47,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 11 [2018-11-23 06:39:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:47,334 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2018-11-23 06:39:47,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:39:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2018-11-23 06:39:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:39:47,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:47,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:47,335 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:39:47,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:47,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2109639053, now seen corresponding path program 1 times [2018-11-23 06:39:47,335 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:39:47,335 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 06:39:47,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:50,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:52,985 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (= (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven 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))))))))) c_main_~S~0) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) is different from false [2018-11-23 06:39:55,079 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (= (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven 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))))))))) c_main_~S~0) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) is different from true [2018-11-23 06:40:11,658 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven 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 .cse2 (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_5 .cse3) (not (fp.geq v_prenex_5 .cse4)) (not (fp.leq (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven v_prenex_5 .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.leq v_prenex_5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))))) is different from false [2018-11-23 06:40:22,295 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq main_~I~0 .cse1) (not (fp.geq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven 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)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and .cse0 (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_5 .cse3) (not (fp.geq v_prenex_5 .cse4)) (not (fp.leq (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven v_prenex_5 .cse3))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.leq v_prenex_5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))))) is different from false [2018-11-23 06:40:32,950 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven 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_5 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_5 .cse2) (not (fp.geq v_prenex_5 .cse3)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_5 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)) (fp.leq v_prenex_5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from false [2018-11-23 06:40:35,044 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq main_~I~0 .cse0) (not (fp.geq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven 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_5 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_5 .cse2) (not (fp.geq v_prenex_5 .cse3)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_5 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)) (fp.leq v_prenex_5 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from true [2018-11-23 06:40:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:40:35,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:40:35,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:35,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 06:40:35,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:40:35,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:40:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-11-23 06:40:35,068 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand 7 states. [2018-11-23 06:40:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:37,269 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2018-11-23 06:40:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:40:37,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 06:40:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:40:37,384 INFO L225 Difference]: With dead ends: 12 [2018-11-23 06:40:37,384 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 06:40:37,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-11-23 06:40:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 06:40:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 06:40:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 06:40:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 06:40:37,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-11-23 06:40:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:40:37,386 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:40:37,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:40:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:40:37,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 06:40:37,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 06:40:45,030 WARN L180 SmtUtils]: Spent 7.59 s on a formula simplification. DAG size of input: 134 DAG size of output: 1 [2018-11-23 06:41:01,961 WARN L180 SmtUtils]: Spent 16.93 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 06:41:01,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 06:41:01,963 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 06:41:01,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 06:41:01,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 06:41:01,964 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) ~sqrt2~0) [2018-11-23 06:41:01,964 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 06:41:01,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 06:41:01,964 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 15 27) the Hoare annotation is: true [2018-11-23 06:41:01,964 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 15 27) no Hoare annotation was computed. [2018-11-23 06:41:01,964 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-23 06:41:01,964 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 15 27) no Hoare annotation was computed. [2018-11-23 06:41:01,964 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2018-11-23 06:41:01,965 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 23) the Hoare annotation is: (or (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) main_~S~0) (fp.geq main_~I~0 .cse2) (fp.geq main_~I~0 .cse0) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (not (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) ~sqrt2~0)) (exists ((main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq main_~I~0 .cse3) (not (fp.geq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (= (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven main_~I~0 .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) main_~S~0) (fp.leq main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) [2018-11-23 06:41:01,965 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 11) the Hoare annotation is: true [2018-11-23 06:41:01,965 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-11-23 06:41:01,965 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-11-23 06:41:01,966 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 11) no Hoare annotation was computed. [2018-11-23 06:41:01,966 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-11-23 06:41:01,967 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2018-11-23 06:41:01,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:41:01 BoogieIcfgContainer [2018-11-23 06:41:01,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:41:01,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:41:01,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:41:01,971 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:41:01,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:51" (3/4) ... [2018-11-23 06:41:01,975 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 06:41:01,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 06:41:01,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 06:41:01,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 06:41:01,983 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 06:41:01,983 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 06:41:01,983 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 06:41:02,010 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_65ae98fe-9e39-4eca-b9b7-56ef7aafda2b/bin-2019/utaipan/witness.graphml [2018-11-23 06:41:02,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:41:02,010 INFO L168 Benchmark]: Toolchain (without parser) took 135483.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -59.3 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:41:02,011 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:41:02,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:41:02,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.91 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:41:02,012 INFO L168 Benchmark]: Boogie Preprocessor took 19.82 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:41:02,012 INFO L168 Benchmark]: RCFGBuilder took 4337.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:41:02,013 INFO L168 Benchmark]: TraceAbstraction took 130908.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:41:02,013 INFO L168 Benchmark]: Witness Printer took 39.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:41:02,016 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.91 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.82 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 4337.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 130908.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. * Witness Printer took 39.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 130.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 24.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 2 SDslu, 62 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 7 PreInvPairs, 8 NumberOfFragments, 142 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 838 FormulaSimplificationTreeSizeReductionInter, 24.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 92.7s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 8 QuantifiedInterpolants, 12570 SizeOfPredicates, 7 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...