./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/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 14660901cc5c4d61dda44d0e62586d716b569100 ........................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/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 14660901cc5c4d61dda44d0e62586d716b569100 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-aa41828 [2018-11-23 08:52:38,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:52:38,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:52:38,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:52:38,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:52:38,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:52:38,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:52:38,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:52:38,138 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:52:38,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:52:38,139 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:52:38,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:52:38,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:52:38,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:52:38,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:52:38,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:52:38,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:52:38,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:52:38,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:52:38,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:52:38,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:52:38,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:52:38,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:52:38,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:52:38,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:52:38,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:52:38,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:52:38,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:52:38,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:52:38,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:52:38,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:52:38,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:52:38,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:52:38,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:52:38,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:52:38,156 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:52:38,157 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:52:38,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:52:38,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:52:38,167 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:52:38,167 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:52:38,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:52:38,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:52:38,168 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:52:38,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:52:38,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:52:38,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:52:38,169 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:52:38,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:52:38,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:52:38,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:52:38,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:52:38,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:52:38,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:52:38,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:52:38,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:52:38,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:52:38,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:52:38,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:52:38,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:52:38,171 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_7aa7f764-966d-4612-97ef-81cba92949b7/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 -> 14660901cc5c4d61dda44d0e62586d716b569100 [2018-11-23 08:52:38,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:52:38,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:52:38,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:52:38,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:52:38,206 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:52:38,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 08:52:38,246 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/3b1a67826/eed248c7ed184cd9b72726cf515bff03/FLAGef0cc9eb5 [2018-11-23 08:52:38,611 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:52:38,612 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 08:52:38,616 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/3b1a67826/eed248c7ed184cd9b72726cf515bff03/FLAGef0cc9eb5 [2018-11-23 08:52:38,627 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/3b1a67826/eed248c7ed184cd9b72726cf515bff03 [2018-11-23 08:52:38,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:52:38,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:52:38,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:52:38,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:52:38,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:52:38,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5fba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38, skipping insertion in model container [2018-11-23 08:52:38,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:52:38,659 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:52:38,793 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:52:38,797 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:52:38,808 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:52:38,822 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:52:38,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38 WrapperNode [2018-11-23 08:52:38,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:52:38,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:52:38,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:52:38,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:52:38,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:52:38,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:52:38,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:52:38,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:52:38,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... [2018-11-23 08:52:38,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:52:38,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:52:38,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:52:38,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:52:38,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:52:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:52:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:52:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:52:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:52:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:52:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:52:39,065 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:52:39,065 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 08:52:39,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:39 BoogieIcfgContainer [2018-11-23 08:52:39,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:52:39,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:52:39,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:52:39,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:52:39,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:38" (1/3) ... [2018-11-23 08:52:39,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f0d699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:39, skipping insertion in model container [2018-11-23 08:52:39,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:38" (2/3) ... [2018-11-23 08:52:39,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f0d699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:39, skipping insertion in model container [2018-11-23 08:52:39,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:39" (3/3) ... [2018-11-23 08:52:39,073 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 08:52:39,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:52:39,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:52:39,103 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:52:39,135 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:52:39,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:52:39,136 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:52:39,136 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:52:39,136 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:52:39,136 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:52:39,136 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:52:39,136 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:52:39,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:52:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-23 08:52:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 08:52:39,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:52:39,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:52:39,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:52:39,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:52:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-23 08:52:39,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:52:39,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:52:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:52:39,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:52:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:52:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:52:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:52:39,272 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~__return_main~0)|=2, ~__return_main~0=2] [?] ~__return_main~0 := 0; VAL [|old(~__return_main~0)|=2, ~__return_main~0=0] [?] assume true; VAL [|old(~__return_main~0)|=2, ~__return_main~0=0] [?] RET #20#return; VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [?] ~main__x~0 := 1.0;~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.6); VAL [main_~main__x~0=1.0, ~__return_main~0=0] [?] assume !~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] assume 0 == ~__VERIFIER_assert__cond~0; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] assume !false; VAL [main_~__tmp_1~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main__x~0=1.0, ~__return_main~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] ensures true; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.6); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10-L33] assume !~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23-L31] assume 0 == ~__VERIFIER_assert__cond~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] ensures true; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.6); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10-L33] assume !~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23-L31] assume 0 == ~__VERIFIER_assert__cond~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.6); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.6); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.6); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_main~0)=2, ~__return_main~0=2] [L1] ~__return_main~0 := 0; VAL [old(~__return_main~0)=2, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [~__return_main~0=0] [?] CALL call #t~ret0 := main(); VAL [~__return_main~0=0] [L7] ~main__x~0 := 1.0; [L8] ~main__x1~0 := ~someBinaryArithmeticDOUBLEoperation(~main__x~0, 1.6); VAL [~__return_main~0=0, ~main__x~0=1.0] [L10] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__x1~0, ~main__x~0)) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := (if ~someBinaryDOUBLEComparisonOperation(~main__x~0, ~convertINTToDOUBLE(0)) then 1 else 0); [L21] havoc ~__VERIFIER_assert__cond~0; [L22] ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L23] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L25] assert false; VAL [~__return_main~0=0, ~__tmp_1~0=0, ~__VERIFIER_assert__cond~0=0, ~main__x~0=1.0] [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] double main__x = 1.0; [L8] double main__x1 = main__x / 1.6; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] ----- [2018-11-23 08:52:39,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:52:39 BoogieIcfgContainer [2018-11-23 08:52:39,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:52:39,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:52:39,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:52:39,310 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:52:39,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:39" (3/4) ... [2018-11-23 08:52:39,314 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:52:39,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:52:39,314 INFO L168 Benchmark]: Toolchain (without parser) took 684.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:52:39,316 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:52:39,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.15 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:52:39,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.43 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:52:39,318 INFO L168 Benchmark]: Boogie Preprocessor took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:52:39,319 INFO L168 Benchmark]: RCFGBuilder took 209.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:52:39,320 INFO L168 Benchmark]: TraceAbstraction took 242.29 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: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:52:39,320 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:52:39,323 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.15 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.43 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 209.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 242.29 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: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.45 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: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] double main__x = 1.0; [L8] double main__x1 = main__x / 1.6; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 08:52:40,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:52:40,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:52:40,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:52:40,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:52:40,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:52:40,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:52:40,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:52:40,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:52:40,920 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:52:40,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:52:40,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:52:40,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:52:40,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:52:40,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:52:40,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:52:40,925 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:52:40,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:52:40,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:52:40,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:52:40,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:52:40,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:52:40,933 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:52:40,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:52:40,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:52:40,934 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:52:40,935 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:52:40,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:52:40,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:52:40,937 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:52:40,937 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:52:40,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:52:40,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:52:40,938 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:52:40,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:52:40,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:52:40,940 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 08:52:40,950 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:52:40,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:52:40,951 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:52:40,951 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:52:40,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:52:40,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:52:40,952 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:52:40,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:52:40,952 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:52:40,952 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:52:40,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:52:40,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:52:40,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:52:40,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:52:40,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:52:40,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:52:40,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:52:40,954 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:52:40,954 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:52:40,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:52:40,955 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 08:52:40,955 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:52:40,955 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:52:40,955 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:52:40,955 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_7aa7f764-966d-4612-97ef-81cba92949b7/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 -> 14660901cc5c4d61dda44d0e62586d716b569100 [2018-11-23 08:52:40,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:52:40,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:52:40,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:52:40,995 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:52:40,995 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:52:40,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 08:52:41,032 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/6484655e9/e2fdd548a53c46eead1db3cfccbfbd42/FLAG02930d87b [2018-11-23 08:52:41,436 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:52:41,436 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 08:52:41,440 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/6484655e9/e2fdd548a53c46eead1db3cfccbfbd42/FLAG02930d87b [2018-11-23 08:52:41,449 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/data/6484655e9/e2fdd548a53c46eead1db3cfccbfbd42 [2018-11-23 08:52:41,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:52:41,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:52:41,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:52:41,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:52:41,455 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:52:41,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@232702b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41, skipping insertion in model container [2018-11-23 08:52:41,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:52:41,479 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:52:41,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:52:41,622 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:52:41,634 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:52:41,647 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:52:41,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41 WrapperNode [2018-11-23 08:52:41,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:52:41,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:52:41,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:52:41,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:52:41,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:52:41,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:52:41,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:52:41,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:52:41,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... [2018-11-23 08:52:41,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:52:41,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:52:41,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:52:41,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:52:41,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:52:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:52:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:52:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:52:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:52:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:52:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:52:42,703 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:52:42,704 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 08:52:42,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:42 BoogieIcfgContainer [2018-11-23 08:52:42,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:52:42,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:52:42,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:52:42,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:52:42,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:41" (1/3) ... [2018-11-23 08:52:42,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e75d5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:42, skipping insertion in model container [2018-11-23 08:52:42,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:41" (2/3) ... [2018-11-23 08:52:42,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e75d5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:42, skipping insertion in model container [2018-11-23 08:52:42,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:42" (3/3) ... [2018-11-23 08:52:42,711 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2018-11-23 08:52:42,722 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:52:42,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:52:42,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:52:42,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:52:42,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:52:42,767 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:52:42,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:52:42,768 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:52:42,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:52:42,768 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:52:42,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:52:42,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:52:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-11-23 08:52:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 08:52:42,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:52:42,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:52:42,794 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:52:42,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:52:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-11-23 08:52:42,801 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:52:42,802 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 08:52:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:52:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:52:43,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:52:46,051 WARN L180 SmtUtils]: Spent 2.90 s on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 08:52:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:52:46,059 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 08:52:46,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:52:46,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:52:46,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:52:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:52:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:52:46,085 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-11-23 08:52:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:52:48,861 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 08:52:49,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:52:49,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 08:52:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:52:49,142 INFO L225 Difference]: With dead ends: 22 [2018-11-23 08:52:49,142 INFO L226 Difference]: Without dead ends: 11 [2018-11-23 08:52:49,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:52:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-11-23 08:52:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 08:52:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 08:52:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 08:52:49,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-11-23 08:52:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:52:49,174 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-11-23 08:52:49,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:52:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 08:52:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 08:52:49,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:52:49,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:52:49,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:52:49,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:52:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-11-23 08:52:49,177 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:52:49,177 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 08:52:49,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:52:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:52:49,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:52:54,619 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 08:52:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:52:54,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:53:08,043 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 7 [2018-11-23 08:53:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:53:08,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:53:08,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 08:53:08,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:53:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:53:08,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=15, Unknown=3, NotChecked=0, Total=30 [2018-11-23 08:53:08,069 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-11-23 08:53:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:53:22,350 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 08:53:22,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:53:22,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 08:53:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:53:22,596 INFO L225 Difference]: With dead ends: 16 [2018-11-23 08:53:22,596 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 08:53:22,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=17, Invalid=21, Unknown=4, NotChecked=0, Total=42 [2018-11-23 08:53:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 08:53:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 08:53:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 08:53:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 08:53:22,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-23 08:53:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:53:22,601 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 08:53:22,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:53:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 08:53:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 08:53:22,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:53:22,602 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:53:22,602 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:53:22,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:53:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 2 times [2018-11-23 08:53:22,603 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:53:22,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/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-11-23 08:53:22,607 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 08:53:23,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:53:23,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:53:23,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:53:25,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_main_~main__x~0 .cse0) c_main_~main__x1~0) (= c_main_~main__x~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)))) is different from true [2018-11-23 08:53:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-23 08:53:25,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:53:28,282 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~main__x1~0))) is different from false [2018-11-23 08:53:32,149 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_~main__x1~0 .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-11-23 08:53:34,592 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_~main__x1~0 .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-11-23 08:53:37,221 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_~main__x1~0 .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-11-23 08:53:39,957 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_~main__x1~0 .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-11-23 08:53:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-23 08:53:39,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:53:39,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-23 08:53:39,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 08:53:39,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 08:53:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=33, Unknown=6, NotChecked=52, Total=110 [2018-11-23 08:53:39,992 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-11-23 08:53:42,691 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 (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) c_main_~main__x1~0) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse0) .cse0))) (or (fp.eq .cse1 .cse2) (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)))) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse2)))) is different from true [2018-11-23 08:53:45,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_main_~main__x1~0))) is different from true [2018-11-23 08:53:47,436 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (or (fp.eq c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse0) c_main_~main__x1~0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) c_main_~main__x1~0))) is different from true [2018-11-23 08:53:49,696 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_main_~main__x~0 .cse0) c_main_~main__x1~0) (= c_main_~main__x~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0)) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 08:53:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:53:52,793 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 08:53:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:53:52,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-11-23 08:53:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:53:52,794 INFO L225 Difference]: With dead ends: 17 [2018-11-23 08:53:52,794 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 08:53:52,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=27, Invalid=37, Unknown=10, NotChecked=136, Total=210 [2018-11-23 08:53:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 08:53:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 08:53:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 08:53:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 08:53:52,798 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 08:53:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:53:52,799 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 08:53:52,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 08:53:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 08:53:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:53:52,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:53:52,799 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:53:52,799 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:53:52,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:53:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 3 times [2018-11-23 08:53:52,800 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:53:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/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-11-23 08:53:52,807 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 08:53:54,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 08:53:54,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:53:54,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:54:06,497 WARN L180 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 08:54:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:54:06,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:54:12,678 WARN L832 $PredicateComparison]: unable to prove that (or (fp.eq c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~main__x1~0))) is different from false [2018-11-23 08:54:16,923 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_~main__x1~0 .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-11-23 08:54:19,440 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_~main__x1~0 .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-11-23 08:54:22,155 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_~main__x1~0 .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-11-23 08:54:24,802 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_~main__x1~0 .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-11-23 08:54:27,777 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_~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-11-23 08:54:30,754 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_~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-11-23 08:54:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-11-23 08:54:30,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:54:30,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-23 08:54:30,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 08:54:30,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 08:54:30,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=53, Unknown=11, NotChecked=68, Total=156 [2018-11-23 08:54:30,791 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-11-23 08:54:33,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse2) .cse2) .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse2) .cse0)))) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2) c_main_~main__x1~0) (or (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (fp.eq c_main_~main__x~0 .cse1)))) is different from true [2018-11-23 08:54:36,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_main_~main__x1~0))) is different from true [2018-11-23 08:54:38,977 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) c_main_~main__x1~0))) is different from true [2018-11-23 08:54:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:54:46,382 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 08:54:46,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:54:46,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 08:54:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:54:46,383 INFO L225 Difference]: With dead ends: 20 [2018-11-23 08:54:46,383 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 08:54:46,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=34, Invalid=70, Unknown=14, NotChecked=154, Total=272 [2018-11-23 08:54:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 08:54:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 08:54:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 08:54:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 08:54:46,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-23 08:54:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:54:46,388 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 08:54:46,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 08:54:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 08:54:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 08:54:46,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:54:46,388 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:54:46,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:54:46,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:54:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 4 times [2018-11-23 08:54:46,389 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:54:46,390 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/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-11-23 08:54:46,393 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:54:48,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:54:48,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:54:48,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:54:55,380 WARN L180 SmtUtils]: Spent 4.91 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 08:54:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:54:55,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:54:57,702 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~main__x1~0)) is different from false [2018-11-23 08:55:00,880 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_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:55:03,344 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_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:55:06,114 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_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:55:08,872 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_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:55:11,850 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_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:55:14,752 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_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:55:17,892 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_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:55:21,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 c_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:55:24,660 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_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:55:28,072 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_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:55:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-11-23 08:55:28,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:55:28,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 08:55:28,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 08:55:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 08:55:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=73, Unknown=11, NotChecked=126, Total=240 [2018-11-23 08:55:28,123 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-11-23 08:55:31,732 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) c_main_~main__x1~0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-11-23 08:55:35,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) c_main_~main__x1~0) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-11-23 08:55:38,314 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 c_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) c_main_~main__x1~0))) is different from true [2018-11-23 08:55:41,119 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_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_main_~main__x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2018-11-23 08:55:43,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) c_main_~main__x1~0) (not (let ((.cse1 (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2018-11-23 08:55:45,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 .cse0) c_main_~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) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) c_main_~main__x1~0))) is different from true [2018-11-23 08:55:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:55:48,974 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 08:55:48,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 08:55:48,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-11-23 08:55:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:55:48,976 INFO L225 Difference]: With dead ends: 21 [2018-11-23 08:55:48,976 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 08:55:48,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=42, Invalid=79, Unknown=17, NotChecked=324, Total=462 [2018-11-23 08:55:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 08:55:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 08:55:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 08:55:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 08:55:48,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 08:55:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:55:48,981 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 08:55:48,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 08:55:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 08:55:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 08:55:48,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:55:48,982 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:55:48,982 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:55:48,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:55:48,982 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 5 times [2018-11-23 08:55:48,983 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:55:48,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7aa7f764-966d-4612-97ef-81cba92949b7/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-11-23 08:55:48,986 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 08:55:52,202 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 08:55:52,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:55:52,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:56:13,639 WARN L180 SmtUtils]: Spent 3.73 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 08:56:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:56:13,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:56:17,982 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_main_~main__x1~0)) is different from false [2018-11-23 08:56:21,171 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_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:56:23,750 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_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:56:26,557 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_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:56:29,231 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_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:56:32,335 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_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:56:35,424 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_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:56:38,632 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_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:56:41,919 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_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:56:45,606 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_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2018-11-23 08:56:49,279 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_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2018-11-23 08:56:51,932 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 08:56:52,133 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2018-11-23 08:56:52,134 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-11-23 08:56:52,137 INFO L168 Benchmark]: Toolchain (without parser) took 250686.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 950.8 MB in the beginning and 979.7 MB in the end (delta: -28.9 MB). Peak memory consumption was 137.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:56:52,138 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:56:52,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.66 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:56:52,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.46 ms. Allocated memory is still 1.0 GB. Free memory was 940.1 MB in the beginning and 934.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:56:52,140 INFO L168 Benchmark]: Boogie Preprocessor took 19.57 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:56:52,141 INFO L168 Benchmark]: RCFGBuilder took 1016.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -209.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:56:52,141 INFO L168 Benchmark]: TraceAbstraction took 249431.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.7 MB in the end (delta: 157.5 MB). Peak memory consumption was 157.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:56:52,145 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 195.66 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.46 ms. Allocated memory is still 1.0 GB. Free memory was 940.1 MB in the beginning and 934.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.57 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1016.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -209.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 249431.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.7 MB in the end (delta: 157.5 MB). Peak memory consumption was 157.5 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...