./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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 1d363a30f559764c47bcb73d637f2d7196a1b97b ................................................................................................................................................................................................................................................. 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_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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 1d363a30f559764c47bcb73d637f2d7196a1b97b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:12:52,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:12:52,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:12:52,843 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:12:52,844 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:12:52,844 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:12:52,845 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:12:52,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:12:52,846 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:12:52,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:12:52,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:12:52,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:12:52,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:12:52,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:12:52,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:12:52,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:12:52,849 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:12:52,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:12:52,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:12:52,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:12:52,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:12:52,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:12:52,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:12:52,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:12:52,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:12:52,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:12:52,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:12:52,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:12:52,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:12:52,856 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:12:52,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:12:52,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:12:52,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:12:52,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:12:52,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:12:52,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:12:52,857 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 22:12:52,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:12:52,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:12:52,864 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:12:52,865 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:12:52,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:12:52,865 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:12:52,865 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:12:52,865 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:12:52,865 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:12:52,865 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:12:52,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:12:52,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:12:52,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:12:52,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 22:12:52,867 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_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2018-12-01 22:12:52,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:12:52,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:12:52,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:12:52,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:12:52,893 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:12:52,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-12-01 22:12:52,929 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/205f403f9/db92fd9f2f7e4f55b65a4cc025dec7cc/FLAG2bc724606 [2018-12-01 22:12:53,314 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:12:53,314 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-12-01 22:12:53,317 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/205f403f9/db92fd9f2f7e4f55b65a4cc025dec7cc/FLAG2bc724606 [2018-12-01 22:12:53,325 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/205f403f9/db92fd9f2f7e4f55b65a4cc025dec7cc [2018-12-01 22:12:53,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:12:53,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:12:53,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:12:53,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:12:53,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:12:53,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3033e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53, skipping insertion in model container [2018-12-01 22:12:53,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:12:53,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:12:53,427 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:12:53,429 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:12:53,437 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:12:53,445 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:12:53,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53 WrapperNode [2018-12-01 22:12:53,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:12:53,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:12:53,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:12:53,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:12:53,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:12:53,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:12:53,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:12:53,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:12:53,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... [2018-12-01 22:12:53,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:12:53,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:12:53,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:12:53,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:12:53,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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-12-01 22:12:53,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 22:12:53,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 22:12:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:12:53,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:12:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 22:12:53,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 22:12:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-01 22:12:53,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-01 22:12:53,620 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:12:53,620 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 22:12:53,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:12:53 BoogieIcfgContainer [2018-12-01 22:12:53,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:12:53,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:12:53,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:12:53,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:12:53,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:12:53" (1/3) ... [2018-12-01 22:12:53,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c910191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:12:53, skipping insertion in model container [2018-12-01 22:12:53,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:53" (2/3) ... [2018-12-01 22:12:53,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c910191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:12:53, skipping insertion in model container [2018-12-01 22:12:53,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:12:53" (3/3) ... [2018-12-01 22:12:53,624 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2018-12-01 22:12:53,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:12:53,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 22:12:53,644 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 22:12:53,661 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:12:53,662 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:12:53,662 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 22:12:53,662 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:12:53,662 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:12:53,662 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:12:53,662 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:12:53,662 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:12:53,662 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:12:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-01 22:12:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 22:12:53,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:12:53,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:12:53,677 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:12:53,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:12:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash -14991171, now seen corresponding path program 1 times [2018-12-01 22:12:53,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:12:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:12:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:12:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:12:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:12:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:12:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:12:53,744 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 22:12:53,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:12:53 BoogieIcfgContainer [2018-12-01 22:12:53,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:12:53,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:12:53,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:12:53,758 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:12:53,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:12:53" (3/4) ... [2018-12-01 22:12:53,760 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:12:53,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:12:53,761 INFO L168 Benchmark]: Toolchain (without parser) took 433.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:12:53,762 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:12:53,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.45 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:12:53,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.64 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 942.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:12:53,763 INFO L168 Benchmark]: Boogie Preprocessor took 40.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:12:53,764 INFO L168 Benchmark]: RCFGBuilder took 122.15 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: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-12-01 22:12:53,764 INFO L168 Benchmark]: TraceAbstraction took 136.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:12:53,764 INFO L168 Benchmark]: Witness Printer took 2.92 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-12-01 22:12:53,766 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.45 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 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 11.64 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 942.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 122.15 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: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 136.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 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: 2]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 18, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L9] double x = 1.0; [L10] double x1 = x/1.6; VAL [x=1] [L12] COND FALSE !(x1 != x) VAL [x=1] [L18] CALL __VERIFIER_assert(x == 0) VAL [\old(cond)=0] [L2] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L2] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. UNSAFE Result, 0.0s 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=18occurred 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, 10 NumberOfCodeBlocks, 10 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-635dfa2 [2018-12-01 22:12:55,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:12:55,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:12:55,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:12:55,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:12:55,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:12:55,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:12:55,101 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:12:55,102 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:12:55,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:12:55,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:12:55,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:12:55,104 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:12:55,105 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:12:55,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:12:55,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:12:55,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:12:55,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:12:55,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:12:55,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:12:55,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:12:55,110 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:12:55,112 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:12:55,112 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:12:55,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:12:55,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:12:55,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:12:55,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:12:55,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:12:55,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:12:55,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:12:55,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:12:55,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:12:55,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:12:55,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:12:55,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:12:55,116 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-01 22:12:55,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:12:55,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:12:55,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:12:55,126 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:12:55,127 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:12:55,127 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:12:55,127 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:12:55,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:12:55,128 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:12:55,128 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:12:55,128 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:12:55,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:12:55,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:12:55,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:12:55,128 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 22:12:55,129 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 22:12:55,129 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:12:55,129 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:12:55,129 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:12:55,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:12:55,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:12:55,130 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:12:55,130 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:12:55,130 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:12:55,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:12:55,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:12:55,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:12:55,130 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:12:55,131 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-01 22:12:55,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:12:55,131 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 22:12:55,131 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-01 22:12:55,131 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_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2018-12-01 22:12:55,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:12:55,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:12:55,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:12:55,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:12:55,165 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:12:55,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-12-01 22:12:55,201 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/76fe0cc01/634cd1f3210447b1ae63216eaa99c1d1/FLAGf971f2057 [2018-12-01 22:12:55,631 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:12:55,631 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2018-12-01 22:12:55,634 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/76fe0cc01/634cd1f3210447b1ae63216eaa99c1d1/FLAGf971f2057 [2018-12-01 22:12:55,642 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/data/76fe0cc01/634cd1f3210447b1ae63216eaa99c1d1 [2018-12-01 22:12:55,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:12:55,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:12:55,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:12:55,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:12:55,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:12:55,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5a08fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55, skipping insertion in model container [2018-12-01 22:12:55,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:12:55,661 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:12:55,745 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:12:55,749 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:12:55,757 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:12:55,765 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:12:55,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55 WrapperNode [2018-12-01 22:12:55,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:12:55,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:12:55,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:12:55,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:12:55,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:12:55,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:12:55,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:12:55,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:12:55,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... [2018-12-01 22:12:55,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:12:55,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:12:55,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:12:55,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:12:55,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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-12-01 22:12:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 22:12:55,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 22:12:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:12:55,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:12:55,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 22:12:55,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 22:12:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-01 22:12:55,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-01 22:12:56,641 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:12:56,641 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 22:12:56,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:12:56 BoogieIcfgContainer [2018-12-01 22:12:56,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:12:56,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:12:56,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:12:56,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:12:56,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:12:55" (1/3) ... [2018-12-01 22:12:56,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eab192e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:12:56, skipping insertion in model container [2018-12-01 22:12:56,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:12:55" (2/3) ... [2018-12-01 22:12:56,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eab192e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:12:56, skipping insertion in model container [2018-12-01 22:12:56,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:12:56" (3/3) ... [2018-12-01 22:12:56,646 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2018-12-01 22:12:56,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:12:56,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 22:12:56,664 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 22:12:56,681 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:12:56,682 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:12:56,682 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 22:12:56,682 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:12:56,682 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:12:56,682 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:12:56,682 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:12:56,682 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:12:56,682 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:12:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-01 22:12:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 22:12:56,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:12:56,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:12:56,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:12:56,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:12:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash -14991171, now seen corresponding path program 1 times [2018-12-01 22:12:56,706 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 22:12:56,706 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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-12-01 22:12:56,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:12:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:12:56,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:12:58,498 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 11 [2018-12-01 22:12:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:12:58,506 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:12:58,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:12:58,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:12:58,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:12:58,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:12:58,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:12:58,527 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-01 22:12:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:12:59,981 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-12-01 22:13:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:13:00,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-01 22:13:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:13:00,594 INFO L225 Difference]: With dead ends: 31 [2018-12-01 22:13:00,594 INFO L226 Difference]: Without dead ends: 12 [2018-12-01 22:13:00,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:13:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-01 22:13:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-01 22:13:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-01 22:13:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-01 22:13:00,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-01 22:13:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:13:00,617 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-01 22:13:00,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:13:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-01 22:13:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 22:13:00,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:13:00,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:13:00,617 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:13:00,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:13:00,618 INFO L82 PathProgramCache]: Analyzing trace with hash -429188558, now seen corresponding path program 1 times [2018-12-01 22:13:00,618 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 22:13:00,618 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/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-12-01 22:13:00,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:13:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:13:01,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:13:05,260 WARN L180 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-01 22:13:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:13:05,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 22:13:15,792 WARN L180 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 7 [2018-12-01 22:13:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:13:15,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 22:13:15,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-01 22:13:15,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:13:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:13:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2018-12-01 22:13:15,816 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-12-01 22:13:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:13:24,052 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-01 22:13:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:13:24,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-01 22:13:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:13:24,258 INFO L225 Difference]: With dead ends: 19 [2018-12-01 22:13:24,258 INFO L226 Difference]: Without dead ends: 14 [2018-12-01 22:13:24,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=17, Invalid=24, Unknown=1, NotChecked=0, Total=42 [2018-12-01 22:13:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-01 22:13:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-01 22:13:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-01 22:13:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-01 22:13:24,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-01 22:13:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:13:24,262 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-01 22:13:24,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:13:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-01 22:13:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 22:13:24,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:13:24,263 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:13:24,264 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:13:24,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:13:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1003863954, now seen corresponding path program 2 times [2018-12-01 22:13:24,264 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 22:13:24,264 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-01 22:13:24,268 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-01 22:13:25,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 22:13:25,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 22:13:25,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:13:33,429 WARN L180 SmtUtils]: Spent 2.93 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-01 22:13:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:13:33,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 22:13:40,848 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-12-01 22:13:44,123 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-01 22:13:46,540 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-01 22:13:49,139 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-01 22:13:51,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-01 22:13:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-01 22:13:51,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 22:13:51,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-12-01 22:13:51,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 22:13:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 22:13:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=6, NotChecked=54, Total=156 [2018-12-01 22:13:51,783 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-01 22:13:54,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 .cse2))) (or (fp.eq c_main_~x~0 .cse2) (not (fp.eq c_main_~x1~0 c_main_~x~0))))) is different from true [2018-12-01 22:13:56,818 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-12-01 22:14:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:14:06,345 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-01 22:14:06,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 22:14:06,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-01 22:14:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:14:06,346 INFO L225 Difference]: With dead ends: 24 [2018-12-01 22:14:06,346 INFO L226 Difference]: Without dead ends: 16 [2018-12-01 22:14:06,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=33, Invalid=89, Unknown=8, NotChecked=110, Total=240 [2018-12-01 22:14:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-01 22:14:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-01 22:14:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-01 22:14:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-01 22:14:06,350 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-01 22:14:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:14:06,350 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-01 22:14:06,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 22:14:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-01 22:14:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 22:14:06,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:14:06,350 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:14:06,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:14:06,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:14:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash -517174030, now seen corresponding path program 3 times [2018-12-01 22:14:06,351 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 22:14:06,351 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-01 22:14:06,354 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-01 22:14:07,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-01 22:14:07,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 22:14:07,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:14:14,550 WARN L180 SmtUtils]: Spent 4.83 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-01 22:14:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:14:14,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 22:14:16,868 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-12-01 22:14:19,068 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~x1~0)) (fp.eq c_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2018-12-01 22:14:21,484 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-01 22:14:23,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-01 22:14:26,498 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-01 22:14:29,114 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-01 22:14:31,889 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2018-12-01 22:14:34,689 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2018-12-01 22:14:37,684 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-01 22:14:40,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-01 22:14:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-12-01 22:14:40,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 22:14:40,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-12-01 22:14:40,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 22:14:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 22:14:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=109, Unknown=10, NotChecked=120, Total=272 [2018-12-01 22:14:40,695 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-12-01 22:14:43,686 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 .cse2))) (or (fp.eq c_main_~x~0 .cse2) (not (fp.eq c_main_~x1~0 c_main_~x~0))))) is different from true [2018-12-01 22:14:46,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)))))) is different from true [2018-12-01 22:14:49,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-12-01 22:14:51,571 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2018-12-01 22:15:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:15:00,055 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-12-01 22:15:00,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 22:15:00,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-12-01 22:15:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:15:00,056 INFO L225 Difference]: With dead ends: 26 [2018-12-01 22:15:00,056 INFO L226 Difference]: Without dead ends: 18 [2018-12-01 22:15:00,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.7s TimeCoverageRelationStatistics Valid=45, Invalid=133, Unknown=14, NotChecked=270, Total=462 [2018-12-01 22:15:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-01 22:15:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-01 22:15:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-01 22:15:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-01 22:15:00,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-01 22:15:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:15:00,060 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-01 22:15:00,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 22:15:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-01 22:15:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 22:15:00,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:15:00,060 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:15:00,061 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:15:00,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:15:00,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1945796014, now seen corresponding path program 4 times [2018-12-01 22:15:00,061 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 22:15:00,061 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-01 22:15:00,064 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 22:15:01,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 22:15:01,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 22:15:01,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:15:14,620 WARN L180 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-01 22:15:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:15:14,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 22:15:40,998 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification that was a NOOP. DAG size: 7 [2018-12-01 22:15:43,422 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:15:48,322 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:15:50,956 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:15:53,792 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:15:56,629 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:15:59,675 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:16:02,749 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:16:06,003 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:16:09,272 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:16:12,668 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:16:16,130 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:16:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2018-12-01 22:16:16,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 22:16:16,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-12-01 22:16:16,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 22:16:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 22:16:16,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=95, Unknown=19, NotChecked=150, Total=306 [2018-12-01 22:16:16,179 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-01 22:16:19,640 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))) (not (fp.eq c_main_~x1~0 c_main_~x~0)))) is different from true [2018-12-01 22:16:22,898 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1)) (not (fp.eq c_main_~x1~0 c_main_~x~0)))) is different from true [2018-12-01 22:16:25,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-12-01 22:16:28,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-12-01 22:16:31,467 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-12-01 22:16:33,891 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-12-01 22:16:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:16:43,385 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-01 22:16:43,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 22:16:43,805 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-01 22:16:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:16:43,806 INFO L225 Difference]: With dead ends: 25 [2018-12-01 22:16:43,806 INFO L226 Difference]: Without dead ends: 20 [2018-12-01 22:16:43,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.0s TimeCoverageRelationStatistics Valid=54, Invalid=101, Unknown=25, NotChecked=372, Total=552 [2018-12-01 22:16:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-01 22:16:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-01 22:16:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 22:16:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-01 22:16:43,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-01 22:16:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:16:43,812 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-01 22:16:43,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 22:16:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-01 22:16:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 22:16:43,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:16:43,813 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:16:43,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:16:43,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:16:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash -461987918, now seen corresponding path program 5 times [2018-12-01 22:16:43,813 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-01 22:16:43,813 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec1d3f37-fb2f-446a-8e64-dfa12f3e8752/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-01 22:16:43,817 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-01 22:16:47,324 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-01 22:16:47,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 22:16:47,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:16:53,839 WARN L180 SmtUtils]: Spent 4.70 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-01 22:16:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:16:53,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 22:17:19,799 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 7 [2018-12-01 22:17:22,216 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:17:24,636 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:17:27,279 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:17:29,911 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:17:32,749 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-12-01 22:17:35,617 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-12-01 22:17:37,185 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-01 22:17:37,386 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2018-12-01 22:17:37,387 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-01 22:17:37,392 INFO L168 Benchmark]: Toolchain (without parser) took 281748.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 902.5 MB in the end (delta: 42.3 MB). Peak memory consumption was 173.3 MB. Max. memory is 11.5 GB. [2018-12-01 22:17:37,394 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:17:37,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 121.23 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:17:37,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.12 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:17:37,396 INFO L168 Benchmark]: Boogie Preprocessor took 15.03 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:17:37,396 INFO L168 Benchmark]: RCFGBuilder took 846.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-01 22:17:37,397 INFO L168 Benchmark]: TraceAbstraction took 280749.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.5 MB in the end (delta: 192.3 MB). Peak memory consumption was 192.3 MB. Max. memory is 11.5 GB. [2018-12-01 22:17:37,399 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 121.23 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.12 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.03 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 846.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 280749.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.5 MB in the end (delta: 192.3 MB). Peak memory consumption was 192.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...