./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_true-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_true-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 1bbff5832e71471655f4416229b3fdd1dac2e479 ............................................................................................................................................................................................................................... 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_true-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 1bbff5832e71471655f4416229b3fdd1dac2e479 .................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:47:28,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:47:28,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:47:28,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:47:28,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:47:28,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:47:28,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:47:28,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:47:28,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:47:28,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:47:28,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:47:28,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:47:28,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:47:28,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:47:28,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:47:28,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:47:28,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:47:28,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:47:28,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:47:28,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:47:28,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:47:28,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:47:28,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:47:28,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:47:28,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:47:28,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:47:28,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:47:28,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:47:28,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:47:28,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:47:28,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:47:28,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:47:28,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:47:28,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:47:28,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:47:28,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:47:28,432 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:47:28,447 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:47:28,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:47:28,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:47:28,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:47:28,449 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:47:28,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:47:28,450 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:47:28,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 08:47:28,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:47:28,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:47:28,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:47:28,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:47:28,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:47:28,451 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:47:28,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:47:28,451 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:47:28,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:47:28,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:47:28,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:47:28,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:47:28,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:47:28,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:47:28,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:47:28,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:47:28,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:47:28,454 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 08:47:28,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:47:28,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 08:47:28,456 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 -> 1bbff5832e71471655f4416229b3fdd1dac2e479 [2019-01-12 08:47:28,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:47:28,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:47:28,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:47:28,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:47:28,519 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:47:28,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:47:28,573 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bb455dc/422bb7e7448c4f179a42a14a025f337c/FLAG366ceefbd [2019-01-12 08:47:28,990 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:47:28,990 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:47:28,996 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bb455dc/422bb7e7448c4f179a42a14a025f337c/FLAG366ceefbd [2019-01-12 08:47:29,364 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9bb455dc/422bb7e7448c4f179a42a14a025f337c [2019-01-12 08:47:29,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:47:29,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:47:29,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:47:29,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:47:29,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:47:29,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5502f5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29, skipping insertion in model container [2019-01-12 08:47:29,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:47:29,403 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:47:29,624 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:47:29,631 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:47:29,651 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:47:29,668 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:47:29,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29 WrapperNode [2019-01-12 08:47:29,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:47:29,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:47:29,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:47:29,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:47:29,680 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:47:29" (1/1) ... [2019-01-12 08:47:29,686 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:47:29" (1/1) ... [2019-01-12 08:47:29,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:47:29,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:47:29,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:47:29,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:47:29,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (1/1) ... [2019-01-12 08:47:29,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:47:29,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:47:29,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:47:29,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:47:29,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (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:47:29,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:47:29,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:47:30,034 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:47:30,034 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:47:30,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:47:30 BoogieIcfgContainer [2019-01-12 08:47:30,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:47:30,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:47:30,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:47:30,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:47:30,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:47:29" (1/3) ... [2019-01-12 08:47:30,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bb1a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:47:30, skipping insertion in model container [2019-01-12 08:47:30,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:29" (2/3) ... [2019-01-12 08:47:30,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bb1a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:47:30, skipping insertion in model container [2019-01-12 08:47:30,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:47:30" (3/3) ... [2019-01-12 08:47:30,044 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_true-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:47:30,052 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:47:30,059 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:47:30,075 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:47:30,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:47:30,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:47:30,109 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:47:30,110 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:47:30,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:47:30,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:47:30,110 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:47:30,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:47:30,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:47:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-12 08:47:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 08:47:30,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:47:30,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 08:47:30,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:47:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:47:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2019-01-12 08:47:30,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:47:30,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:47:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:47:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:47:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:47:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:47:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:47:30,236 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 08:47:30,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:47:30 BoogieIcfgContainer [2019-01-12 08:47:30,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:47:30,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:47:30,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:47:30,263 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:47:30,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:47:30" (3/4) ... [2019-01-12 08:47:30,268 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 08:47:30,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:47:30,269 INFO L168 Benchmark]: Toolchain (without parser) took 900.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:47:30,271 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:47:30,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.34 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:47:30,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.44 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:47:30,274 INFO L168 Benchmark]: Boogie Preprocessor took 20.00 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:47:30,274 INFO L168 Benchmark]: RCFGBuilder took 309.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:47:30,275 INFO L168 Benchmark]: TraceAbstraction took 225.61 ms. Allocated memory is still 1.1 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:47:30,276 INFO L168 Benchmark]: Witness Printer took 5.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:47:30,284 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 300.34 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 35.44 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 20.00 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 309.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 225.61 ms. Allocated memory is still 1.1 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 5.32 ms. Allocated memory is still 1.1 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 / 2.5; 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:47:32,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:47:32,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:47:32,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:47:32,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:47:32,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:47:32,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:47:32,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:47:32,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:47:32,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:47:32,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:47:32,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:47:32,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:47:32,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:47:32,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:47:32,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:47:32,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:47:32,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:47:32,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:47:32,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:47:32,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:47:32,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:47:32,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:47:32,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:47:32,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:47:32,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:47:32,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:47:32,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:47:32,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:47:32,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:47:32,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:47:32,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:47:32,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:47:32,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:47:32,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:47:32,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:47:32,498 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:47:32,514 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:47:32,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:47:32,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:47:32,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:47:32,516 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:47:32,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:47:32,517 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:47:32,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:47:32,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:47:32,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:47:32,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:47:32,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:47:32,519 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 08:47:32,519 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 08:47:32,519 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:47:32,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:47:32,520 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:47:32,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:47:32,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:47:32,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:47:32,521 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:47:32,521 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:47:32,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:47:32,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:47:32,521 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:47:32,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:47:32,523 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 08:47:32,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:47:32,523 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 08:47:32,523 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 08:47:32,523 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 -> 1bbff5832e71471655f4416229b3fdd1dac2e479 [2019-01-12 08:47:32,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:47:32,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:47:32,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:47:32,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:47:32,594 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:47:32,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:47:32,659 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e63503ca/43451bf9bd854d40b7f5bba44ecd5127/FLAG447ab0ccc [2019-01-12 08:47:33,022 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:47:33,023 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_true-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:47:33,028 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e63503ca/43451bf9bd854d40b7f5bba44ecd5127/FLAG447ab0ccc [2019-01-12 08:47:33,428 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e63503ca/43451bf9bd854d40b7f5bba44ecd5127 [2019-01-12 08:47:33,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:47:33,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:47:33,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:47:33,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:47:33,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:47:33,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c23ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33, skipping insertion in model container [2019-01-12 08:47:33,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:47:33,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:47:33,693 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:47:33,708 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:47:33,730 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:47:33,751 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:47:33,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33 WrapperNode [2019-01-12 08:47:33,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:47:33,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:47:33,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:47:33,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:47:33,763 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:47:33" (1/1) ... [2019-01-12 08:47:33,774 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:47:33" (1/1) ... [2019-01-12 08:47:33,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:47:33,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:47:33,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:47:33,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:47:33,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (1/1) ... [2019-01-12 08:47:33,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:47:33,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:47:33,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:47:33,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:47:33,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (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:47:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:47:33,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:47:35,072 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:47:35,072 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:47:35,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:47:35 BoogieIcfgContainer [2019-01-12 08:47:35,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:47:35,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:47:35,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:47:35,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:47:35,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:47:33" (1/3) ... [2019-01-12 08:47:35,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7a8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:47:35, skipping insertion in model container [2019-01-12 08:47:35,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:33" (2/3) ... [2019-01-12 08:47:35,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7a8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:47:35, skipping insertion in model container [2019-01-12 08:47:35,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:47:35" (3/3) ... [2019-01-12 08:47:35,083 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_true-unreach-call.i.p+cfa-reducer.c [2019-01-12 08:47:35,094 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:47:35,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:47:35,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:47:35,152 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:47:35,153 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:47:35,153 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:47:35,154 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:47:35,154 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:47:35,155 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:47:35,155 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:47:35,155 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:47:35,155 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:47:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-12 08:47:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 08:47:35,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:47:35,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 08:47:35,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:47:35,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:47:35,202 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2019-01-12 08:47:35,207 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:47:35,208 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:47:35,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:47:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:47:35,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:47:38,736 WARN L181 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 08:47:38,747 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:47:38,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:47:38,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:47:38,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 08:47:38,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 08:47:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 08:47:38,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 08:47:38,801 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-12 08:47:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:47:41,603 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-01-12 08:47:41,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 08:47:41,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-12 08:47:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:47:41,839 INFO L225 Difference]: With dead ends: 16 [2019-01-12 08:47:41,839 INFO L226 Difference]: Without dead ends: 7 [2019-01-12 08:47:41,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 08:47:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-12 08:47:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-12 08:47:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-12 08:47:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-12 08:47:41,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-12 08:47:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:47:41,877 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-12 08:47:41,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 08:47:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-12 08:47:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 08:47:41,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:47:41,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 08:47:41,878 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:47:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:47:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2019-01-12 08:47:41,879 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:47:41,879 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:47:41,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:47:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:47:42,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:47:44,506 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0)) (= c_ULTIMATE.start_main_~main__x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)))) is different from true [2019-01-12 08:47:44,510 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:47:44,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:47:53,862 WARN L181 SmtUtils]: Spent 2.89 s on a formula simplification that was a NOOP. DAG size: 7 [2019-01-12 08:47:53,868 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:47:53,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:47:53,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-12 08:47:53,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 08:47:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 08:47:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2019-01-12 08:47:53,887 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-12 08:47:59,805 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0)) (= c_ULTIMATE.start_main_~main__x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)) (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:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:48:03,141 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-12 08:48:03,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:48:03,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-12 08:48:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:48:03,366 INFO L225 Difference]: With dead ends: 12 [2019-01-12 08:48:03,366 INFO L226 Difference]: Without dead ends: 9 [2019-01-12 08:48:03,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=17, Invalid=19, Unknown=2, NotChecked=18, Total=56 [2019-01-12 08:48:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-12 08:48:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-12 08:48:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-12 08:48:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-12 08:48:03,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-01-12 08:48:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:48:03,373 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-12 08:48:03,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 08:48:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-12 08:48:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 08:48:03,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:48:03,373 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-01-12 08:48:03,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:48:03,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:48:03,374 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 2 times [2019-01-12 08:48:03,375 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:48:03,375 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) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 08:48:03,380 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 08:48:04,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 08:48:04,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:48:04,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:48:12,536 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 08:48:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:48:12,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:48:21,375 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2019-01-12 08:48:23,870 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2019-01-12 08:48:28,471 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.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:48:31,181 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.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:48:31,214 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:48:31,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:48:31,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-01-12 08:48:31,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 08:48:31,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 08:48:31,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=40, Unknown=8, NotChecked=42, Total=110 [2019-01-12 08:48:31,249 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 11 states. [2019-01-12 08:48:34,080 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.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))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse2) .cse2))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse2) .cse1)) (fp.eq .cse1 .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2)))) is different from true [2019-01-12 08:48:36,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.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 (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1)))))) is different from true [2019-01-12 08:48:38,810 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2019-01-12 08:48:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:48:47,734 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-12 08:48:47,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 08:48:47,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-12 08:48:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:48:47,737 INFO L225 Difference]: With dead ends: 15 [2019-01-12 08:48:47,738 INFO L226 Difference]: Without dead ends: 11 [2019-01-12 08:48:47,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=30, Invalid=55, Unknown=11, NotChecked=114, Total=210 [2019-01-12 08:48:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-12 08:48:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-12 08:48:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-12 08:48:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-12 08:48:47,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-12 08:48:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:48:47,745 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-12 08:48:47,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 08:48:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-12 08:48:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 08:48:47,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:48:47,747 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-01-12 08:48:47,747 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:48:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:48:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 3 times [2019-01-12 08:48:47,749 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:48:47,749 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:48:47,761 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-12 08:48:48,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 08:48:48,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:48:48,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:48:51,030 WARN L838 $PredicateComparison]: unable to prove that (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) is different from false [2019-01-12 08:48:55,683 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 v_ULTIMATE.start_main_~main__x~0_13)) (= (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) is different from false [2019-01-12 08:48:57,918 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 v_ULTIMATE.start_main_~main__x~0_13)) (= (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) is different from true [2019-01-12 08:49:10,639 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_prenex_2 .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 v_prenex_2)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) (= (_ bv1 32) c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (and (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 .cse3))) (and (not (fp.eq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse2 v_ULTIMATE.start_main_~main__x~0_13)) (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse3) .cse2))))) (= (_ bv0 32) c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) is different from false [2019-01-12 08:49:18,125 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_13)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2019-01-12 08:49:20,528 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_13)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2019-01-12 08:49:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2019-01-12 08:49:20,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:49:22,804 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2019-01-12 08:49:30,970 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x~0_15 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_15 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_15))))) is different from false [2019-01-12 08:49:33,457 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x~0_15 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_15 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_15))))) is different from true [2019-01-12 08:49:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2019-01-12 08:49:53,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:49:53,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-01-12 08:49:53,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 08:49:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 08:49:53,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=10, Unknown=9, NotChecked=54, Total=90 [2019-01-12 08:49:53,311 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-12 08:49:56,616 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0)) (forall ((v_ULTIMATE.start_main_~main__x~0_15 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_15 .cse2))) (or (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse2) .cse1)) (fp.eq .cse1 v_ULTIMATE.start_main_~main__x~0_15))))))) is different from false [2019-01-12 08:49:59,343 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse0) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse0)) (forall ((v_ULTIMATE.start_main_~main__x~0_15 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_15 .cse2))) (or (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse2) .cse1)) (fp.eq .cse1 v_ULTIMATE.start_main_~main__x~0_15))))))) is different from true [2019-01-12 08:50:02,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 v_ULTIMATE.start_main_~main__x~0_13)) (= (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x~0))) (or .cse0 (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 .cse2)) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse2) (not .cse0)) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse1)) (forall ((v_ULTIMATE.start_main_~main__x~0_15 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_15 .cse4))) (or (fp.eq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse4) .cse3)) (fp.eq .cse3 v_ULTIMATE.start_main_~main__x~0_15))))))) is different from false [2019-01-12 08:50:05,107 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 v_ULTIMATE.start_main_~main__x~0_13)) (= (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) c_ULTIMATE.start_main_~main__x~0))) (or .cse0 (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x1~0 .cse1) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 .cse2)) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 .cse2) (not .cse0)) (= c_ULTIMATE.start_main_~main__x1~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0 .cse1)) (forall ((v_ULTIMATE.start_main_~main__x~0_15 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_15 .cse4))) (or (fp.eq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse4) .cse3)) (fp.eq .cse3 v_ULTIMATE.start_main_~main__x~0_15))))))) is different from true [2019-01-12 08:50:07,437 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (and (not .cse0) (or (and (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse1 (fp.div roundNearestTiesToEven v_prenex_2 .cse2))) (and (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse2) .cse1) (not (fp.eq .cse1 v_prenex_2)) (fp.eq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))) (= (_ bv1 32) c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (and (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_13 .cse4))) (and (not (fp.eq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse3 v_ULTIMATE.start_main_~main__x~0_13)) (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse4) .cse3))))) .cse0)))) is different from false [2019-01-12 08:50:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:50:07,457 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-12 08:50:07,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 08:50:07,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-12 08:50:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:50:07,458 INFO L225 Difference]: With dead ends: 11 [2019-01-12 08:50:07,459 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 08:50:07,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=23, Invalid=11, Unknown=14, NotChecked=108, Total=156 [2019-01-12 08:50:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 08:50:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 08:50:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 08:50:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 08:50:07,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-12 08:50:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:50:07,463 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 08:50:07,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 08:50:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 08:50:07,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 08:50:07,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 08:50:55,896 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-12 08:50:55,897 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.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplifyWithStatistics(SmtUtils.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeCFGHoareAnnotation(BasicCegarLoop.java:1009) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:346) 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) ... 32 more [2019-01-12 08:50:55,900 INFO L168 Benchmark]: Toolchain (without parser) took 202466.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -81.4 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2019-01-12 08:50:55,901 INFO L168 Benchmark]: CDTParser took 0.17 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:50:55,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.30 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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:50:55,903 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.62 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:50:55,903 INFO L168 Benchmark]: Boogie Preprocessor took 34.99 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 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:50:55,905 INFO L168 Benchmark]: RCFGBuilder took 1240.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:50:55,906 INFO L168 Benchmark]: TraceAbstraction took 200825.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.6 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:50:55,916 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.17 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 316.30 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 44.62 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.99 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1240.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 200825.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.6 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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...