./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-12 08:48:12,672 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:48:12,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:48:12,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:48:12,686 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:48:12,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:48:12,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:48:12,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:48:12,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:48:12,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:48:12,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:48:12,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:48:12,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:48:12,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:48:12,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:48:12,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:48:12,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:48:12,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:48:12,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:48:12,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:48:12,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:48:12,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:48:12,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:48:12,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:48:12,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:48:12,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:48:12,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:48:12,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:48:12,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:48:12,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:48:12,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:48:12,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:48:12,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:48:12,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:48:12,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:48:12,724 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:48:12,725 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 08:48:12,748 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:48:12,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:48:12,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:48:12,750 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:48:12,750 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:48:12,750 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:48:12,752 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:48:12,752 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 08:48:12,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:48:12,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:48:12,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:48:12,754 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:48:12,754 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:48:12,754 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:48:12,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:48:12,754 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:48:12,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:48:12,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:48:12,755 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:48:12,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:48:12,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:48:12,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:48:12,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:48:12,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:48:12,759 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:48:12,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 08:48:12,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:48:12,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 08:48:12,760 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-12 08:48:12,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:48:12,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:48:12,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:48:12,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:48:12,858 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:48:12,859 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:48:12,913 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec588267b/2d50e84de43d4cfca60821b120140fc5/FLAGfbf9d63ac [2019-01-12 08:48:13,369 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:48:13,373 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:48:13,380 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec588267b/2d50e84de43d4cfca60821b120140fc5/FLAGfbf9d63ac [2019-01-12 08:48:13,887 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec588267b/2d50e84de43d4cfca60821b120140fc5 [2019-01-12 08:48:13,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:48:13,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:48:13,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:48:13,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:48:13,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:48:13,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:48:13" (1/1) ... [2019-01-12 08:48:13,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f344041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:13, skipping insertion in model container [2019-01-12 08:48:13,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:48:13" (1/1) ... [2019-01-12 08:48:13,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:48:13,934 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:48:14,185 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:48:14,194 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:48:14,217 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:48:14,237 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:48:14,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14 WrapperNode [2019-01-12 08:48:14,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:48:14,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:48:14,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:48:14,241 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:48:14,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:48:14,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:48:14,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:48:14,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:48:14,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... [2019-01-12 08:48:14,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:48:14,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:48:14,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:48:14,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:48:14,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:48:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:48:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:48:14,601 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:48:14,601 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:48:14,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:48:14 BoogieIcfgContainer [2019-01-12 08:48:14,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:48:14,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:48:14,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:48:14,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:48:14,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:48:13" (1/3) ... [2019-01-12 08:48:14,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a84873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:48:14, skipping insertion in model container [2019-01-12 08:48:14,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:14" (2/3) ... [2019-01-12 08:48:14,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a84873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:48:14, skipping insertion in model container [2019-01-12 08:48:14,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:48:14" (3/3) ... [2019-01-12 08:48:14,612 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:48:14,620 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:48:14,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:48:14,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:48:14,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:48:14,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:48:14,685 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:48:14,685 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:48:14,686 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:48:14,686 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:48:14,686 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:48:14,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:48:14,686 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:48:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-12 08:48:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 08:48:14,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:48:14,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 08:48:14,709 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:48:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:48:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2019-01-12 08:48:14,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:48:14,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:48:14,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:48:14,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:48:14,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:48:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:48:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:48:14,832 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 08:48:14,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:48:14 BoogieIcfgContainer [2019-01-12 08:48:14,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:48:14,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:48:14,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:48:14,857 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:48:14,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:48:14" (3/4) ... [2019-01-12 08:48:14,861 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 08:48:14,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:48:14,862 INFO L168 Benchmark]: Toolchain (without parser) took 970.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:48:14,865 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:48:14,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:48:14,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:48:14,867 INFO L168 Benchmark]: Boogie Preprocessor took 25.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:48:14,868 INFO L168 Benchmark]: RCFGBuilder took 289.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-12 08:48:14,869 INFO L168 Benchmark]: TraceAbstraction took 252.97 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:48:14,871 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:48:14,877 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 289.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 252.97 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 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 [__return_main=0] [L7] double main__x = 1.0; [L8] double main__x1 = main__x / 1.6; VAL [__return_main=0] [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] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L25] __VERIFIER_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 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=9occurred 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, 5 NumberOfCodeBlocks, 5 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.24-0ed9222-m [2019-01-12 08:48:17,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:48:17,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:48:17,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:48:17,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:48:17,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:48:17,301 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:48:17,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:48:17,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:48:17,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:48:17,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:48:17,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:48:17,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:48:17,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:48:17,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:48:17,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:48:17,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:48:17,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:48:17,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:48:17,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:48:17,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:48:17,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:48:17,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:48:17,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:48:17,339 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:48:17,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:48:17,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:48:17,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:48:17,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:48:17,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:48:17,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:48:17,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:48:17,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:48:17,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:48:17,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:48:17,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:48:17,347 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 08:48:17,373 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:48:17,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:48:17,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:48:17,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:48:17,378 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:48:17,378 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:48:17,378 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:48:17,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:48:17,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:48:17,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:48:17,379 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:48:17,379 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:48:17,379 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 08:48:17,379 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 08:48:17,379 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:48:17,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:48:17,382 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:48:17,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:48:17,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:48:17,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:48:17,384 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:48:17,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:48:17,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:48:17,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:48:17,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:48:17,385 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:48:17,385 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 08:48:17,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:48:17,385 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 08:48:17,385 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 08:48:17,386 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-12 08:48:17,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:48:17,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:48:17,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:48:17,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:48:17,484 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:48:17,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:48:17,541 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260182337/e3b01a0406444aa9a55fb2929d8d53a2/FLAGb81b48774 [2019-01-12 08:48:17,997 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:48:17,998 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:48:18,003 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260182337/e3b01a0406444aa9a55fb2929d8d53a2/FLAGb81b48774 [2019-01-12 08:48:18,381 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/260182337/e3b01a0406444aa9a55fb2929d8d53a2 [2019-01-12 08:48:18,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:48:18,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:48:18,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:48:18,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:48:18,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:48:18,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18, skipping insertion in model container [2019-01-12 08:48:18,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:48:18,425 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:48:18,599 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:48:18,610 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:48:18,628 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:48:18,646 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:48:18,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18 WrapperNode [2019-01-12 08:48:18,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:48:18,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:48:18,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:48:18,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:48:18,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:48:18,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:48:18,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:48:18,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:48:18,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... [2019-01-12 08:48:18,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:48:18,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:48:18,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:48:18,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:48:18,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:48:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:48:18,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:48:20,043 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:48:20,043 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:48:20,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:48:20 BoogieIcfgContainer [2019-01-12 08:48:20,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:48:20,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:48:20,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:48:20,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:48:20,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:48:18" (1/3) ... [2019-01-12 08:48:20,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741612f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:48:20, skipping insertion in model container [2019-01-12 08:48:20,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:48:18" (2/3) ... [2019-01-12 08:48:20,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741612f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:48:20, skipping insertion in model container [2019-01-12 08:48:20,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:48:20" (3/3) ... [2019-01-12 08:48:20,053 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:48:20,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:48:20,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:48:20,083 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:48:20,110 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:48:20,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:48:20,111 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:48:20,111 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:48:20,112 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:48:20,112 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:48:20,112 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:48:20,112 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:48:20,112 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:48:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-12 08:48:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 08:48:20,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:48:20,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 08:48:20,136 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:48:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:48:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2019-01-12 08:48:20,147 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:48:20,148 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 08:48:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:48:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:48:20,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:48:23,815 WARN L181 SmtUtils]: Spent 3.22 s on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 08:48:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:48:23,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:48:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:48:23,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 08:48:23,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 08:48:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 08:48:23,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 08:48:23,867 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-12 08:48:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:48:26,733 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-01-12 08:48:27,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 08:48:27,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-12 08:48:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:48:27,026 INFO L225 Difference]: With dead ends: 16 [2019-01-12 08:48:27,026 INFO L226 Difference]: Without dead ends: 7 [2019-01-12 08:48:27,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 08:48:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-12 08:48:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-12 08:48:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-12 08:48:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-12 08:48:27,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-12 08:48:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:48:27,058 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-12 08:48:27,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 08:48:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-12 08:48:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 08:48:27,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:48:27,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 08:48:27,059 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:48:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:48:27,060 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2019-01-12 08:48:27,060 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:48:27,060 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 08:48:27,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:48:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:48:27,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:48:33,247 WARN L181 SmtUtils]: Spent 3.34 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 08:48:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:48:33,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:48:37,830 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2019-01-12 08:48:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-01-12 08:48:38,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:48:38,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-12 08:48:38,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 08:48:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 08:48:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=11, Unknown=3, NotChecked=6, Total=30 [2019-01-12 08:48:38,612 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-12 08:48:40,914 WARN L860 $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_ULTIMATE.start_main_~main__x1~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)))) is different from true [2019-01-12 08:48:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:48:47,794 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-12 08:48:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:48:47,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-12 08:48:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:48:47,796 INFO L225 Difference]: With dead ends: 12 [2019-01-12 08:48:47,796 INFO L226 Difference]: Without dead ends: 9 [2019-01-12 08:48:47,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=12, Invalid=12, Unknown=4, NotChecked=14, Total=42 [2019-01-12 08:48:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-12 08:48:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-12 08:48:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-12 08:48:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-12 08:48:47,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-01-12 08:48:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:48:47,802 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-12 08:48:47,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 08:48:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-12 08:48:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 08:48:47,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:48:47,803 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-01-12 08:48:47,803 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:48:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:48:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 2 times [2019-01-12 08:48:47,806 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:48:47,806 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 08:48:47,815 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 08:48:48,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 08:48:48,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:48:49,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:48:51,302 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~main__x~0))) is different from true [2019-01-12 08:48:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-01-12 08:48:51,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:48:53,779 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2019-01-12 08:48:58,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-01-12 08:49:00,764 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-01-12 08:49:03,546 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-01-12 08:49:06,320 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-01-12 08:49:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-01-12 08:49:06,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:49:06,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-01-12 08:49:06,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 08:49:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 08:49:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=33, Unknown=6, NotChecked=52, Total=110 [2019-01-12 08:49:06,364 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 11 states. [2019-01-12 08:49:09,205 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2))) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse2) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:49:11,758 WARN L860 $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_ULTIMATE.start_main_~main__x1~0) (let ((.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) is different from true [2019-01-12 08:49:22,772 WARN L181 SmtUtils]: Spent 8.40 s on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-12 08:49:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:49:30,853 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-12 08:49:30,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 08:49:30,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-12 08:49:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:49:30,854 INFO L225 Difference]: With dead ends: 15 [2019-01-12 08:49:30,855 INFO L226 Difference]: Without dead ends: 11 [2019-01-12 08:49:30,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=30, Invalid=58, Unknown=8, NotChecked=114, Total=210 [2019-01-12 08:49:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-12 08:49:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-12 08:49:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-12 08:49:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-12 08:49:30,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-12 08:49:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:49:30,861 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-12 08:49:30,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 08:49:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-12 08:49:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 08:49:30,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:49:30,862 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-01-12 08:49:30,862 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:49:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:49:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 3 times [2019-01-12 08:49:30,863 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:49:30,863 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 08:49:30,870 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-12 08:49:32,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 08:49:32,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:49:32,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:49:47,371 WARN L181 SmtUtils]: Spent 3.03 s on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 08:49:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:49:47,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:49:54,240 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2019-01-12 08:49:56,503 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:49:59,038 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-01-12 08:50:01,575 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-01-12 08:50:04,396 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-01-12 08:50:07,200 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-01-12 08:50:10,223 WARN L838 $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_ULTIMATE.start_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 [2019-01-12 08:50:13,238 WARN L860 $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_ULTIMATE.start_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 [2019-01-12 08:50:16,553 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-01-12 08:50:19,844 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-01-12 08:50:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2019-01-12 08:50:19,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:50:19,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-01-12 08:50:19,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 08:50:19,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 08:50:19,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=17, NotChecked=100, Total=210 [2019-01-12 08:50:19,891 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 15 states. [2019-01-12 08:50:23,240 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse0) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) c_ULTIMATE.start_main_~main__x1~0) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2019-01-12 08:50:26,313 WARN L860 $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 (fp.div roundNearestTiesToEven c_ULTIMATE.start_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)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:50:29,116 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:50:31,640 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (= c_ULTIMATE.start_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 [2019-01-12 08:50:33,914 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0))))) is different from true [2019-01-12 08:50:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:50:40,847 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-12 08:50:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 08:50:40,848 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2019-01-12 08:50:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:50:40,849 INFO L225 Difference]: With dead ends: 17 [2019-01-12 08:50:40,850 INFO L226 Difference]: Without dead ends: 13 [2019-01-12 08:50:40,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=42, Invalid=85, Unknown=23, NotChecked=270, Total=420 [2019-01-12 08:50:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-12 08:50:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-12 08:50:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-12 08:50:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-12 08:50:40,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-01-12 08:50:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:50:40,857 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-12 08:50:40,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 08:50:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-12 08:50:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 08:50:40,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:50:40,858 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-01-12 08:50:40,858 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:50:40,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:50:40,859 INFO L82 PathProgramCache]: Analyzing trace with hash 48273382, now seen corresponding path program 4 times [2019-01-12 08:50:40,859 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:50:40,860 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 08:50:40,867 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 08:50:43,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 08:50:43,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:50:43,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:50:59,620 WARN L181 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 08:50:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:50:59,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:51:03,679 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2019-01-12 08:51:06,935 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:09,465 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:12,251 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:15,048 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:18,147 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:21,227 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:24,597 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:27,943 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:31,916 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:35,795 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:40,387 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:44,784 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2019-01-12 08:51:44,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:51:44,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-12 08:51:44,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 08:51:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 08:51:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=88, Unknown=16, NotChecked=168, Total=306 [2019-01-12 08:51:44,850 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 18 states. [2019-01-12 08:51:49,249 WARN L860 $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_ULTIMATE.start_main_~main__x1~0) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-01-12 08:51:53,030 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:51:56,390 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) .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_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:51:59,473 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= c_ULTIMATE.start_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 [2019-01-12 08:52:02,261 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-01-12 08:52:04,795 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:52:07,061 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven (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) .cse0)) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)))) is different from true [2019-01-12 08:52:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:52:15,848 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-12 08:52:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 08:52:15,849 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 12 [2019-01-12 08:52:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:52:15,850 INFO L225 Difference]: With dead ends: 18 [2019-01-12 08:52:15,850 INFO L226 Difference]: Without dead ends: 15 [2019-01-12 08:52:15,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.7s TimeCoverageRelationStatistics Valid=48, Invalid=95, Unknown=23, NotChecked=434, Total=600 [2019-01-12 08:52:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-12 08:52:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-12 08:52:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-12 08:52:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-12 08:52:15,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-01-12 08:52:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:52:15,859 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-12 08:52:15,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 08:52:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-12 08:52:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 08:52:15,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:52:15,860 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-01-12 08:52:15,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:52:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:52:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash -855919642, now seen corresponding path program 5 times [2019-01-12 08:52:15,861 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:52:15,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 08:52:15,867 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2019-01-12 08:52:19,660 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 08:52:19,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:52:19,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:52:22,332 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__x1~0) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (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) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~main__x~0))) is different from true [2019-01-12 08:52:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2019-01-12 08:52:22,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:52:24,645 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2019-01-12 08:52:27,925 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:52:30,442 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:52:33,228 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:52:36,009 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:52:39,059 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:52:42,120 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:52:45,454 WARN L838 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:52:48,830 WARN L860 $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_ULTIMATE.start_main_~main__x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:52:50,976 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-12 08:52:51,177 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-01-12 08:52:51,179 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:829) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) 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 [2019-01-12 08:52:51,184 INFO L168 Benchmark]: Toolchain (without parser) took 272798.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.3 MB in the beginning and 943.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 128.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:51,185 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:52:51,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:51,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.40 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:52:51,187 INFO L168 Benchmark]: Boogie Preprocessor took 27.38 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:51,188 INFO L168 Benchmark]: RCFGBuilder took 1328.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:51,189 INFO L168 Benchmark]: TraceAbstraction took 271137.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.4 MB in the end (delta: 157.0 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:51,201 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.40 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.38 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1328.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 271137.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.4 MB in the end (delta: 157.0 MB). Peak memory consumption was 157.0 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...