./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/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 16ab6efcf7b0c54aabe43554a033bf1907c93094 ......................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/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 16ab6efcf7b0c54aabe43554a033bf1907c93094 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:21:05,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:21:05,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:21:05,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:21:05,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:21:05,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:21:05,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:21:05,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:21:05,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:21:05,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:21:05,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:21:05,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:21:05,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:21:05,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:21:05,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:21:05,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:21:05,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:21:05,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:21:05,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:21:05,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:21:05,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:21:05,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:21:05,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:21:05,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:21:05,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:21:05,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:21:05,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:21:05,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:21:05,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:21:05,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:21:05,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:21:05,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:21:05,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:21:05,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:21:05,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:21:05,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:21:05,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:21:05,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:21:05,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:21:05,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:21:05,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:21:05,290 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:21:05,317 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:21:05,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:21:05,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:21:05,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:21:05,331 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:21:05,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:21:05,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:21:05,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:21:05,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:21:05,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:21:05,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:21:05,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:21:05,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:21:05,333 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:21:05,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:21:05,334 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:21:05,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:21:05,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:21:05,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:21:05,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:21:05,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:21:05,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:21:05,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:21:05,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:21:05,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:21:05,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:21:05,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:21:05,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:21:05,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> 16ab6efcf7b0c54aabe43554a033bf1907c93094 [2019-11-19 22:21:05,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:21:05,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:21:05,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:21:05,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:21:05,512 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:21:05,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-11-19 22:21:05,588 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/0ceb96925/13466a5f900f4b1185a59b6f390de00d/FLAG9a717fdad [2019-11-19 22:21:05,994 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:21:05,995 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-11-19 22:21:06,002 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/0ceb96925/13466a5f900f4b1185a59b6f390de00d/FLAG9a717fdad [2019-11-19 22:21:06,407 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/0ceb96925/13466a5f900f4b1185a59b6f390de00d [2019-11-19 22:21:06,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:21:06,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:21:06,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:06,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:21:06,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:21:06,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169fae86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06, skipping insertion in model container [2019-11-19 22:21:06,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,428 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:21:06,452 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:21:06,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:06,737 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:21:06,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:06,795 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:21:06,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06 WrapperNode [2019-11-19 22:21:06,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:06,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:06,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:21:06,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:21:06,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:06,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:21:06,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:21:06,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:21:06,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... [2019-11-19 22:21:06,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:21:06,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:21:06,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:21:06,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:21:06,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:21:06,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:21:06,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:21:07,121 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:21:07,122 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 22:21:07,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:07 BoogieIcfgContainer [2019-11-19 22:21:07,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:21:07,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:21:07,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:21:07,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:21:07,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:21:06" (1/3) ... [2019-11-19 22:21:07,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd6e700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:07, skipping insertion in model container [2019-11-19 22:21:07,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:06" (2/3) ... [2019-11-19 22:21:07,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd6e700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:07, skipping insertion in model container [2019-11-19 22:21:07,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:07" (3/3) ... [2019-11-19 22:21:07,143 INFO L109 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2019-11-19 22:21:07,154 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:21:07,161 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:21:07,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:21:07,206 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:21:07,206 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:21:07,206 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:21:07,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:21:07,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:21:07,206 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:21:07,207 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:21:07,207 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:21:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-19 22:21:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:21:07,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:21:07,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:07,229 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:21:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash 570602568, now seen corresponding path program 1 times [2019-11-19 22:21:07,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:07,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145550171] [2019-11-19 22:21:07,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:07,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145550171] [2019-11-19 22:21:07,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:07,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:21:07,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749157669] [2019-11-19 22:21:07,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:21:07,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:21:07,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:21:07,435 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2019-11-19 22:21:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:07,503 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-11-19 22:21:07,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:21:07,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 22:21:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:21:07,515 INFO L225 Difference]: With dead ends: 27 [2019-11-19 22:21:07,515 INFO L226 Difference]: Without dead ends: 14 [2019-11-19 22:21:07,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:21:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-19 22:21:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-19 22:21:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 22:21:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-19 22:21:07,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-11-19 22:21:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:21:07,547 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-19 22:21:07,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:21:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-19 22:21:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:21:07,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:21:07,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:07,549 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:21:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash 587613229, now seen corresponding path program 1 times [2019-11-19 22:21:07,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:07,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142388645] [2019-11-19 22:21:07,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:07,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:07,583 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:21:07,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:21:07 BoogieIcfgContainer [2019-11-19 22:21:07,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:21:07,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:21:07,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:21:07,612 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:21:07,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:07" (3/4) ... [2019-11-19 22:21:07,615 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:21:07,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:21:07,617 INFO L168 Benchmark]: Toolchain (without parser) took 1205.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:07,618 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:07,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -206.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:07,620 INFO L168 Benchmark]: Boogie Preprocessor took 33.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,621 INFO L168 Benchmark]: RCFGBuilder took 250.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,621 INFO L168 Benchmark]: TraceAbstraction took 486.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:07,622 INFO L168 Benchmark]: Witness Printer took 4.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:07,625 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -206.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 250.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 486.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 40]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L1] int __return_main; [L7] int __return_76; VAL [__return_76=0, __return_main=0] [L10] double main__x; [L11] double main__y; [L12] main__x = __VERIFIER_nondet_double() [L13] int main____CPAchecker_TMP_0; VAL [__return_76=0, __return_main=0] [L14] COND TRUE main__x >= 0.0 VAL [__return_76=0, __return_main=0] [L16] COND TRUE main__x <= 10.0 [L18] main____CPAchecker_TMP_0 = 1 VAL [__return_76=0, __return_main=0] [L19] COND TRUE main____CPAchecker_TMP_0 != 0 [L21] main__y = (main__x * main__x) - main__x VAL [__return_76=0, __return_main=0] [L22] COND FALSE !(main__y >= 0) [L64] main__y = (main__x * main__x) + 2.0 VAL [__return_76=0, __return_main=0] [L26] int main____CPAchecker_TMP_1; VAL [__return_76=0, __return_main=0] [L27] COND FALSE !(main__y >= 0.0) VAL [__return_76=0, __return_main=0] [L53] main____CPAchecker_TMP_1 = 0 VAL [__return_76=0, __return_main=0] [L34] int __tmp_1; [L35] __tmp_1 = main____CPAchecker_TMP_1 [L36] int __VERIFIER_assert__cond; [L37] __VERIFIER_assert__cond = __tmp_1 VAL [__return_76=0, __return_main=0] [L38] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_76=0, __return_main=0] [L40] __VERIFIER_error() VAL [__return_76=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 22 SDtfs, 7 SDslu, 35 SDs, 0 SdLazy, 10 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 22:21:09,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:21:09,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:21:09,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:21:09,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:21:09,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:21:09,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:21:09,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:21:09,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:21:09,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:21:09,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:21:09,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:21:09,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:21:09,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:21:09,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:21:09,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:21:09,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:21:09,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:21:09,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:21:09,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:21:09,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:21:09,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:21:09,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:21:09,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:21:09,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:21:09,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:21:09,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:21:09,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:21:09,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:21:09,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:21:09,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:21:09,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:21:09,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:21:09,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:21:09,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:21:09,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:21:09,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:21:09,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:21:09,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:21:09,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:21:09,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:21:09,670 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 22:21:09,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:21:09,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:21:09,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:21:09,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:21:09,689 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:21:09,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:21:09,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:21:09,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:21:09,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:21:09,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:21:09,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:21:09,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:21:09,691 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:21:09,691 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:21:09,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:21:09,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:21:09,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:21:09,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:21:09,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:21:09,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:21:09,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:21:09,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:21:09,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:21:09,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:21:09,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:21:09,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:21:09,695 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:21:09,695 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:21:09,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:21:09,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:21:09,696 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> 16ab6efcf7b0c54aabe43554a033bf1907c93094 [2019-11-19 22:21:09,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:21:09,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:21:10,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:21:10,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:21:10,004 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:21:10,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-11-19 22:21:10,061 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/c9b3d063b/6b49d8d211b44ee9868b962eee0379a4/FLAGa9cf3932d [2019-11-19 22:21:10,469 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:21:10,470 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2019-11-19 22:21:10,480 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/c9b3d063b/6b49d8d211b44ee9868b962eee0379a4/FLAGa9cf3932d [2019-11-19 22:21:10,886 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/data/c9b3d063b/6b49d8d211b44ee9868b962eee0379a4 [2019-11-19 22:21:10,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:21:10,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:21:10,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:10,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:21:10,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:21:10,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:10" (1/1) ... [2019-11-19 22:21:10,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f72c494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:10, skipping insertion in model container [2019-11-19 22:21:10,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:10" (1/1) ... [2019-11-19 22:21:10,922 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:21:10,940 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:21:11,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:11,144 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:21:11,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:11,179 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:21:11,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11 WrapperNode [2019-11-19 22:21:11,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:11,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:11,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:21:11,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:21:11,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:11,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:21:11,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:21:11,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:21:11,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... [2019-11-19 22:21:11,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:21:11,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:21:11,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:21:11,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:21:11,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:21:11,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:21:11,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:21:13,741 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:21:13,741 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 22:21:13,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:13 BoogieIcfgContainer [2019-11-19 22:21:13,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:21:13,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:21:13,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:21:13,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:21:13,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:21:10" (1/3) ... [2019-11-19 22:21:13,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb1b65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:13, skipping insertion in model container [2019-11-19 22:21:13,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:11" (2/3) ... [2019-11-19 22:21:13,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb1b65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:13, skipping insertion in model container [2019-11-19 22:21:13,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:13" (3/3) ... [2019-11-19 22:21:13,749 INFO L109 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2019-11-19 22:21:13,760 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:21:13,766 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:21:13,778 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:21:13,801 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:21:13,801 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:21:13,801 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:21:13,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:21:13,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:21:13,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:21:13,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:21:13,802 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:21:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-19 22:21:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:21:13,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:21:13,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:13,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:21:13,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash 570602568, now seen corresponding path program 1 times [2019-11-19 22:21:13,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:21:13,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420412344] [2019-11-19 22:21:13,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-19 22:21:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:14,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:21:14,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:14,429 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:21:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:14,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420412344] [2019-11-19 22:21:14,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:14,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 22:21:14,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318218584] [2019-11-19 22:21:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:21:14,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:21:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:21:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:21:14,484 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2019-11-19 22:21:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:14,547 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-11-19 22:21:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:21:14,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-19 22:21:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:21:14,559 INFO L225 Difference]: With dead ends: 30 [2019-11-19 22:21:14,559 INFO L226 Difference]: Without dead ends: 14 [2019-11-19 22:21:14,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:21:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-19 22:21:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-19 22:21:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 22:21:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-19 22:21:14,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-11-19 22:21:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:21:14,592 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-19 22:21:14,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:21:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-19 22:21:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:21:14,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:21:14,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:14,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 22:21:14,811 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:21:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 587613229, now seen corresponding path program 1 times [2019-11-19 22:21:14,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:21:14,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857899156] [2019-11-19 22:21:14,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-19 22:21:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:15,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:21:15,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,300 WARN L191 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-19 22:21:31,448 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from false [2019-11-19 22:21:33,483 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from true [2019-11-19 22:21:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:45,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:22:06,713 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 8 [2019-11-19 22:22:10,170 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))) is different from true [2019-11-19 22:22:16,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53)))) is different from false [2019-11-19 22:22:18,356 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53)))) is different from true [2019-11-19 22:22:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:22,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857899156] [2019-11-19 22:22:22,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:22:22,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-11-19 22:22:22,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769936951] [2019-11-19 22:22:22,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:22:22,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:22:22,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:22:22,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=23, Unknown=13, NotChecked=36, Total=90 [2019-11-19 22:22:22,470 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 10 states. [2019-11-19 22:22:47,861 WARN L191 SmtUtils]: Spent 14.70 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-19 22:23:09,877 WARN L191 SmtUtils]: Spent 10.40 s on a formula simplification that was a NOOP. DAG size: 13 [2019-11-19 22:23:18,217 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) is different from false [2019-11-19 22:23:37,975 WARN L191 SmtUtils]: Spent 8.31 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-19 22:23:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:23:42,826 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-19 22:23:42,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:23:42,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-19 22:23:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:23:42,875 INFO L225 Difference]: With dead ends: 22 [2019-11-19 22:23:42,876 INFO L226 Difference]: Without dead ends: 17 [2019-11-19 22:23:42,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 106.1s TimeCoverageRelationStatistics Valid=33, Invalid=51, Unknown=22, NotChecked=76, Total=182 [2019-11-19 22:23:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-19 22:23:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-19 22:23:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 22:23:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-11-19 22:23:42,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-11-19 22:23:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:23:42,882 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-19 22:23:42,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:23:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-11-19 22:23:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:23:42,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:23:42,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:23:43,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 22:23:43,092 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:23:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:23:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -125142316, now seen corresponding path program 1 times [2019-11-19 22:23:43,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:23:43,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720247877] [2019-11-19 22:23:43,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-19 22:23:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:23:43,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:23:43,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:23:46,853 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) is different from true [2019-11-19 22:23:53,650 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (_ +zero 11 53))))) is different from false [2019-11-19 22:23:55,874 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (_ +zero 11 53))))) is different from true [2019-11-19 22:24:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:24:09,499 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:24:23,346 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification that was a NOOP. DAG size: 7 [2019-11-19 22:24:30,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (fp.geq (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (_ +zero 11 53)))) is different from false [2019-11-19 22:24:32,343 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (fp.geq (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (_ +zero 11 53)))) is different from true [2019-11-19 22:24:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:24:36,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720247877] [2019-11-19 22:24:36,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:24:36,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-11-19 22:24:36,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35338547] [2019-11-19 22:24:36,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:24:36,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:24:36,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:24:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=11, Unknown=8, NotChecked=24, Total=56 [2019-11-19 22:24:36,843 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-11-19 22:24:54,307 WARN L191 SmtUtils]: Spent 10.40 s on a formula simplification that was a NOOP. DAG size: 9 [2019-11-19 22:25:05,971 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (_ +zero 11 53))) is different from false [2019-11-19 22:25:08,444 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (_ +zero 11 53))) is different from true [2019-11-19 22:25:10,722 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) is different from false [2019-11-19 22:25:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:12,734 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-11-19 22:25:12,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:25:12,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-19 22:25:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:12,993 INFO L225 Difference]: With dead ends: 21 [2019-11-19 22:25:12,993 INFO L226 Difference]: Without dead ends: 16 [2019-11-19 22:25:12,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=21, Invalid=16, Unknown=13, NotChecked=60, Total=110 [2019-11-19 22:25:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-19 22:25:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-11-19 22:25:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 22:25:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-11-19 22:25:12,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-11-19 22:25:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:12,998 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-11-19 22:25:12,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:25:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-11-19 22:25:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:25:12,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:12,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:25:13,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 22:25:13,203 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash 519293970, now seen corresponding path program 1 times [2019-11-19 22:25:13,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:25:13,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374796026] [2019-11-19 22:25:13,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-19 22:25:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:13,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:25:13,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:30,688 WARN L191 SmtUtils]: Spent 12.19 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 22:25:32,751 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) is different from false [2019-11-19 22:25:34,806 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) is different from true [2019-11-19 22:25:36,871 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) is different from false [2019-11-19 22:25:43,059 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from false [2019-11-19 22:25:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:48,138 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:26:12,723 WARN L191 SmtUtils]: Spent 10.00 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-19 22:26:16,490 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.geq (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.geq .cse0 (_ +zero 11 53)))))) is different from true [2019-11-19 22:26:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:26:19,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374796026] [2019-11-19 22:26:19,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:26:19,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2019-11-19 22:26:19,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838579643] [2019-11-19 22:26:19,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:26:19,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:26:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:26:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=35, Unknown=12, NotChecked=60, Total=132 [2019-11-19 22:26:19,062 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-11-19 22:26:26,301 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.geq (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.geq .cse0 (_ +zero 11 53)))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) is different from false [2019-11-19 22:27:02,281 WARN L191 SmtUtils]: Spent 28.33 s on a formula simplification that was a NOOP. DAG size: 24 [2019-11-19 22:27:38,928 WARN L191 SmtUtils]: Spent 18.19 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-19 22:27:52,099 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) is different from false [2019-11-19 22:27:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:53,500 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-11-19 22:27:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:27:53,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-11-19 22:27:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:53,553 INFO L225 Difference]: With dead ends: 22 [2019-11-19 22:27:53,553 INFO L226 Difference]: Without dead ends: 14 [2019-11-19 22:27:53,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 132.0s TimeCoverageRelationStatistics Valid=38, Invalid=53, Unknown=23, NotChecked=126, Total=240 [2019-11-19 22:27:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-19 22:27:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-19 22:27:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 22:27:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-11-19 22:27:53,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2019-11-19 22:27:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:53,557 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-11-19 22:27:53,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:27:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-11-19 22:27:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:27:53,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:53,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:27:53,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 22:27:53,759 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash -101291445, now seen corresponding path program 1 times [2019-11-19 22:27:53,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:27:53,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679276770] [2019-11-19 22:27:53,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-19 22:27:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:54,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:27:54,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:27:56,558 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) is different from false [2019-11-19 22:27:58,816 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) is different from true [2019-11-19 22:28:01,059 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) is different from false [2019-11-19 22:28:07,776 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from false [2019-11-19 22:28:09,982 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from true [2019-11-19 22:28:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:28:23,403 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:28:25,687 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from false [2019-11-19 22:28:27,927 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from true [2019-11-19 22:28:34,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse1))) (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse1)) (not (fp.geq .cse0 (_ +zero 11 53))))))) is different from false [2019-11-19 22:28:36,875 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse1))) (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse1)) (not (fp.geq .cse0 (_ +zero 11 53))))))) is different from true [2019-11-19 22:28:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:28:45,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679276770] [2019-11-19 22:28:45,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:28:45,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-11-19 22:28:45,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17288776] [2019-11-19 22:28:45,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:28:45,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:28:45,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:28:45,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=13, Unknown=9, NotChecked=50, Total=90 [2019-11-19 22:28:45,859 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 10 states. [2019-11-19 22:28:48,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse0) (let ((.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0))) (or (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from false [2019-11-19 22:28:50,354 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse0) (let ((.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0))) (or (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from true [2019-11-19 22:28:52,606 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (or (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))))) is different from false [2019-11-19 22:28:54,865 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) is different from false [2019-11-19 22:28:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:28:54,874 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-11-19 22:28:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:28:54,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-11-19 22:28:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:28:54,875 INFO L225 Difference]: With dead ends: 14 [2019-11-19 22:28:54,875 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:28:54,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=24, Invalid=15, Unknown=13, NotChecked=104, Total=156 [2019-11-19 22:28:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:28:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:28:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:28:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:28:54,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-11-19 22:28:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:54,877 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:28:54,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:28:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:28:54,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:28:55,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 22:28:55,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:32:00,077 WARN L191 SmtUtils]: Spent 3.08 m on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-19 22:32:00,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:32:00,079 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 55) no Hoare annotation was computed. [2019-11-19 22:32:00,080 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 60) no Hoare annotation was computed. [2019-11-19 22:32:00,080 INFO L440 ceAbstractionStarter]: At program point L54(lines 29 55) the Hoare annotation is: (= (_ bv1 32) ULTIMATE.start_main_~main____CPAchecker_TMP_1~0) [2019-11-19 22:32:00,080 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 71) no Hoare annotation was computed. [2019-11-19 22:32:00,080 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 22:32:00,080 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 47) no Hoare annotation was computed. [2019-11-19 22:32:00,083 INFO L440 ceAbstractionStarter]: At program point L65(lines 22 66) the Hoare annotation is: (let ((.cse0 (let ((.cse4 (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (or (and .cse4 (fp.leq ULTIMATE.start_main_~main__x~0 .cse5) (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) .cse4 (fp.geq (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse5) (_ +zero 11 53)))))) (.cse2 (fp.leq ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)))) (or (and .cse0 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (= (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))) .cse2) (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (= ULTIMATE.start_main_~main__y~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse3)) (fp.leq ULTIMATE.start_main_~main__x~0 .cse3)))) .cse0 .cse2))) [2019-11-19 22:32:00,083 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 22:32:00,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:32:00,084 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:32:00,085 INFO L440 ceAbstractionStarter]: At program point L59(lines 27 60) the Hoare annotation is: false [2019-11-19 22:32:00,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 40) no Hoare annotation was computed. [2019-11-19 22:32:00,085 INFO L444 ceAbstractionStarter]: For program point L22(lines 22 66) no Hoare annotation was computed. [2019-11-19 22:32:00,085 INFO L444 ceAbstractionStarter]: For program point L16(lines 16 76) no Hoare annotation was computed. [2019-11-19 22:32:00,086 INFO L447 ceAbstractionStarter]: At program point L80(lines 8 82) the Hoare annotation is: true [2019-11-19 22:32:00,086 INFO L444 ceAbstractionStarter]: For program point L14(lines 14 81) no Hoare annotation was computed. [2019-11-19 22:32:00,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,109 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,109 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:32:00 BoogieIcfgContainer [2019-11-19 22:32:00,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:32:00,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:32:00,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:32:00,159 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:32:00,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:13" (3/4) ... [2019-11-19 22:32:00,164 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:32:00,175 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:32:00,175 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:32:00,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0))) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, main__x, main__x), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)), ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)), ~Pluszero~LONGDOUBLE()))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 105.0))) || (((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0))) && ((((~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0))) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, main__x, main__x), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)), ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)), ~Pluszero~LONGDOUBLE())))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 105.0))) [2019-11-19 22:32:00,222 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d847f493-eb48-48c2-870a-a263f7e19fe0/bin/uautomizer/witness.graphml [2019-11-19 22:32:00,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:32:00,224 INFO L168 Benchmark]: Toolchain (without parser) took 649333.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 953.7 MB in the beginning and 959.3 MB in the end (delta: -5.5 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:32:00,224 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:32:00,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.00 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:32:00,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -205.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:32:00,226 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:32:00,227 INFO L168 Benchmark]: RCFGBuilder took 2440.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:32:00,228 INFO L168 Benchmark]: TraceAbstraction took 646415.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.7 MB in the end (delta: 165.9 MB). Peak memory consumption was 165.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:32:00,228 INFO L168 Benchmark]: Witness Printer took 63.64 ms. Allocated memory is still 1.2 GB. Free memory was 965.7 MB in the beginning and 959.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:32:00,232 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.00 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -205.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2440.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 646415.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.7 MB in the end (delta: 165.9 MB). Peak memory consumption was 165.9 MB. Max. memory is 11.5 GB. * Witness Printer took 63.64 ms. Allocated memory is still 1.2 GB. Free memory was 965.7 MB in the beginning and 959.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1bv32 == main____CPAchecker_TMP_1 - InvariantResult [Line: 22]: Loop Invariant [2019-11-19 22:32:00,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,268 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,268 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,268 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,292 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2019-11-19 22:32:00,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 22:32:00,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0))) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, main__x, main__x), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)), ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)), ~Pluszero~LONGDOUBLE()))) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 105.0))) || (((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0))) && ((((~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0))) && ~fp.geq~DOUBLE(~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, main__x, main__x), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)), ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)))) || (((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && ~fp.geq~DOUBLE(~fp.div~DOUBLE(~roundNearestTiesToEven, main__x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10.0)), ~Pluszero~LONGDOUBLE())))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 105.0))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 646.2s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 220.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 184.9s, HoareTripleCheckerStatistics: 46 SDtfs, 24 SDslu, 166 SDs, 0 SdLazy, 42 SolverSat, 3 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 45.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 318.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 200 HoareAnnotationTreeSize, 4 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 184.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 237.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 114 ConstructedInterpolants, 30 QuantifiedInterpolants, 12030 SizeOfPredicates, 14 NumberOfNonLiveVariables, 98 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...