./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/float-benchs/water_pid_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 ................................................................................................................................................................................................................................................... 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/float-benchs/water_pid_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 ..................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 03:30:06,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:30:06,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:30:06,350 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:30:06,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:30:06,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:30:06,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:30:06,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:30:06,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:30:06,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:30:06,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:30:06,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:30:06,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:30:06,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:30:06,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:30:06,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:30:06,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:30:06,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:30:06,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:30:06,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:30:06,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:30:06,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:30:06,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:30:06,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:30:06,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:30:06,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:30:06,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:30:06,406 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:30:06,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:30:06,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:30:06,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:30:06,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:30:06,409 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:30:06,409 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:30:06,410 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:30:06,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:30:06,411 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:30:06,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:30:06,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:30:06,428 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:30:06,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:30:06,428 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:30:06,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:30:06,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:30:06,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:30:06,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:30:06,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:30:06,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:30:06,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:30:06,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:30:06,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:30:06,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:30:06,431 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:30:06,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:30:06,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:30:06,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:30:06,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:30:06,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:30:06,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:30:06,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:30:06,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:30:06,435 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:30:06,435 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:30:06,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:30:06,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:30:06,435 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 -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2018-12-31 03:30:06,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:30:06,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:30:06,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:30:06,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:30:06,497 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:30:06,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-31 03:30:06,570 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91d27bf6/bbdaaaffef13444297f77701744e0325/FLAG505b8ee51 [2018-12-31 03:30:07,018 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:30:07,019 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-31 03:30:07,026 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91d27bf6/bbdaaaffef13444297f77701744e0325/FLAG505b8ee51 [2018-12-31 03:30:07,385 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91d27bf6/bbdaaaffef13444297f77701744e0325 [2018-12-31 03:30:07,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:30:07,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:30:07,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:30:07,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:30:07,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:30:07,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e38ab91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07, skipping insertion in model container [2018-12-31 03:30:07,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:30:07,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:30:07,676 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:30:07,685 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:30:07,722 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:30:07,745 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:30:07,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07 WrapperNode [2018-12-31 03:30:07,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:30:07,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:30:07,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:30:07,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:30:07,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:30:07,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:30:07,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:30:07,800 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:30:07,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (1/1) ... [2018-12-31 03:30:07,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:30:07,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:30:07,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:30:07,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:30:07,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (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 [2018-12-31 03:30:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:30:07,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:30:08,351 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:30:08,351 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-31 03:30:08,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:30:08 BoogieIcfgContainer [2018-12-31 03:30:08,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:30:08,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:30:08,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:30:08,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:30:08,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:30:07" (1/3) ... [2018-12-31 03:30:08,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151e6c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:30:08, skipping insertion in model container [2018-12-31 03:30:08,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:07" (2/3) ... [2018-12-31 03:30:08,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151e6c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:30:08, skipping insertion in model container [2018-12-31 03:30:08,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:30:08" (3/3) ... [2018-12-31 03:30:08,365 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-12-31 03:30:08,394 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:30:08,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:30:08,436 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:30:08,470 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:30:08,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:30:08,471 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:30:08,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:30:08,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:30:08,472 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:30:08,472 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:30:08,472 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:30:08,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:30:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-12-31 03:30:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-31 03:30:08,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:30:08,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:30:08,500 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:30:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:30:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1804134213, now seen corresponding path program 1 times [2018-12-31 03:30:08,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:30:08,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:30:08,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:30:08,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:30:08,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:30:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:30:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:30:08,650 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:30:08,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:30:08 BoogieIcfgContainer [2018-12-31 03:30:08,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:30:08,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:30:08,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:30:08,683 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:30:08,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:30:08" (3/4) ... [2018-12-31 03:30:08,689 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:30:08,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:30:08,690 INFO L168 Benchmark]: Toolchain (without parser) took 1300.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:30:08,693 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-12-31 03:30:08,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:30:08,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.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. [2018-12-31 03:30:08,696 INFO L168 Benchmark]: Boogie Preprocessor took 47.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:30:08,697 INFO L168 Benchmark]: RCFGBuilder took 504.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:30:08,698 INFO L168 Benchmark]: TraceAbstraction took 328.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:30:08,699 INFO L168 Benchmark]: Witness Printer took 6.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:30:08,705 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.15 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 354.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.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. * Boogie Preprocessor took 47.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 504.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 328.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of to_real at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L10] static NUM yn = 0; [L12] NUM ui = 0; [L22] NUM yi, yc; [L23] NUM K; [L24] NUM T; [L25] NUM taui; [L26] NUM taud; [L27] NUM ei, sumej, epi; [L28] int i; [L29] T = 1 [L30] taui = 1 [L31] taud = 1 [L32] K = .5 [L33] yc = .5 [L16] yn += ui [L17] return yn; VAL [yn=3] [L34] yi = y(0) [L35] epi = yc-yi [L36] sumej = epi [L37] i=0 VAL [yn=3] [L37] COND TRUE i<120 [L16] yn += ui [L17] return yn; VAL [yn=5] [L38] yi = y(i) [L39] ei = yc-yi [L40] sumej = sumej+ei [L41] ui = K*(ei+sumej*T/taui+taud/T*(ei-epi)) [L42] epi = ei [L6] COND TRUE !(cond) VAL [yn=5] [L6] __VERIFIER_error() VAL [yn=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. UNSAFE Result, 0.2s 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=13occurred 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, 7 NumberOfCodeBlocks, 7 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-2e94e6a [2018-12-31 03:30:11,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:30:11,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:30:11,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:30:11,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:30:11,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:30:11,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:30:11,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:30:11,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:30:11,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:30:11,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:30:11,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:30:11,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:30:11,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:30:11,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:30:11,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:30:11,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:30:11,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:30:11,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:30:11,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:30:11,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:30:11,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:30:11,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:30:11,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:30:11,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:30:11,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:30:11,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:30:11,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:30:11,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:30:11,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:30:11,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:30:11,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:30:11,206 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:30:11,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:30:11,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:30:11,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:30:11,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:30:11,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:30:11,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:30:11,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:30:11,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:30:11,227 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:30:11,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:30:11,228 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:30:11,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:30:11,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:30:11,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:30:11,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:30:11,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:30:11,229 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:30:11,229 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:30:11,229 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:30:11,229 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:30:11,229 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:30:11,229 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:30:11,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:30:11,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:30:11,230 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:30:11,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:30:11,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:30:11,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:30:11,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:30:11,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:30:11,231 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:30:11,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:30:11,231 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:30:11,232 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:30:11,232 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 -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2018-12-31 03:30:11,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:30:11,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:30:11,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:30:11,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:30:11,291 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:30:11,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-31 03:30:11,354 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b4cd681/5161b2cb9cb94718b473d617a62b4946/FLAG50e5a995f [2018-12-31 03:30:11,804 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:30:11,805 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-31 03:30:11,812 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b4cd681/5161b2cb9cb94718b473d617a62b4946/FLAG50e5a995f [2018-12-31 03:30:12,147 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b4cd681/5161b2cb9cb94718b473d617a62b4946 [2018-12-31 03:30:12,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:30:12,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:30:12,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:30:12,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:30:12,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:30:12,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4dae6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12, skipping insertion in model container [2018-12-31 03:30:12,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:30:12,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:30:12,412 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:30:12,427 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:30:12,460 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:30:12,485 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:30:12,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12 WrapperNode [2018-12-31 03:30:12,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:30:12,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:30:12,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:30:12,488 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:30:12,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:30:12,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:30:12,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:30:12,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:30:12,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (1/1) ... [2018-12-31 03:30:12,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:30:12,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:30:12,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:30:12,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:30:12,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (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 [2018-12-31 03:30:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:30:12,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:30:16,310 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:30:16,311 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-31 03:30:16,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:30:16 BoogieIcfgContainer [2018-12-31 03:30:16,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:30:16,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:30:16,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:30:16,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:30:16,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:30:12" (1/3) ... [2018-12-31 03:30:16,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cc361a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:30:16, skipping insertion in model container [2018-12-31 03:30:16,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:30:12" (2/3) ... [2018-12-31 03:30:16,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cc361a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:30:16, skipping insertion in model container [2018-12-31 03:30:16,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:30:16" (3/3) ... [2018-12-31 03:30:16,321 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-12-31 03:30:16,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:30:16,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:30:16,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:30:16,392 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:30:16,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:30:16,394 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:30:16,394 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:30:16,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:30:16,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:30:16,395 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:30:16,395 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:30:16,395 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:30:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-12-31 03:30:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-31 03:30:16,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:30:16,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:30:16,423 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:30:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:30:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1804134213, now seen corresponding path program 1 times [2018-12-31 03:30:16,436 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:30:16,437 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 [2018-12-31 03:30:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:30:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:30:20,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:30:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:30:20,631 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:30:20,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:30:20,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:30:20,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:30:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:30:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:30:20,716 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 6 states. [2018-12-31 03:30:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:30:37,276 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-12-31 03:30:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:30:38,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-31 03:30:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:30:38,192 INFO L225 Difference]: With dead ends: 37 [2018-12-31 03:30:38,193 INFO L226 Difference]: Without dead ends: 15 [2018-12-31 03:30:38,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:30:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-31 03:30:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-31 03:30:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-31 03:30:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-31 03:30:38,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2018-12-31 03:30:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:30:38,231 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-31 03:30:38,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:30:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-31 03:30:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:30:38,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:30:38,232 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:30:38,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:30:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:30:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash 729433995, now seen corresponding path program 1 times [2018-12-31 03:30:38,234 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:30:38,234 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 [2018-12-31 03:30:38,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:30:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:30:45,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:30:45,243 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-31 03:30:47,067 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-31 03:30:47,262 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-31 03:30:49,402 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse4))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse1) .cse3) .cse3)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse3 .cse3) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse4 .cse5)) (= .cse0 c_ULTIMATE.start_main_~yc~0)))) is different from true [2018-12-31 03:30:51,518 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse5 (fp.add roundNearestTiesToEven .cse6 .cse6))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse5 .cse6))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0)) (.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse2) .cse4) .cse4)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse4 .cse4) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))))) |c_ULTIMATE.start_y_#res|) (= .cse1 c_ULTIMATE.start_main_~yc~0))) is different from true [2018-12-31 03:30:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-12-31 03:30:51,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:30:55,567 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 03:31:11,456 WARN L181 SmtUtils]: Spent 5.42 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:31:14,449 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-12-31 03:31:17,442 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-12-31 03:31:20,475 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-12-31 03:31:23,488 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-12-31 03:31:26,510 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-12-31 03:31:29,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-12-31 03:31:31,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse2 (let ((.cse7 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse7 c_~ui~0))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse4 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (.cse5 (fp.sub roundNearestTiesToEven .cse2 .cse7))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 .cse4) .cse6) .cse6)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse6) (fp.sub roundNearestTiesToEven .cse4 .cse5))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-12-31 03:31:33,868 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse2 (let ((.cse7 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse7 c_~ui~0))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse4 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (.cse5 (fp.sub roundNearestTiesToEven .cse2 .cse7))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 .cse4) .cse6) .cse6)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse6) (fp.sub roundNearestTiesToEven .cse4 .cse5))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-12-31 03:31:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-31 03:31:33,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:31:33,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-12-31 03:31:33,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 03:31:33,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 03:31:33,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=66, Unknown=12, NotChecked=126, Total=240 [2018-12-31 03:31:33,956 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2018-12-31 03:31:36,156 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse3 (let ((.cse8 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse8 c_~ui~0))) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse3 (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse5 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse6 (fp.sub roundNearestTiesToEven .cse3 .cse8))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 .cse5) .cse7) .cse7)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse7) (fp.sub roundNearestTiesToEven .cse5 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq .cse0 .cse1) (= c_~ui~0 .cse2) (fp.geq .cse0 (fp.neg .cse1)) (= c_~yn~0 .cse2))) is different from false [2018-12-31 03:31:38,333 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse3 (let ((.cse8 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse8 c_~ui~0))) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse3 (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse5 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse6 (fp.sub roundNearestTiesToEven .cse3 .cse8))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 .cse5) .cse7) .cse7)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse7) (fp.sub roundNearestTiesToEven .cse5 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq .cse0 .cse1) (= c_~ui~0 .cse2) (fp.geq .cse0 (fp.neg .cse1)) (= c_~yn~0 .cse2))) is different from true [2018-12-31 03:31:40,534 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5)) (.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 .cse7))))))))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (= c_ULTIMATE.start_main_~taui~0 .cse1) (fp.geq .cse2 (fp.neg .cse3)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (fp.leq .cse2 .cse3) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse1) (= c_ULTIMATE.start_main_~taud~0 .cse1))) is different from false [2018-12-31 03:31:43,597 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5)) (.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 .cse7))))))))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (= c_ULTIMATE.start_main_~taui~0 .cse1) (fp.geq .cse2 (fp.neg .cse3)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (fp.leq .cse2 .cse3) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse1) (= c_ULTIMATE.start_main_~taud~0 .cse1))) is different from true [2018-12-31 03:31:46,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (fp.leq .cse1 .cse2) (= c_ULTIMATE.start_main_~taui~0 .cse3) (fp.geq .cse1 (fp.neg .cse2)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse3) (= c_ULTIMATE.start_main_~taud~0 .cse3))) is different from false [2018-12-31 03:31:49,112 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (fp.leq .cse1 .cse2) (= c_ULTIMATE.start_main_~taui~0 .cse3) (fp.geq .cse1 (fp.neg .cse2)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse3) (= c_ULTIMATE.start_main_~taud~0 .cse3))) is different from true [2018-12-31 03:31:51,236 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0)))))))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~taui~0 .cse0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse1 .cse2)) (= .cse3 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse1)) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse3 c_ULTIMATE.start_main_~yc~0) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (fp.geq .cse4 (fp.neg .cse5)) (fp.leq .cse4 .cse5) (= c_ULTIMATE.start_main_~T~0 .cse0) (= c_ULTIMATE.start_main_~taud~0 .cse0)))) is different from false [2018-12-31 03:31:54,229 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0)))))))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~taui~0 .cse0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse1 .cse2)) (= .cse3 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse1)) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse3 c_ULTIMATE.start_main_~yc~0) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (fp.geq .cse4 (fp.neg .cse5)) (fp.leq .cse4 .cse5) (= c_ULTIMATE.start_main_~T~0 .cse0) (= c_ULTIMATE.start_main_~taud~0 .cse0)))) is different from true [2018-12-31 03:31:56,415 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse7 .cse7)) (.cse5 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse4))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse1) .cse3) .cse3)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse3 .cse3) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) (fp.geq .cse5 (fp.neg .cse6)) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse4 .cse7)) (fp.leq .cse5 .cse6) (= .cse0 c_ULTIMATE.start_main_~yc~0)))) is different from true [2018-12-31 03:31:58,633 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.geq .cse0 (fp.neg .cse1)) (= (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse7 (fp.add roundNearestTiesToEven .cse8 .cse8))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse7 .cse8))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2)) (.cse5 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse7))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 .cse4) .cse6) .cse6)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse6) (fp.sub roundNearestTiesToEven .cse4 .cse5))))))))) |c_ULTIMATE.start_y_#res|) (fp.leq .cse0 .cse1) (= .cse3 c_ULTIMATE.start_main_~yc~0))) is different from true [2018-12-31 03:32:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:32:21,264 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-31 03:32:22,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:32:22,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2018-12-31 03:32:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:32:22,250 INFO L225 Difference]: With dead ends: 21 [2018-12-31 03:32:22,250 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 03:32:22,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 73.4s TimeCoverageRelationStatistics Valid=48, Invalid=68, Unknown=22, NotChecked=324, Total=462 [2018-12-31 03:32:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 03:32:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-31 03:32:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 03:32:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-31 03:32:22,261 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2018-12-31 03:32:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:32:22,261 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-31 03:32:22,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 03:32:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-31 03:32:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:32:22,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:32:22,263 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-31 03:32:22,264 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:32:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:32:22,265 INFO L82 PathProgramCache]: Analyzing trace with hash -678030127, now seen corresponding path program 2 times [2018-12-31 03:32:22,265 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:32:22,266 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 [2018-12-31 03:32:22,270 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-31 03:32:33,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 03:32:33,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 03:32:33,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:32:34,030 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-31 03:32:34,882 WARN L181 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-31 03:32:37,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (= c_~ui~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 .cse0))))) (= c_ULTIMATE.start_main_~taui~0 .cse1) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse2 .cse3)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (= (fp.add roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~epi~0) c_ULTIMATE.start_main_~sumej~0) (= c_ULTIMATE.start_main_~T~0 .cse1) (= c_ULTIMATE.start_main_~taud~0 .cse1))))) is different from false [2018-12-31 03:32:39,430 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse4 .cse5)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~taui~0 .cse0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 .cse2)))))) (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse1)) (= .cse3 c_ULTIMATE.start_main_~K~0) (= .cse3 c_ULTIMATE.start_main_~yc~0) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (= (fp.add roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0) c_ULTIMATE.start_main_~sumej~0) (= c_ULTIMATE.start_main_~T~0 .cse0) (= c_ULTIMATE.start_main_~taud~0 .cse0))))) is different from false [2018-12-31 03:32:41,565 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse8 .cse9))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse8)) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse6 .cse2)) (.cse5 (fp.div roundNearestTiesToEven .cse4 .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse2 .cse6))))) c_~yn~0) (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse7) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse7 .cse2)))))) (= .cse1 c_ULTIMATE.start_main_~yc~0))))))) is different from false [2018-12-31 03:32:43,865 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse8 .cse9))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse8)) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse6 .cse2)) (.cse5 (fp.div roundNearestTiesToEven .cse4 .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse2 .cse6))))) c_~yn~0) (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse7) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse7 .cse2)))))) (= .cse1 c_ULTIMATE.start_main_~yc~0))))))) is different from true [2018-12-31 03:32:46,189 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= |c_ULTIMATE.start_y_#res| (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse9 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse7 (fp.add roundNearestTiesToEven .cse9 .cse10))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse8 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse9)) (.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse7))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse8 .cse6)) (.cse5 (fp.div roundNearestTiesToEven .cse4 .cse4))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse6 .cse8))))))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse2) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse2 .cse6))))))))))))) (= .cse1 c_ULTIMATE.start_main_~yc~0))) is different from true [2018-12-31 03:32:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-12-31 03:32:46,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:32:51,140 WARN L181 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 03:33:07,487 WARN L181 SmtUtils]: Spent 6.16 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:33:10,515 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-12-31 03:33:13,555 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-12-31 03:33:16,618 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-12-31 03:33:19,666 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-12-31 03:33:24,097 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (let ((.cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6)) (.cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0))) (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse3 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-12-31 03:33:28,278 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (let ((.cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6)) (.cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0))) (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse3 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-12-31 03:33:32,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse7 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse7))) (let ((.cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6)) (.cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse3 .cse6)))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-12-31 03:33:34,577 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-31 03:33:34,778 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2018-12-31 03:33:34,780 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 [2018-12-31 03:33:34,786 INFO L168 Benchmark]: Toolchain (without parser) took 202634.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.3 MB in the beginning and 977.0 MB in the end (delta: -29.6 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:33:34,788 INFO L168 Benchmark]: CDTParser took 0.23 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. [2018-12-31 03:33:34,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:33:34,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.53 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. [2018-12-31 03:33:34,793 INFO L168 Benchmark]: Boogie Preprocessor took 37.15 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. [2018-12-31 03:33:34,794 INFO L168 Benchmark]: RCFGBuilder took 3737.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:33:34,795 INFO L168 Benchmark]: TraceAbstraction took 198472.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.0 MB in the end (delta: 124.3 MB). Peak memory consumption was 124.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:33:34,801 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.23 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 332.88 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.53 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 37.15 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 3737.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 198472.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.0 MB in the end (delta: 124.3 MB). Peak memory consumption was 124.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...