./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20183bacfea343fcbafe493366fbda56f082cdb8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20183bacfea343fcbafe493366fbda56f082cdb8 ................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:19:56,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:19:56,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:19:56,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:19:56,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:19:56,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:19:56,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:19:56,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:19:56,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:19:56,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:19:56,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:19:56,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:19:56,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:19:56,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:19:56,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:19:56,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:19:56,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:19:56,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:19:56,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:19:56,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:19:56,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:19:56,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:19:56,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:19:56,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:19:56,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:19:56,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:19:56,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:19:56,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:19:56,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:19:56,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:19:56,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:19:56,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:19:56,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:19:56,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:19:56,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:19:56,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:19:56,891 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:19:56,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:19:56,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:19:56,898 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:19:56,898 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:19:56,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:19:56,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:19:56,899 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:19:56,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:19:56,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:19:56,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:19:56,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:19:56,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:19:56,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:19:56,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:19:56,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:19:56,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:19:56,902 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20183bacfea343fcbafe493366fbda56f082cdb8 [2018-11-23 08:19:56,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:19:56,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:19:56,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:19:56,935 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:19:56,935 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:19:56,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-23 08:19:56,970 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/21872b1e9/aa632c6b8648469a9f664208ea97aee9/FLAGf6c9045fe [2018-11-23 08:19:57,363 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:19:57,364 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-23 08:19:57,367 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/21872b1e9/aa632c6b8648469a9f664208ea97aee9/FLAGf6c9045fe [2018-11-23 08:19:57,379 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/21872b1e9/aa632c6b8648469a9f664208ea97aee9 [2018-11-23 08:19:57,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:19:57,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:19:57,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:19:57,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:19:57,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:19:57,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57, skipping insertion in model container [2018-11-23 08:19:57,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:19:57,406 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:19:57,508 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:19:57,510 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:19:57,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:19:57,528 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:19:57,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57 WrapperNode [2018-11-23 08:19:57,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:19:57,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:19:57,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:19:57,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:19:57,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:19:57,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:19:57,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:19:57,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:19:57,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... [2018-11-23 08:19:57,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:19:57,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:19:57,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:19:57,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:19:57,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:19:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:19:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:19:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:19:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:19:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:19:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:19:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 08:19:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 08:19:57,748 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:19:57,748 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 08:19:57,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:19:57 BoogieIcfgContainer [2018-11-23 08:19:57,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:19:57,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:19:57,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:19:57,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:19:57,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:19:57" (1/3) ... [2018-11-23 08:19:57,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1067171a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:19:57, skipping insertion in model container [2018-11-23 08:19:57,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:57" (2/3) ... [2018-11-23 08:19:57,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1067171a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:19:57, skipping insertion in model container [2018-11-23 08:19:57,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:19:57" (3/3) ... [2018-11-23 08:19:57,756 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call_true-termination.c [2018-11-23 08:19:57,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:19:57,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:19:57,786 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:19:57,811 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:19:57,812 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:19:57,812 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:19:57,812 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:19:57,812 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:19:57,813 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:19:57,813 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:19:57,813 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:19:57,813 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:19:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 08:19:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 08:19:57,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:19:57,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:19:57,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:19:57,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:19:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1031028888, now seen corresponding path program 1 times [2018-11-23 08:19:57,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:19:57,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:19:57,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:19:57,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:19:57,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:19:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:19:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:19:57,927 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #40#return; [?] CALL call #t~ret3 := main(); [?] havoc ~E0~0;havoc ~E1~0;havoc ~S~0;havoc ~i~0;~E1~0 := ~convertINTToDOUBLE(0);~S~0 := ~convertINTToDOUBLE(0);~i~0 := 0; VAL [main_~i~0=0] [?] assume !!(~i~0 <= 1000000);~E0~0 := #t~nondet1;havoc #t~nondet1;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, ~someUnaryDOUBLEoperation(1.0)) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~E0~0=2.0, main_~i~0=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2;~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.999, ~S~0), ~E0~0), ~E1~0); VAL [main_~E0~0=2.0, main_~i~0=0] [?] ~E1~0 := ~E0~0; VAL [main_~E0~0=2.0, main_~E1~0=2.0, main_~i~0=0] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 10000.0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S~0; [L18] havoc ~i~0; [L20] ~E1~0 := ~convertINTToDOUBLE(0); [L21] ~S~0 := ~convertINTToDOUBLE(0); [L23] ~i~0 := 0; VAL [~i~0=0] [L23-L37] assume !!(~i~0 <= 1000000); [L25] ~E0~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, ~someUnaryDOUBLEoperation(1.0)) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~E0~0=2.0, ~i~0=0] [L28-L33] assume !(0 != #t~nondet2); [L28] havoc #t~nondet2; [L32] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.999, ~S~0), ~E0~0), ~E1~0); VAL [~E0~0=2.0, ~i~0=0] [L34] ~E1~0 := ~E0~0; VAL [~E0~0=2.0, ~E1~0=2.0, ~i~0=0] [L36] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 10000.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S~0; [L18] havoc ~i~0; [L20] ~E1~0 := ~convertINTToDOUBLE(0); [L21] ~S~0 := ~convertINTToDOUBLE(0); [L23] ~i~0 := 0; VAL [~i~0=0] [L23-L37] assume !!(~i~0 <= 1000000); [L25] ~E0~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, ~someUnaryDOUBLEoperation(1.0)) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~E0~0=2.0, ~i~0=0] [L28-L33] assume !(0 != #t~nondet2); [L28] havoc #t~nondet2; [L32] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.999, ~S~0), ~E0~0), ~E1~0); VAL [~E0~0=2.0, ~i~0=0] [L34] ~E1~0 := ~E0~0; VAL [~E0~0=2.0, ~E1~0=2.0, ~i~0=0] [L36] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 10000.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S~0; [L18] havoc ~i~0; [L20] ~E1~0 := ~convertINTToDOUBLE(0); [L21] ~S~0 := ~convertINTToDOUBLE(0); [L23] ~i~0 := 0; VAL [~i~0=0] [L23-L37] COND FALSE !(!(~i~0 <= 1000000)) [L25] ~E0~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, ~someUnaryDOUBLEoperation(1.0)) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~E0~0=2.0, ~i~0=0] [L28-L33] COND FALSE !(0 != #t~nondet2) [L28] havoc #t~nondet2; [L32] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.999, ~S~0), ~E0~0), ~E1~0); VAL [~E0~0=2.0, ~i~0=0] [L34] ~E1~0 := ~E0~0; VAL [~E0~0=2.0, ~E1~0=2.0, ~i~0=0] [L36] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 10000.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S~0; [L18] havoc ~i~0; [L20] ~E1~0 := ~convertINTToDOUBLE(0); [L21] ~S~0 := ~convertINTToDOUBLE(0); [L23] ~i~0 := 0; VAL [~i~0=0] [L23-L37] COND FALSE !(!(~i~0 <= 1000000)) [L25] ~E0~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, ~someUnaryDOUBLEoperation(1.0)) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~E0~0=2.0, ~i~0=0] [L28-L33] COND FALSE !(0 != #t~nondet2) [L28] havoc #t~nondet2; [L32] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.999, ~S~0), ~E0~0), ~E1~0); VAL [~E0~0=2.0, ~i~0=0] [L34] ~E1~0 := ~E0~0; VAL [~E0~0=2.0, ~E1~0=2.0, ~i~0=0] [L36] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 10000.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S~0; [L18] havoc ~i~0; [L20] ~E1~0 := ~convertINTToDOUBLE(0); [L21] ~S~0 := ~convertINTToDOUBLE(0); [L23] ~i~0 := 0; VAL [~i~0=0] [L23-L37] COND FALSE !(!(~i~0 <= 1000000)) [L25] ~E0~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, ~someUnaryDOUBLEoperation(1.0)) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~E0~0=2.0, ~i~0=0] [L28-L33] COND FALSE !(0 != #t~nondet2) [L28] havoc #t~nondet2; [L32] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.999, ~S~0), ~E0~0), ~E1~0); VAL [~E0~0=2.0, ~i~0=0] [L34] ~E1~0 := ~E0~0; VAL [~E0~0=2.0, ~E1~0=2.0, ~i~0=0] [L36] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 10000.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L17] havoc ~E0~0; [L17] havoc ~E1~0; [L17] havoc ~S~0; [L18] havoc ~i~0; [L20] ~E1~0 := ~convertINTToDOUBLE(0); [L21] ~S~0 := ~convertINTToDOUBLE(0); [L23] ~i~0 := 0; VAL [~i~0=0] [L23-L37] COND FALSE !(!(~i~0 <= 1000000)) [L25] ~E0~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~E0~0, ~someUnaryDOUBLEoperation(1.0)) && ~someBinaryDOUBLEComparisonOperation(~E0~0, 1.0) then 1 else 0); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~E0~0=2.0, ~i~0=0] [L28-L33] COND FALSE !(0 != #t~nondet2) [L28] havoc #t~nondet2; [L32] ~S~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(0.999, ~S~0), ~E0~0), ~E1~0); VAL [~E0~0=2.0, ~i~0=0] [L34] ~E1~0 := ~E0~0; VAL [~E0~0=2.0, ~E1~0=2.0, ~i~0=0] [L36] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~S~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~S~0, 10000.0) then 1 else 0)); VAL [#in~cond=0] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L12] assert false; VAL [#in~cond=0, ~cond=0] [L17] double E0, E1, S; [L18] int i; [L20] E1 = 0 [L21] S = 0 [L23] i = 0 VAL [i=0] [L23] COND TRUE i <= 1000000 [L25] E0 = __VERIFIER_nondet_double() [L28] COND FALSE !(__VERIFIER_nondet_int()) [L32] S = 0.999 * S + E0 - E1 VAL [E0=2, i=0] [L34] E1 = E0 VAL [E0=2, E1=2, i=0] [L36] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) VAL [\old(cond)=0] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 08:19:57,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:19:57 BoogieIcfgContainer [2018-11-23 08:19:57,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:19:57,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:19:57,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:19:57,955 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:19:57,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:19:57" (3/4) ... [2018-11-23 08:19:57,958 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:19:57,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:19:57,959 INFO L168 Benchmark]: Toolchain (without parser) took 576.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:19:57,960 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:19:57,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:19:57,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.84 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:19:57,962 INFO L168 Benchmark]: Boogie Preprocessor took 14.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:19:57,962 INFO L168 Benchmark]: RCFGBuilder took 192.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 08:19:57,963 INFO L168 Benchmark]: TraceAbstraction took 204.69 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:19:57,963 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:19:57,966 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.30 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.84 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 192.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 204.69 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 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: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 26, overapproximation of to_real at line 20, overapproximation of someBinaryArithmeticDOUBLEoperation at line 32. Possible FailurePath: [L17] double E0, E1, S; [L18] int i; [L20] E1 = 0 [L21] S = 0 [L23] i = 0 VAL [i=0] [L23] COND TRUE i <= 1000000 [L25] E0 = __VERIFIER_nondet_double() [L28] COND FALSE !(__VERIFIER_nondet_int()) [L32] S = 0.999 * S + E0 - E1 VAL [E0=2, i=0] [L34] E1 = E0 VAL [E0=2, E1=2, i=0] [L36] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) VAL [\old(cond)=0] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 08:19:59,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:19:59,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:19:59,414 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:19:59,414 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:19:59,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:19:59,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:19:59,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:19:59,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:19:59,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:19:59,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:19:59,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:19:59,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:19:59,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:19:59,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:19:59,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:19:59,423 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:19:59,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:19:59,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:19:59,427 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:19:59,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:19:59,428 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:19:59,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:19:59,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:19:59,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:19:59,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:19:59,431 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:19:59,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:19:59,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:19:59,433 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:19:59,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:19:59,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:19:59,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:19:59,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:19:59,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:19:59,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:19:59,436 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 08:19:59,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:19:59,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:19:59,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:19:59,448 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:19:59,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:19:59,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:19:59,449 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:19:59,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:19:59,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:19:59,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:19:59,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:19:59,449 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:19:59,449 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:19:59,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:19:59,450 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:19:59,450 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:19:59,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:19:59,450 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:19:59,450 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:19:59,450 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:19:59,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:19:59,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:19:59,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:19:59,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:19:59,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:19:59,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:19:59,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:19:59,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:19:59,452 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 08:19:59,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:19:59,452 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:19:59,452 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:19:59,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20183bacfea343fcbafe493366fbda56f082cdb8 [2018-11-23 08:19:59,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:19:59,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:19:59,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:19:59,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:19:59,494 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:19:59,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-23 08:19:59,530 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/345cdf795/77e54954be3642c5937e16e0eb6127ab/FLAGa50e7020d [2018-11-23 08:19:59,931 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:19:59,931 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/sv-benchmarks/c/float-benchs/filter1_true-unreach-call_true-termination.c [2018-11-23 08:19:59,935 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/345cdf795/77e54954be3642c5937e16e0eb6127ab/FLAGa50e7020d [2018-11-23 08:19:59,944 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/data/345cdf795/77e54954be3642c5937e16e0eb6127ab [2018-11-23 08:19:59,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:19:59,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:19:59,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:19:59,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:19:59,949 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:19:59,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:19:59" (1/1) ... [2018-11-23 08:19:59,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b44462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:19:59, skipping insertion in model container [2018-11-23 08:19:59,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:19:59" (1/1) ... [2018-11-23 08:19:59,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:19:59,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:20:00,085 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:20:00,089 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:20:00,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:20:00,110 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:20:00,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00 WrapperNode [2018-11-23 08:20:00,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:20:00,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:20:00,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:20:00,111 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:20:00,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:20:00,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:20:00,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:20:00,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:20:00,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... [2018-11-23 08:20:00,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:20:00,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:20:00,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:20:00,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:20:00,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:20:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:20:00,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:20:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:20:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:20:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:20:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:20:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 08:20:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 08:20:02,373 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:20:02,373 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 08:20:02,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:20:02 BoogieIcfgContainer [2018-11-23 08:20:02,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:20:02,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:20:02,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:20:02,376 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:20:02,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:19:59" (1/3) ... [2018-11-23 08:20:02,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7440975c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:20:02, skipping insertion in model container [2018-11-23 08:20:02,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:20:00" (2/3) ... [2018-11-23 08:20:02,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7440975c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:20:02, skipping insertion in model container [2018-11-23 08:20:02,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:20:02" (3/3) ... [2018-11-23 08:20:02,379 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call_true-termination.c [2018-11-23 08:20:02,387 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:20:02,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:20:02,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:20:02,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:20:02,422 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:20:02,422 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:20:02,422 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:20:02,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:20:02,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:20:02,423 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:20:02,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:20:02,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:20:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 08:20:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 08:20:02,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:20:02,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:20:02,442 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:20:02,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:20:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1031028888, now seen corresponding path program 1 times [2018-11-23 08:20:02,448 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:20:02,448 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 08:20:02,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:20:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:20:02,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:20:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:20:02,934 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:20:02,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:20:02,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 08:20:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:20:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:20:02,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:20:02,957 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 7 states. [2018-11-23 08:20:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:20:07,772 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-23 08:20:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:20:07,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-23 08:20:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:20:07,779 INFO L225 Difference]: With dead ends: 55 [2018-11-23 08:20:07,779 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 08:20:07,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:20:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 08:20:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-11-23 08:20:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 08:20:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 08:20:07,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2018-11-23 08:20:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:20:07,805 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 08:20:07,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:20:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 08:20:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:20:07,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:20:07,806 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:20:07,806 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:20:07,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:20:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1126207937, now seen corresponding path program 1 times [2018-11-23 08:20:07,807 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:20:07,807 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 08:20:07,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:20:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:20:09,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:20:11,403 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse1))) (and (fp.leq v_main_~S~0_9 .cse0) (fp.leq main_~E1~0 .cse1) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (fp.geq v_main_~S~0_9 (fp.neg .cse0)) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E0~0 .cse2))))) is different from false [2018-11-23 08:20:13,428 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse1))) (and (fp.leq v_main_~S~0_9 .cse0) (fp.leq main_~E1~0 .cse1) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (fp.geq v_main_~S~0_9 (fp.neg .cse0)) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E0~0 .cse2))))) is different from true [2018-11-23 08:20:29,733 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse3 (fp.neg .cse1)) (.cse4 (fp.neg .cse2))) (and (fp.leq v_prenex_3 .cse1) (fp.leq v_prenex_1 .cse2) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_3) v_prenex_2) v_prenex_1) .cse3)) (fp.geq v_prenex_3 .cse3) (fp.geq v_prenex_1 .cse4) (fp.leq v_prenex_2 .cse2) (fp.geq v_prenex_2 .cse4)))))) (and (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse7 (fp.neg .cse5))) (and (fp.leq v_prenex_5 .cse5) (fp.leq v_prenex_7 .cse6) (fp.geq v_prenex_5 .cse7) (fp.geq v_prenex_7 (fp.neg .cse6)) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_7) v_prenex_6) v_prenex_5) .cse6)) (fp.leq v_prenex_6 .cse5) (fp.geq v_prenex_6 .cse7))))) .cse0) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (.cse10 (fp.neg .cse8)) (.cse11 (fp.neg .cse9))) (and (fp.leq v_main_~S~0_9 .cse8) (fp.leq main_~E1~0 .cse9) (fp.geq v_main_~S~0_9 .cse10) (fp.geq main_~E1~0 .cse11) (fp.leq main_~E0~0 .cse9) (fp.leq .cse12 .cse8) (fp.geq .cse12 .cse10) (fp.geq main_~E0~0 .cse11)))))))) is different from false [2018-11-23 08:20:44,041 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse3 (fp.neg .cse1)) (.cse4 (fp.neg .cse2))) (and (fp.leq v_prenex_3 .cse1) (fp.leq v_prenex_1 .cse2) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_3) v_prenex_2) v_prenex_1) .cse3)) (fp.geq v_prenex_3 .cse3) (fp.geq v_prenex_1 .cse4) (fp.leq v_prenex_2 .cse2) (fp.geq v_prenex_2 .cse4)))))) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (.cse7 (fp.neg .cse5)) (.cse8 (fp.neg .cse6))) (and (fp.leq v_main_~S~0_9 .cse5) (fp.leq main_~E1~0 .cse6) (fp.geq v_main_~S~0_9 .cse7) (fp.geq main_~E1~0 .cse8) (fp.leq main_~E0~0 .cse6) (fp.leq .cse9 .cse5) (fp.geq .cse9 .cse7) (fp.geq main_~E0~0 .cse8)))))) (and .cse0 (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse12 (fp.neg .cse10))) (and (fp.leq v_prenex_5 .cse10) (fp.leq v_prenex_7 .cse11) (fp.geq v_prenex_5 .cse12) (fp.geq v_prenex_7 (fp.neg .cse11)) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_7) v_prenex_6) v_prenex_5) .cse11)) (fp.leq v_prenex_6 .cse10) (fp.geq v_prenex_6 .cse12)))))))) is different from false [2018-11-23 08:20:54,267 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse0))) (and (fp.leq v_prenex_5 .cse0) (fp.leq v_prenex_7 .cse1) (fp.geq v_prenex_5 .cse2) (fp.geq v_prenex_7 (fp.neg .cse1)) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_7) v_prenex_6) v_prenex_5) .cse1)) (fp.leq v_prenex_6 .cse0) (fp.geq v_prenex_6 .cse2))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse5 (fp.neg .cse3)) (.cse6 (fp.neg .cse4))) (and (fp.leq v_prenex_3 .cse3) (fp.leq v_prenex_1 .cse4) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_3) v_prenex_2) v_prenex_1) .cse5)) (fp.geq v_prenex_3 .cse5) (fp.geq v_prenex_1 .cse6) (fp.leq v_prenex_2 .cse4) (fp.geq v_prenex_2 .cse6)))))) is different from false [2018-11-23 08:20:56,317 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse0))) (and (fp.leq v_prenex_5 .cse0) (fp.leq v_prenex_7 .cse1) (fp.geq v_prenex_5 .cse2) (fp.geq v_prenex_7 (fp.neg .cse1)) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_7) v_prenex_6) v_prenex_5) .cse1)) (fp.leq v_prenex_6 .cse0) (fp.geq v_prenex_6 .cse2))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse5 (fp.neg .cse3)) (.cse6 (fp.neg .cse4))) (and (fp.leq v_prenex_3 .cse3) (fp.leq v_prenex_1 .cse4) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_3) v_prenex_2) v_prenex_1) .cse5)) (fp.geq v_prenex_3 .cse5) (fp.geq v_prenex_1 .cse6) (fp.leq v_prenex_2 .cse4) (fp.geq v_prenex_2 .cse6)))))) is different from true [2018-11-23 08:20:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-23 08:20:56,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:20:58,425 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) c_main_~E0~0) c_main_~E1~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-23 08:21:02,233 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E0~0_5 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_main_~E0~0_5 .cse0)) (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_main_~E0~0_5) c_main_~E1~0) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (not (fp.geq v_main_~E0~0_5 (fp.neg .cse0)))))) (forall ((v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.geq v_prenex_9 (fp.neg .cse1))) (not (fp.leq v_prenex_9 .cse1)) (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) c_main_~S~0) v_prenex_9) c_main_~E1~0) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))))) is different from true [2018-11-23 08:21:04,310 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (not (fp.geq v_prenex_9 (fp.neg .cse0))) (not (fp.leq v_prenex_9 .cse0)) (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_11) v_prenex_9) c_main_~E1~0) .cse1) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_11 (fp.neg .cse1)))))) (forall ((v_main_~E0~0_5 (_ FloatingPoint 11 53)) (main_~S~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse4 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_main_~E0~0_5 .cse2)) (not (fp.leq main_~S~0 .cse3)) (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) main_~S~0) v_main_~E0~0_5) c_main_~E1~0) .cse4) (not (fp.geq main_~S~0 .cse4)) (not (fp.geq v_main_~E0~0_5 (fp.neg .cse2)))))))) is different from false [2018-11-23 08:21:06,378 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (not (fp.geq v_prenex_9 (fp.neg .cse0))) (not (fp.leq v_prenex_9 .cse0)) (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_11) v_prenex_9) c_main_~E1~0) .cse1) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_11 (fp.neg .cse1)))))) (forall ((v_main_~E0~0_5 (_ FloatingPoint 11 53)) (main_~S~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse4 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_main_~E0~0_5 .cse2)) (not (fp.leq main_~S~0 .cse3)) (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) main_~S~0) v_main_~E0~0_5) c_main_~E1~0) .cse4) (not (fp.geq main_~S~0 .cse4)) (not (fp.geq v_main_~E0~0_5 (fp.neg .cse2)))))))) is different from true [2018-11-23 08:21:06,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:21:06,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:21:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:21:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 08:21:18,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 08:21:18,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 08:21:18,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 08:21:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 08:21:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=71, Unknown=10, NotChecked=154, Total=272 [2018-11-23 08:21:18,675 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2018-11-23 08:21:22,811 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse2 (fp.neg .cse1))) (and (fp.leq v_main_~S~0_9 .cse0) (fp.leq main_~E1~0 .cse1) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (fp.geq v_main_~S~0_9 (fp.neg .cse0)) (fp.geq main_~E1~0 .cse2) (fp.leq main_~E0~0 .cse1) (fp.geq main_~E0~0 .cse2))))) (fp.leq c_main_~E0~0 .cse3) (fp.geq c_main_~E0~0 (fp.neg .cse3)))) is different from false [2018-11-23 08:21:24,855 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_main_~E1~0 .cse0) (fp.geq c_main_~E1~0 (fp.neg .cse0)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse3 (fp.neg .cse2))) (and (fp.leq v_main_~S~0_9 .cse1) (fp.leq main_~E1~0 .cse2) (= c_main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (fp.geq v_main_~S~0_9 (fp.neg .cse1)) (fp.geq main_~E1~0 .cse3) (fp.leq main_~E0~0 .cse2) (fp.geq main_~E0~0 .cse3))))))) is different from false [2018-11-23 08:21:26,978 WARN L832 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse3 (fp.neg .cse1)) (.cse4 (fp.neg .cse2))) (and (fp.leq v_prenex_3 .cse1) (fp.leq v_prenex_1 .cse2) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_3) v_prenex_2) v_prenex_1) .cse3)) (fp.geq v_prenex_3 .cse3) (fp.geq v_prenex_1 .cse4) (fp.leq v_prenex_2 .cse2) (fp.geq v_prenex_2 .cse4)))))) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (.cse7 (fp.neg .cse5)) (.cse8 (fp.neg .cse6))) (and (fp.leq v_main_~S~0_9 .cse5) (fp.leq main_~E1~0 .cse6) (fp.geq v_main_~S~0_9 .cse7) (fp.geq main_~E1~0 .cse8) (fp.leq main_~E0~0 .cse6) (fp.leq .cse9 .cse5) (fp.geq .cse9 .cse7) (fp.geq main_~E0~0 .cse8)))))) (and .cse0 (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse12 (fp.neg .cse10))) (and (fp.leq v_prenex_5 .cse10) (fp.leq v_prenex_7 .cse11) (fp.geq v_prenex_5 .cse12) (fp.geq v_prenex_7 (fp.neg .cse11)) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_prenex_7) v_prenex_6) v_prenex_5) .cse11)) (fp.leq v_prenex_6 .cse10) (fp.geq v_prenex_6 .cse12))))))))) is different from false [2018-11-23 08:21:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:21:27,014 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 08:21:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:21:27,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 08:21:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:21:27,016 INFO L225 Difference]: With dead ends: 32 [2018-11-23 08:21:27,016 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 08:21:27,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=48, Invalid=89, Unknown=13, NotChecked=270, Total=420 [2018-11-23 08:21:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 08:21:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 08:21:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 08:21:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 08:21:27,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 08:21:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:21:27,019 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:21:27,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 08:21:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:21:27,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:21:27,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 08:22:24,247 WARN L180 SmtUtils]: Spent 57.16 s on a formula simplification. DAG size of input: 103 DAG size of output: 1 [2018-11-23 08:23:31,595 WARN L180 SmtUtils]: Spent 1.12 m on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-23 08:23:31,613 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 08:23:31,613 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:23:31,613 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:23:31,613 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 08:23:31,613 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 08:23:31,613 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:23:31,613 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 15 39) the Hoare annotation is: true [2018-11-23 08:23:31,614 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 33) no Hoare annotation was computed. [2018-11-23 08:23:31,614 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 28 33) no Hoare annotation was computed. [2018-11-23 08:23:31,614 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 15 39) no Hoare annotation was computed. [2018-11-23 08:23:31,614 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 37) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.leq main_~E1~0 .cse0) (fp.leq main_~S~0 .cse1) (fp.geq main_~E1~0 (fp.neg .cse0)) (fp.geq main_~S~0 (fp.neg .cse1)))) [2018-11-23 08:23:31,614 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 37) no Hoare annotation was computed. [2018-11-23 08:23:31,614 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 15 39) no Hoare annotation was computed. [2018-11-23 08:23:31,614 INFO L444 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.neg .cse2))) (let ((.cse0 (fp.leq main_~E1~0 .cse2)) (.cse1 (fp.geq main_~E1~0 .cse5))) (or (and .cse0 .cse1 (fp.leq main_~E0~0 .cse2) (exists ((main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq main_~E0~0 .cse3) (= (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) .cse4) main_~E0~0) .cse4)) main_~S~0) (fp.geq main_~E0~0 (fp.neg .cse3))))) (fp.geq main_~E0~0 .cse5)) (and .cse0 .cse1 (exists ((main_~E1~0 (_ FloatingPoint 11 53)) (main_~E0~0 (_ FloatingPoint 11 53)) (v_main_~S~0_9 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse8 (fp.neg .cse7))) (and (fp.leq v_main_~S~0_9 .cse6) (fp.leq main_~E1~0 .cse7) (= main_~S~0 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) v_main_~S~0_9) main_~E0~0) main_~E1~0)) (fp.geq v_main_~S~0_9 (fp.neg .cse6)) (fp.geq main_~E1~0 .cse8) (fp.leq main_~E0~0 .cse7) (fp.geq main_~E0~0 .cse8)))))))))) [2018-11-23 08:23:31,615 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 37) no Hoare annotation was computed. [2018-11-23 08:23:31,615 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 12) the Hoare annotation is: true [2018-11-23 08:23:31,615 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-11-23 08:23:31,615 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-23 08:23:31,615 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-11-23 08:23:31,615 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 12) no Hoare annotation was computed. [2018-11-23 08:23:31,615 INFO L448 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. [2018-11-23 08:23:31,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:23:31 BoogieIcfgContainer [2018-11-23 08:23:31,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:23:31,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:23:31,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:23:31,627 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:23:31,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:20:02" (3/4) ... [2018-11-23 08:23:31,630 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 08:23:31,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 08:23:31,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 08:23:31,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 08:23:31,637 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 08:23:31,637 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 08:23:31,637 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 08:23:31,666 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_63ba3125-5f26-4e8f-ab1e-4be5076b0dcc/bin-2019/uautomizer/witness.graphml [2018-11-23 08:23:31,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:23:31,666 INFO L168 Benchmark]: Toolchain (without parser) took 211720.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 943.8 MB in the beginning and 979.6 MB in the end (delta: -35.7 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:23:31,667 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:23:31,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.53 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 933.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:23:31,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.46 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:23:31,668 INFO L168 Benchmark]: Boogie Preprocessor took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:23:31,668 INFO L168 Benchmark]: RCFGBuilder took 2226.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 08:23:31,668 INFO L168 Benchmark]: TraceAbstraction took 209252.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.4 MB in the end (delta: 117.2 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:23:31,668 INFO L168 Benchmark]: Witness Printer took 39.24 ms. Allocated memory is still 1.2 GB. Free memory was 986.4 MB in the beginning and 979.6 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:23:31,670 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.53 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 933.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.46 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2226.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 209252.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.4 MB in the end (delta: 117.2 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. * Witness Printer took 39.24 ms. Allocated memory is still 1.2 GB. Free memory was 986.4 MB in the beginning and 979.6 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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 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: 12]: 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: 23]: Loop Invariant [2018-11-23 08:23:31,674 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 08:23:31,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.leq~DOUBLE(E1, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)) && ~fp.leq~DOUBLE(S, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.geq~DOUBLE(E1, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)))) && ~fp.geq~DOUBLE(S, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 10000.0))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 209.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 124.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 28 SDslu, 109 SDs, 0 SdLazy, 38 SolverSat, 16 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 16 NumberOfFragments, 144 HoareAnnotationTreeSize, 10 FomulaSimplifications, 166 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 812 FormulaSimplificationTreeSizeReductionInter, 124.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 13.6s SatisfiabilityAnalysisTime, 57.4s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 7 QuantifiedInterpolants, 15470 SizeOfPredicates, 10 NumberOfNonLiveVariables, 64 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...