./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -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 1d363a30f559764c47bcb73d637f2d7196a1b97b ..................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i -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 1d363a30f559764c47bcb73d637f2d7196a1b97b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 08:46:55,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:46:55,229 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:46:55,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:46:55,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:46:55,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:46:55,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:46:55,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:46:55,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:46:55,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:46:55,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:46:55,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:46:55,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:46:55,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:46:55,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:46:55,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:46:55,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:46:55,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:46:55,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:46:55,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:46:55,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:46:55,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:46:55,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:46:55,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:46:55,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:46:55,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:46:55,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:46:55,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:46:55,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:46:55,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:46:55,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:46:55,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:46:55,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:46:55,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:46:55,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:46:55,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:46:55,306 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:46:55,331 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:46:55,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:46:55,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:46:55,333 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:46:55,333 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:46:55,334 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:46:55,334 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:46:55,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 08:46:55,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:46:55,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:46:55,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:46:55,336 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:46:55,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:46:55,336 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:46:55,337 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:46:55,337 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:46:55,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:46:55,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:46:55,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:46:55,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:46:55,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:46:55,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:46:55,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:46:55,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:46:55,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:46:55,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 08:46:55,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:46:55,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 08:46:55,340 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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2019-01-12 08:46:55,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:46:55,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:46:55,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:46:55,404 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:46:55,404 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:46:55,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2019-01-12 08:46:55,476 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099fddc07/a499096a32204effaa71dc77c91ac708/FLAG33e9aedae [2019-01-12 08:46:55,856 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:46:55,856 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2019-01-12 08:46:55,862 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099fddc07/a499096a32204effaa71dc77c91ac708/FLAG33e9aedae [2019-01-12 08:46:56,248 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099fddc07/a499096a32204effaa71dc77c91ac708 [2019-01-12 08:46:56,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:46:56,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:46:56,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:46:56,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:46:56,259 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:46:56,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a11cc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56, skipping insertion in model container [2019-01-12 08:46:56,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:46:56,288 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:46:56,471 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:46:56,480 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:46:56,503 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:46:56,524 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:46:56,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56 WrapperNode [2019-01-12 08:46:56,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:46:56,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:46:56,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:46:56,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:46:56,540 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:46:56" (1/1) ... [2019-01-12 08:46:56,547 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:46:56" (1/1) ... [2019-01-12 08:46:56,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:46:56,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:46:56,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:46:56,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:46:56,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (1/1) ... [2019-01-12 08:46:56,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:46:56,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:46:56,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:46:56,608 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:46:56,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (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:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:46:56,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:46:56,932 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:46:56,932 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 08:46:56,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:46:56 BoogieIcfgContainer [2019-01-12 08:46:56,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:46:56,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:46:56,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:46:56,937 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:46:56,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:46:56" (1/3) ... [2019-01-12 08:46:56,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb2b97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:46:56, skipping insertion in model container [2019-01-12 08:46:56,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:46:56" (2/3) ... [2019-01-12 08:46:56,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb2b97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:46:56, skipping insertion in model container [2019-01-12 08:46:56,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:46:56" (3/3) ... [2019-01-12 08:46:56,941 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2019-01-12 08:46:56,951 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:46:56,958 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:46:56,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:46:56,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:46:56,999 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:46:57,000 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:46:57,000 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:46:57,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:46:57,000 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:46:57,000 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:46:57,000 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:46:57,000 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:46:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-01-12 08:46:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 08:46:57,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:46:57,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 08:46:57,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:46:57,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:46:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-01-12 08:46:57,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:46:57,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:46:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:46:57,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:46:57,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:46:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:46:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:46:57,136 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 08:46:57,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:46:57 BoogieIcfgContainer [2019-01-12 08:46:57,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:46:57,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:46:57,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:46:57,155 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:46:57,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:46:56" (3/4) ... [2019-01-12 08:46:57,159 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 08:46:57,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:46:57,160 INFO L168 Benchmark]: Toolchain (without parser) took 908.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:46:57,163 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:46:57,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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:46:57,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.29 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:46:57,165 INFO L168 Benchmark]: Boogie Preprocessor took 33.92 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:46:57,166 INFO L168 Benchmark]: RCFGBuilder took 325.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:46:57,167 INFO L168 Benchmark]: TraceAbstraction took 219.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 08:46:57,168 INFO L168 Benchmark]: Witness Printer took 5.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:46:57,173 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 271.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.29 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 33.92 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 325.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 219.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 2]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 18, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L9] double x = 1.0; [L10] double x1 = x/1.6; [L12] COND FALSE !(x1 != x) [L2] COND TRUE !(cond) [L2] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 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=10occurred 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:46:59,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:46:59,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:46:59,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:46:59,454 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:46:59,455 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:46:59,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:46:59,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:46:59,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:46:59,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:46:59,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:46:59,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:46:59,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:46:59,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:46:59,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:46:59,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:46:59,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:46:59,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:46:59,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:46:59,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:46:59,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:46:59,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:46:59,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:46:59,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:46:59,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:46:59,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:46:59,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:46:59,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:46:59,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:46:59,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:46:59,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:46:59,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:46:59,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:46:59,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:46:59,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:46:59,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:46:59,489 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:46:59,509 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:46:59,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:46:59,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:46:59,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:46:59,511 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:46:59,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:46:59,512 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:46:59,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:46:59,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:46:59,513 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:46:59,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:46:59,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:46:59,513 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 08:46:59,513 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 08:46:59,514 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:46:59,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:46:59,514 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:46:59,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:46:59,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:46:59,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:46:59,515 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:46:59,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:46:59,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:46:59,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:46:59,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:46:59,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:46:59,518 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 08:46:59,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:46:59,518 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 08:46:59,518 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 08:46:59,518 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 -> 1d363a30f559764c47bcb73d637f2d7196a1b97b [2019-01-12 08:46:59,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:46:59,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:46:59,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:46:59,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:46:59,593 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:46:59,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2019-01-12 08:46:59,675 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef2863e58/8e9ba0024f5846c89d7b827bb17c9932/FLAG296086113 [2019-01-12 08:47:00,121 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:47:00,121 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/floats-esbmc-regression/Double_div_bad_false-unreach-call.i [2019-01-12 08:47:00,127 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef2863e58/8e9ba0024f5846c89d7b827bb17c9932/FLAG296086113 [2019-01-12 08:47:00,517 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef2863e58/8e9ba0024f5846c89d7b827bb17c9932 [2019-01-12 08:47:00,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:47:00,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:47:00,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:47:00,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:47:00,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:47:00,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:47:00" (1/1) ... [2019-01-12 08:47:00,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5089c550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:00, skipping insertion in model container [2019-01-12 08:47:00,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:47:00" (1/1) ... [2019-01-12 08:47:00,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:47:00,562 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:47:00,760 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:47:00,769 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:47:00,785 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:47:00,801 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:47:00,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:00 WrapperNode [2019-01-12 08:47:00,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:47:00,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:47:00,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:47:00,803 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:47:00,812 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:00" (1/1) ... [2019-01-12 08:47:00,820 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:00" (1/1) ... [2019-01-12 08:47:00,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:47:00,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:47:00,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:47:00,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:47:00,850 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:00" (1/1) ... [2019-01-12 08:47:00,850 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:00" (1/1) ... [2019-01-12 08:47:00,852 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:00" (1/1) ... [2019-01-12 08:47:00,853 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:00" (1/1) ... [2019-01-12 08:47:00,860 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:00" (1/1) ... [2019-01-12 08:47:00,864 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:00" (1/1) ... [2019-01-12 08:47:00,866 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:00" (1/1) ... [2019-01-12 08:47:00,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:47:00,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:47:00,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:47:00,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:47:00,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:00" (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:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:47:00,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:47:03,378 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:47:03,378 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 08:47:03,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:47:03 BoogieIcfgContainer [2019-01-12 08:47:03,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:47:03,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:47:03,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:47:03,384 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:47:03,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:47:00" (1/3) ... [2019-01-12 08:47:03,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741612f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:47:03, skipping insertion in model container [2019-01-12 08:47:03,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:47:00" (2/3) ... [2019-01-12 08:47:03,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741612f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:47:03, skipping insertion in model container [2019-01-12 08:47:03,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:47:03" (3/3) ... [2019-01-12 08:47:03,389 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div_bad_false-unreach-call.i [2019-01-12 08:47:03,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:47:03,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:47:03,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:47:03,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:47:03,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:47:03,447 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:47:03,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:47:03,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:47:03,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:47:03,448 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:47:03,449 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:47:03,449 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:47:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-12 08:47:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 08:47:03,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:47:03,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 08:47:03,475 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:47:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:47:03,482 INFO L82 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2019-01-12 08:47:03,487 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:47:03,487 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:03,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:47:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:47:03,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:47:06,398 WARN L181 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 08:47:06,409 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:06,409 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:47:06,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:47:06,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 08:47:06,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 08:47:06,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 08:47:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 08:47:06,444 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-12 08:47:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:47:10,247 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-12 08:47:10,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 08:47:10,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-12 08:47:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:47:10,258 INFO L225 Difference]: With dead ends: 20 [2019-01-12 08:47:10,259 INFO L226 Difference]: Without dead ends: 8 [2019-01-12 08:47:10,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 08:47:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-12 08:47:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-12 08:47:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-12 08:47:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-12 08:47:10,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-12 08:47:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:47:10,300 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-12 08:47:10,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 08:47:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-12 08:47:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 08:47:10,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:47:10,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:47:10,302 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:47:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:47:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2019-01-12 08:47:10,302 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:47:10,303 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:10,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:47:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:47:10,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:47:16,372 WARN L181 SmtUtils]: Spent 3.49 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 08:47:16,396 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:16,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:47:20,994 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2019-01-12 08:47:21,748 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:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:47:21,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-12 08:47:21,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 08:47:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 08:47:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2019-01-12 08:47:21,768 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-01-12 08:47:24,075 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) c_ULTIMATE.start_main_~x1~0) (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)))) is different from true [2019-01-12 08:47:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:47:30,495 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-01-12 08:47:30,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:47:30,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-12 08:47:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:47:30,498 INFO L225 Difference]: With dead ends: 14 [2019-01-12 08:47:30,498 INFO L226 Difference]: Without dead ends: 10 [2019-01-12 08:47:30,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=12, Invalid=13, Unknown=3, NotChecked=14, Total=42 [2019-01-12 08:47:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-12 08:47:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-12 08:47:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-12 08:47:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-12 08:47:30,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-01-12 08:47:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:47:30,504 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-12 08:47:30,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 08:47:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-12 08:47:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 08:47:30,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:47:30,506 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-01-12 08:47:30,506 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:47:30,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:47:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash 492108272, now seen corresponding path program 2 times [2019-01-12 08:47:30,508 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:47:30,508 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:47:30,516 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 08:47:31,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 08:47:31,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:47:31,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:47:33,941 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x1~0) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x~0))) is different from true [2019-01-12 08:47:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-01-12 08:47:33,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:47:36,527 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2019-01-12 08:47:41,059 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~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:47:43,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2019-01-12 08:47:46,321 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~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:47:49,085 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~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:47:49,096 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:47:49,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:47:49,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-01-12 08:47:49,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 08:47:49,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 08:47:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=44, Unknown=6, NotChecked=60, Total=132 [2019-01-12 08:47:49,122 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 12 states. [2019-01-12 08:47:51,968 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~x~0 .cse0) (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0))) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) c_ULTIMATE.start_main_~x1~0) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0))))) is different from true [2019-01-12 08:47:54,496 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0) (let ((.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_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:05,713 WARN L181 SmtUtils]: Spent 7.43 s on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-12 08:48:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:48:12,859 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-01-12 08:48:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 08:48:12,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-12 08:48:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:48:12,860 INFO L225 Difference]: With dead ends: 18 [2019-01-12 08:48:12,861 INFO L226 Difference]: Without dead ends: 12 [2019-01-12 08:48:12,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=34, Invalid=72, Unknown=8, NotChecked=126, Total=240 [2019-01-12 08:48:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-12 08:48:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-12 08:48:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 08:48:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-12 08:48:12,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-12 08:48:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:48:12,868 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-12 08:48:12,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 08:48:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-12 08:48:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 08:48:12,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:48:12,870 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2019-01-12 08:48:12,870 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:48:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:48:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash 522938704, now seen corresponding path program 3 times [2019-01-12 08:48:12,871 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:48:12,871 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:12,876 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-12 08:48:14,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 08:48:14,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:48:15,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:48:17,485 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x1~0) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x~0))) is different from true [2019-01-12 08:48:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2019-01-12 08:48:17,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:48:19,880 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from false [2019-01-12 08:48:22,159 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) is different from true [2019-01-12 08:48:24,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~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:27,263 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2019-01-12 08:48:30,095 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~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:32,906 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~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:35,944 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2019-01-12 08:48:39,006 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2019-01-12 08:48:42,334 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2019-01-12 08:48:45,642 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-01-12 08:48:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2019-01-12 08:48:45,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:48:45,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-01-12 08:48:45,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 08:48:45,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 08:48:45,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=73, Unknown=11, NotChecked=126, Total=240 [2019-01-12 08:48:45,699 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-01-12 08:48:49,053 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2))) (or (fp.eq c_ULTIMATE.start_main_~x~0 .cse2) (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0))) (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-01-12 08:48:52,154 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-01-12 08:48:54,972 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-01-12 08:48:57,508 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2019-01-12 08:48:59,784 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (or (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-01-12 08:49:10,463 WARN L181 SmtUtils]: Spent 10.65 s on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2019-01-12 08:49:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:49:18,369 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-01-12 08:49:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 08:49:18,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-12 08:49:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:49:18,371 INFO L225 Difference]: With dead ends: 20 [2019-01-12 08:49:18,371 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 08:49:18,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=48, Invalid=112, Unknown=16, NotChecked=330, Total=506 [2019-01-12 08:49:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 08:49:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 08:49:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 08:49:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-12 08:49:18,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-12 08:49:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:49:18,379 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-12 08:49:18,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 08:49:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-12 08:49:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 08:49:18,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:49:18,381 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2019-01-12 08:49:18,381 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:49:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:49:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 86212784, now seen corresponding path program 4 times [2019-01-12 08:49:18,382 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:49:18,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 08:49:18,388 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 08:49:20,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 08:49:20,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:49:20,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:49:38,888 WARN L181 SmtUtils]: Spent 3.46 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 08:49:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:49:38,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:49:43,358 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2019-01-12 08:49:46,640 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:49:49,180 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:49:51,997 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:49:54,782 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:49:57,850 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:50:00,938 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:50:04,299 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:50:07,647 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:50:11,603 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:50:15,517 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:50:20,068 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:50:24,394 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:50:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2019-01-12 08:50:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:50:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-12 08:50:24,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 08:50:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 08:50:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=88, Unknown=16, NotChecked=168, Total=306 [2019-01-12 08:50:24,453 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 18 states. [2019-01-12 08:50:28,965 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) c_ULTIMATE.start_main_~x1~0) (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-01-12 08:50:32,723 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-01-12 08:50:36,078 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (not (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))) (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1) .cse1) .cse1) c_ULTIMATE.start_main_~x1~0))) is different from true [2019-01-12 08:50:39,151 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-01-12 08:50:41,948 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0) .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-01-12 08:50:44,488 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (and (= (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) c_ULTIMATE.start_main_~x1~0) (not (let ((.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse0))) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse0) .cse1))))) is different from true [2019-01-12 08:50:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:50:51,465 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-01-12 08:50:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 08:50:51,466 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2019-01-12 08:50:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:50:51,467 INFO L225 Difference]: With dead ends: 20 [2019-01-12 08:50:51,467 INFO L226 Difference]: Without dead ends: 16 [2019-01-12 08:50:51,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.8s TimeCoverageRelationStatistics Valid=46, Invalid=94, Unknown=22, NotChecked=390, Total=552 [2019-01-12 08:50:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-12 08:50:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-12 08:50:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 08:50:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-12 08:50:51,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-01-12 08:50:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:50:51,475 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-12 08:50:51,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 08:50:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-12 08:50:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 08:50:51,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:50:51,476 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2019-01-12 08:50:51,478 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:50:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:50:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1299398672, now seen corresponding path program 5 times [2019-01-12 08:50:51,479 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:50:51,479 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 08:50:51,490 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2019-01-12 08:51:01,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 08:51:01,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:51:01,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:51:24,681 WARN L181 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 08:51:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:51:24,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:51:29,288 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2019-01-12 08:51:33,684 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:36,218 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:39,038 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:41,862 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:44,924 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:47,994 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:51,388 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:51:54,765 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from true [2019-01-12 08:51:58,580 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0)))) is different from false [2019-01-12 08:52:00,553 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-12 08:52:00,754 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-01-12 08:52:00,756 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:851) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2019-01-12 08:52:00,767 INFO L168 Benchmark]: Toolchain (without parser) took 300244.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 936.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 145.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:00,768 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:52:00,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.90 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:00,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.13 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:52:00,775 INFO L168 Benchmark]: Boogie Preprocessor took 28.38 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 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:52:00,776 INFO L168 Benchmark]: RCFGBuilder took 2511.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:00,777 INFO L168 Benchmark]: TraceAbstraction took 297385.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 936.3 MB in the end (delta: 175.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:52:00,785 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.67 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 276.90 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 37.13 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.38 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 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 2511.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 297385.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 936.3 MB in the end (delta: 175.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...