./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_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer --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 Automizer --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_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer --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 Automizer --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 05:56:56,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:56:56,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:56:56,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:56:56,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:56:56,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:56:56,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:56:56,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:56:56,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:56:56,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:56:56,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:56:56,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:56:56,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:56:56,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:56:56,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:56:56,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:56:56,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:56:56,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:56:56,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:56:56,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:56:56,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:56:56,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:56:56,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:56:56,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:56:56,123 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:56:56,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:56:56,124 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:56:56,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:56:56,125 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:56:56,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:56:56,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:56:56,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:56:56,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:56:56,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:56:56,128 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:56:56,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:56:56,129 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:56:56,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:56:56,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:56:56,139 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:56:56,139 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:56:56,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:56:56,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:56:56,140 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:56:56,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:56:56,140 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:56:56,140 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:56:56,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:56:56,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:56:56,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:56:56,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:56:56,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:56:56,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:56:56,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:56:56,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:56:56,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:56:56,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:56:56,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:56:56,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:56:56,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:56:56,143 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_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2018-11-23 05:56:56,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:56:56,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:56:56,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:56:56,177 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:56:56,177 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:56:56,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 05:56:56,215 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/d9fb19747/016f5ae5aecd446984dfb3b94a6c22b6/FLAG0abec8e3c [2018-11-23 05:56:56,542 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:56:56,543 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 05:56:56,546 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/d9fb19747/016f5ae5aecd446984dfb3b94a6c22b6/FLAG0abec8e3c [2018-11-23 05:56:56,974 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/d9fb19747/016f5ae5aecd446984dfb3b94a6c22b6 [2018-11-23 05:56:56,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:56:56,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:56:56,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:56:56,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:56:56,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:56:56,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:56:56" (1/1) ... [2018-11-23 05:56:56,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12858536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:56, skipping insertion in model container [2018-11-23 05:56:56,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:56:56" (1/1) ... [2018-11-23 05:56:56,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:56:57,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:56:57,105 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:56:57,108 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:56:57,118 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:56:57,126 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:56:57,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57 WrapperNode [2018-11-23 05:56:57,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:56:57,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:56:57,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:56:57,127 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:56:57,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:56:57,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:56:57,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:56:57,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:56:57,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... [2018-11-23 05:56:57,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:56:57,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:56:57,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:56:57,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:56:57,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:56:57,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:56:57,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:56:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:56:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:56:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:56:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:56:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:56:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:56:57,357 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:56:57,357 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 05:56:57,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:56:57 BoogieIcfgContainer [2018-11-23 05:56:57,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:56:57,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:56:57,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:56:57,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:56:57,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:56:56" (1/3) ... [2018-11-23 05:56:57,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b965efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:56:57, skipping insertion in model container [2018-11-23 05:56:57,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:57" (2/3) ... [2018-11-23 05:56:57,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b965efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:56:57, skipping insertion in model container [2018-11-23 05:56:57,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:56:57" (3/3) ... [2018-11-23 05:56:57,363 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 05:56:57,369 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:56:57,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:56:57,384 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:56:57,403 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:56:57,404 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:56:57,404 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:56:57,404 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:56:57,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:56:57,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:56:57,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:56:57,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:56:57,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:56:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 05:56:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:56:57,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:57,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:57,424 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:57,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2111486095, now seen corresponding path program 1 times [2018-11-23 05:56:57,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:57,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:56:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:56:57,507 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 05:56:57,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:56:57 BoogieIcfgContainer [2018-11-23 05:56:57,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:56:57,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:56:57,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:56:57,534 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:56:57,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:56:57" (3/4) ... [2018-11-23 05:56:57,537 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:56:57,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:56:57,538 INFO L168 Benchmark]: Toolchain (without parser) took 560.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -102.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:56:57,539 INFO L168 Benchmark]: CDTParser took 0.15 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 05:56:57,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:57,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.06 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:57,540 INFO L168 Benchmark]: Boogie Preprocessor took 16.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:56:57,541 INFO L168 Benchmark]: RCFGBuilder took 195.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:57,541 INFO L168 Benchmark]: TraceAbstraction took 175.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:57,542 INFO L168 Benchmark]: Witness Printer took 3.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:56:57,544 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 18.06 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 175.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.25 ms. Allocated memory is still 1.1 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 05:56:58,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:56:58,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:56:58,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:56:58,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:56:58,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:56:58,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:56:58,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:56:58,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:56:58,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:56:58,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:56:58,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:56:58,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:56:58,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:56:59,000 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:56:59,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:56:59,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:56:59,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:56:59,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:56:59,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:56:59,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:56:59,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:56:59,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:56:59,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:56:59,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:56:59,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:56:59,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:56:59,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:56:59,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:56:59,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:56:59,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:56:59,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:56:59,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:56:59,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:56:59,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:56:59,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:56:59,013 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 05:56:59,023 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:56:59,023 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:56:59,024 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:56:59,024 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:56:59,024 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:56:59,024 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:56:59,025 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:56:59,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:56:59,025 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:56:59,025 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:56:59,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:56:59,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:56:59,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:56:59,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:56:59,026 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:56:59,026 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:56:59,026 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:56:59,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:56:59,026 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:56:59,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:56:59,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:56:59,027 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:56:59,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:56:59,027 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:56:59,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:56:59,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:56:59,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:56:59,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:56:59,027 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 05:56:59,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:56:59,028 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:56:59,028 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:56:59,028 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_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2018-11-23 05:56:59,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:56:59,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:56:59,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:56:59,070 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:56:59,071 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:56:59,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 05:56:59,117 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/3b2f67585/33aa5b946ac54e70962f65e0a9686e0d/FLAGc8d9f61af [2018-11-23 05:56:59,441 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:56:59,442 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/sv-benchmarks/c/float-benchs/sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 05:56:59,445 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/3b2f67585/33aa5b946ac54e70962f65e0a9686e0d/FLAGc8d9f61af [2018-11-23 05:56:59,879 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/data/3b2f67585/33aa5b946ac54e70962f65e0a9686e0d [2018-11-23 05:56:59,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:56:59,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:56:59,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:56:59,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:56:59,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:56:59,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:56:59" (1/1) ... [2018-11-23 05:56:59,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3746531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:59, skipping insertion in model container [2018-11-23 05:56:59,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:56:59" (1/1) ... [2018-11-23 05:56:59,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:56:59,905 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:57:00,037 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:57:00,043 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:57:00,057 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:57:00,066 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:57:00,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00 WrapperNode [2018-11-23 05:57:00,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:57:00,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:57:00,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:57:00,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:57:00,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:57:00,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:57:00,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:57:00,083 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:57:00,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... [2018-11-23 05:57:00,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:57:00,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:57:00,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:57:00,100 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:57:00,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:57:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:57:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:57:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:57:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:57:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:57:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:57:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:57:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:57:04,441 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:57:04,441 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 05:57:04,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:57:04 BoogieIcfgContainer [2018-11-23 05:57:04,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:57:04,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:57:04,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:57:04,444 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:57:04,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:56:59" (1/3) ... [2018-11-23 05:57:04,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adb31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:57:04, skipping insertion in model container [2018-11-23 05:57:04,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:57:00" (2/3) ... [2018-11-23 05:57:04,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2adb31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:57:04, skipping insertion in model container [2018-11-23 05:57:04,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:57:04" (3/3) ... [2018-11-23 05:57:04,447 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly_true-unreach-call_true-termination.c [2018-11-23 05:57:04,455 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:57:04,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:57:04,468 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:57:04,485 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:57:04,485 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:57:04,485 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:57:04,485 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:57:04,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:57:04,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:57:04,486 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:57:04,486 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:57:04,486 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:57:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 05:57:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:57:04,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:57:04,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:57:04,507 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:57:04,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:57:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2111486095, now seen corresponding path program 1 times [2018-11-23 05:57:04,513 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:57:04,513 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 05:57:04,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:57:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:57:07,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:57:09,815 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 05:57:11,891 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 05:57:28,765 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 05:57:43,582 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 05:57:54,150 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 05:57:56,251 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 05:57:56,256 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 05:57:56,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:57:56,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:57:56,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 05:57:56,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:57:56,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:57:56,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=8, Unknown=6, NotChecked=28, Total=56 [2018-11-23 05:57:56,286 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 8 states. [2018-11-23 05:58:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:58:00,990 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 05:58:00,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:58:00,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-11-23 05:58:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:58:00,998 INFO L225 Difference]: With dead ends: 31 [2018-11-23 05:58:00,998 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 05:58:01,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14, Invalid=8, Unknown=6, NotChecked=28, Total=56 [2018-11-23 05:58:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 05:58:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 05:58:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 05:58:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2018-11-23 05:58:01,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 11 [2018-11-23 05:58:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:58:01,022 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2018-11-23 05:58:01,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:58:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2018-11-23 05:58:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:58:01,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:58:01,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:58:01,023 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:58:01,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:58:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2109639053, now seen corresponding path program 1 times [2018-11-23 05:58:01,024 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:58:01,024 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 05:58:01,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:58:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:58:04,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:58:06,868 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 05:58:08,957 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 05:58:25,938 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (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)))))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 (let ((.cse9 (fp.sub roundNearestTiesToEven v_prenex_7 .cse7))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0)))))))))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq .cse6 .cse7) (fp.geq v_prenex_7 .cse7) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse6 .cse8) (not (fp.geq v_prenex_7 .cse8))))))))) is different from false [2018-11-23 05:58:40,838 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)))))) (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)))))) (and (exists ((v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 (let ((.cse9 (fp.sub roundNearestTiesToEven v_prenex_7 .cse7))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0)))))))))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq .cse6 .cse7) (fp.geq v_prenex_7 .cse7) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse6 .cse8) (not (fp.geq v_prenex_7 .cse8)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2018-11-23 05:58:51,449 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 05:58:53,545 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 05:58:53,548 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 05:58:53,548 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:58:53,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:58:53,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:58:53,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:58:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:58:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-11-23 05:58:53,575 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand 7 states. [2018-11-23 05:58:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:58:55,762 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2018-11-23 05:58:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:58:55,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 05:58:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:58:55,866 INFO L225 Difference]: With dead ends: 12 [2018-11-23 05:58:55,867 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:58:55,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-11-23 05:58:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:58:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:58:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:58:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:58:55,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-11-23 05:58:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:58:55,869 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:58:55,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:58:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:58:55,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:58:55,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:59:08,539 WARN L180 SmtUtils]: Spent 12.62 s on a formula simplification. DAG size of input: 158 DAG size of output: 1 [2018-11-23 05:59:25,367 WARN L180 SmtUtils]: Spent 16.83 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 05:59:25,369 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:59:25,370 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:59:25,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:59:25,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:59:25,370 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 05:59:25,370 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:59:25,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:59:25,371 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 15 27) the Hoare annotation is: true [2018-11-23 05:59:25,371 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 15 27) no Hoare annotation was computed. [2018-11-23 05:59:25,371 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-23 05:59:25,371 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 15 27) no Hoare annotation was computed. [2018-11-23 05:59:25,371 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2018-11-23 05:59:25,372 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 05:59:25,372 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 11) the Hoare annotation is: true [2018-11-23 05:59:25,372 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-11-23 05:59:25,372 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2018-11-23 05:59:25,372 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-11-23 05:59:25,373 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 11) no Hoare annotation was computed. [2018-11-23 05:59:25,373 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-11-23 05:59:25,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:59:25 BoogieIcfgContainer [2018-11-23 05:59:25,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:59:25,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:59:25,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:59:25,376 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:59:25,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:57:04" (3/4) ... [2018-11-23 05:59:25,379 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:59:25,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:59:25,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:59:25,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 05:59:25,386 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 05:59:25,386 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 05:59:25,386 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 05:59:25,410 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_56665fd2-9a8e-44ab-86df-68d43579ac90/bin-2019/uautomizer/witness.graphml [2018-11-23 05:59:25,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:59:25,411 INFO L168 Benchmark]: Toolchain (without parser) took 145529.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -61.4 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:59:25,411 INFO L168 Benchmark]: CDTParser took 0.17 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 05:59:25,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.25 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:59:25,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.98 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:59:25,412 INFO L168 Benchmark]: Boogie Preprocessor took 16.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:59:25,412 INFO L168 Benchmark]: RCFGBuilder took 4341.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:59:25,412 INFO L168 Benchmark]: TraceAbstraction took 140933.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:59:25,413 INFO L168 Benchmark]: Witness Printer took 34.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:59:25,415 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.17 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 184.25 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.98 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 4341.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140933.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 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, 140.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 29.4s 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, 26.0s 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, 1067 FormulaSimplificationTreeSizeReductionInter, 29.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 97.5s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 8 QuantifiedInterpolants, 14830 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...