./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 ............................................................................................................................................................................................................................................................................................................ 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/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2efbbd8e1ed6cd606263edae3254601484469bf9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 08:37:59,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:37:59,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:37:59,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:37:59,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:37:59,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:37:59,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:37:59,159 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:37:59,161 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:37:59,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:37:59,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:37:59,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:37:59,164 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:37:59,165 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:37:59,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:37:59,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:37:59,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:37:59,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:37:59,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:37:59,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:37:59,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:37:59,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:37:59,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:37:59,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:37:59,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:37:59,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:37:59,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:37:59,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:37:59,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:37:59,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:37:59,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:37:59,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:37:59,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:37:59,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:37:59,186 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:37:59,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:37:59,187 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 08:37:59,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:37:59,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:37:59,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:37:59,213 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:37:59,214 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:37:59,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:37:59,214 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:37:59,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 08:37:59,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:37:59,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:37:59,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:37:59,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:37:59,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:37:59,215 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:37:59,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:37:59,216 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:37:59,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:37:59,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:37:59,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:37:59,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:37:59,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:37:59,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:37:59,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:37:59,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:37:59,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:37:59,217 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 08:37:59,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:37:59,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 08:37:59,218 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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2019-01-12 08:37:59,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:37:59,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:37:59,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:37:59,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:37:59,279 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:37:59,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2019-01-12 08:37:59,344 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc661cab/101167781f6846aba6178c5453e4ea8d/FLAG2be727615 [2019-01-12 08:37:59,751 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:37:59,752 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2019-01-12 08:37:59,759 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc661cab/101167781f6846aba6178c5453e4ea8d/FLAG2be727615 [2019-01-12 08:38:00,136 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc661cab/101167781f6846aba6178c5453e4ea8d [2019-01-12 08:38:00,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:38:00,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:38:00,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:38:00,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:38:00,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:38:00,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61721a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00, skipping insertion in model container [2019-01-12 08:38:00,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:38:00,188 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:38:00,441 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:38:00,451 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:38:00,489 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:38:00,514 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:38:00,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00 WrapperNode [2019-01-12 08:38:00,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:38:00,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:38:00,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:38:00,516 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:38:00,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:38:00,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:38:00,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:38:00,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:38:00,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... [2019-01-12 08:38:00,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:38:00,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:38:00,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:38:00,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:38:00,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:38:00,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:38:00,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:38:01,249 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:38:01,249 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:38:01,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:38:01 BoogieIcfgContainer [2019-01-12 08:38:01,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:38:01,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:38:01,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:38:01,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:38:01,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:38:00" (1/3) ... [2019-01-12 08:38:01,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f7c7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:38:01, skipping insertion in model container [2019-01-12 08:38:01,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:00" (2/3) ... [2019-01-12 08:38:01,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f7c7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:38:01, skipping insertion in model container [2019-01-12 08:38:01,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:38:01" (3/3) ... [2019-01-12 08:38:01,262 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2019-01-12 08:38:01,271 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:38:01,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:38:01,296 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:38:01,331 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:38:01,332 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:38:01,332 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:38:01,332 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:38:01,332 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:38:01,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:38:01,333 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:38:01,334 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:38:01,334 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:38:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-01-12 08:38:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 08:38:01,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:38:01,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:38:01,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:38:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:38:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2019-01-12 08:38:01,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:38:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:38:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:38:01,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:38:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:38:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:38:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:38:01,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:38:01,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:38:01,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 08:38:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 08:38:01,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 08:38:01,553 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-01-12 08:38:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:38:01,872 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2019-01-12 08:38:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:38:01,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 08:38:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:38:01,883 INFO L225 Difference]: With dead ends: 51 [2019-01-12 08:38:01,883 INFO L226 Difference]: Without dead ends: 40 [2019-01-12 08:38:01,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:38:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-12 08:38:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2019-01-12 08:38:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 08:38:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-01-12 08:38:01,920 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-01-12 08:38:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:38:01,921 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-12 08:38:01,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 08:38:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-01-12 08:38:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 08:38:01,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:38:01,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:38:01,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:38:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:38:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1984885586, now seen corresponding path program 1 times [2019-01-12 08:38:01,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:38:01,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:38:01,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:38:01,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:38:01,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:38:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:38:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:38:01,965 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 08:38:01,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:38:01 BoogieIcfgContainer [2019-01-12 08:38:01,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:38:01,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:38:01,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:38:01,997 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:38:01,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:38:01" (3/4) ... [2019-01-12 08:38:02,002 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 08:38:02,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:38:02,003 INFO L168 Benchmark]: Toolchain (without parser) took 1862.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:38:02,005 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:38:02,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:38:02,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.75 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:38:02,007 INFO L168 Benchmark]: Boogie Preprocessor took 135.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 08:38:02,009 INFO L168 Benchmark]: RCFGBuilder took 549.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-12 08:38:02,009 INFO L168 Benchmark]: TraceAbstraction took 744.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 08:38:02,010 INFO L168 Benchmark]: Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:38:02,015 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.21 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 372.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.75 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 135.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 549.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 744.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [__return_125=0, __return_main=0, _EPS=1/1000000] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L83] COND FALSE !(main__r >= 1.0) VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L109] main____CPAchecker_TMP_0 = 0 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=1, __return_main=0, _EPS=1/1000000] [L96] __VERIFIER_error() VAL [__return_125=1, __return_main=0, _EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 49 SDslu, 58 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 08:38:04,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:38:04,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:38:04,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:38:04,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:38:04,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:38:04,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:38:04,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:38:04,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:38:04,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:38:04,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:38:04,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:38:04,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:38:04,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:38:04,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:38:04,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:38:04,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:38:04,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:38:04,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:38:04,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:38:04,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:38:04,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:38:04,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:38:04,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:38:04,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:38:04,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:38:04,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:38:04,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:38:04,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:38:04,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:38:04,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:38:04,321 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:38:04,321 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:38:04,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:38:04,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:38:04,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:38:04,324 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 08:38:04,350 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:38:04,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:38:04,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:38:04,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:38:04,352 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:38:04,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:38:04,353 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:38:04,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:38:04,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:38:04,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:38:04,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:38:04,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:38:04,354 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 08:38:04,354 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 08:38:04,354 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:38:04,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:38:04,355 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:38:04,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:38:04,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:38:04,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:38:04,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:38:04,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:38:04,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:38:04,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:38:04,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:38:04,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:38:04,358 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 08:38:04,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:38:04,358 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 08:38:04,358 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 08:38:04,358 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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2019-01-12 08:38:04,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:38:04,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:38:04,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:38:04,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:38:04,426 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:38:04,427 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2019-01-12 08:38:04,483 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d933207/ac5d6792b0164c25999e7f7146678ed9/FLAGbcb3c80f9 [2019-01-12 08:38:04,886 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:38:04,887 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2019-01-12 08:38:04,894 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d933207/ac5d6792b0164c25999e7f7146678ed9/FLAGbcb3c80f9 [2019-01-12 08:38:05,280 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d933207/ac5d6792b0164c25999e7f7146678ed9 [2019-01-12 08:38:05,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:38:05,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:38:05,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:38:05,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:38:05,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:38:05,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6faba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05, skipping insertion in model container [2019-01-12 08:38:05,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:38:05,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:38:05,559 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:38:05,572 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:38:05,601 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:38:05,617 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:38:05,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05 WrapperNode [2019-01-12 08:38:05,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:38:05,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:38:05,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:38:05,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:38:05,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:38:05,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:38:05,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:38:05,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:38:05,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... [2019-01-12 08:38:05,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:38:05,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:38:05,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:38:05,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:38:05,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:38:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:38:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:38:14,682 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:38:14,682 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 08:38:14,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:38:14 BoogieIcfgContainer [2019-01-12 08:38:14,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:38:14,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:38:14,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:38:14,687 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:38:14,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:38:05" (1/3) ... [2019-01-12 08:38:14,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e2f3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:38:14, skipping insertion in model container [2019-01-12 08:38:14,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:38:05" (2/3) ... [2019-01-12 08:38:14,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e2f3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:38:14, skipping insertion in model container [2019-01-12 08:38:14,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:38:14" (3/3) ... [2019-01-12 08:38:14,691 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2019-01-12 08:38:14,702 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:38:14,710 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:38:14,729 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:38:14,761 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:38:14,762 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:38:14,762 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:38:14,762 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:38:14,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:38:14,762 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:38:14,763 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:38:14,763 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:38:14,763 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:38:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-01-12 08:38:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 08:38:14,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:38:14,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:38:14,789 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:38:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:38:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2001896247, now seen corresponding path program 1 times [2019-01-12 08:38:14,800 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:38:14,801 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) [2019-01-12 08:38:14,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 08:38:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:38:16,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:38:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:38:17,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:38:17,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:38:17,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:38:17,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 08:38:17,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 08:38:17,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 08:38:17,081 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-01-12 08:38:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:38:21,467 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2019-01-12 08:38:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:38:21,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 08:38:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:38:21,479 INFO L225 Difference]: With dead ends: 65 [2019-01-12 08:38:21,479 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 08:38:21,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:38:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 08:38:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2019-01-12 08:38:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 08:38:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-01-12 08:38:21,524 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-01-12 08:38:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:38:21,524 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-12 08:38:21,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 08:38:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-01-12 08:38:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 08:38:21,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:38:21,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:38:21,526 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:38:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:38:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash 939018830, now seen corresponding path program 1 times [2019-01-12 08:38:21,531 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:38:21,531 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 08:38:21,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:38:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:38:22,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:38:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:38:22,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:38:23,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:38:23,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:38:23,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 08:38:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 08:38:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:38:23,042 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 5 states. [2019-01-12 08:38:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:38:33,515 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2019-01-12 08:38:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:38:33,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-12 08:38:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:38:33,518 INFO L225 Difference]: With dead ends: 55 [2019-01-12 08:38:33,518 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 08:38:33,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:38:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 08:38:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2019-01-12 08:38:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 08:38:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-12 08:38:33,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2019-01-12 08:38:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:38:33,527 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-12 08:38:33,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 08:38:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-01-12 08:38:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 08:38:33,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:38:33,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:38:33,528 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:38:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:38:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1251138159, now seen corresponding path program 1 times [2019-01-12 08:38:33,530 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:38:33,531 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 08:38:33,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:38:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:38:34,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:38:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:38:34,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:38:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:38:34,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:38:34,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 08:38:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 08:38:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 08:38:34,973 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2019-01-12 08:38:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:38:41,750 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-01-12 08:38:41,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 08:38:41,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 08:38:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:38:41,754 INFO L225 Difference]: With dead ends: 46 [2019-01-12 08:38:41,754 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 08:38:41,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:38:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 08:38:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 08:38:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 08:38:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-12 08:38:41,761 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-01-12 08:38:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:38:41,761 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-12 08:38:41,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 08:38:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-01-12 08:38:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 08:38:41,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:38:41,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:38:41,763 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:38:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:38:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1124243894, now seen corresponding path program 1 times [2019-01-12 08:38:41,765 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:38:41,765 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 08:38:41,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:38:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:38:45,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:38:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:38:45,854 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:38:45,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:38:45,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 08:38:45,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 08:38:45,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 08:38:45,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 08:38:45,925 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-01-12 08:38:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:38:58,065 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-01-12 08:38:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 08:38:58,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-12 08:38:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:38:58,068 INFO L225 Difference]: With dead ends: 64 [2019-01-12 08:38:58,068 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 08:38:58,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 08:38:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 08:38:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-01-12 08:38:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 08:38:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-01-12 08:38:58,078 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2019-01-12 08:38:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:38:58,078 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-01-12 08:38:58,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 08:38:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-01-12 08:38:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 08:38:58,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:38:58,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:38:58,081 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:38:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:38:58,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1669842835, now seen corresponding path program 1 times [2019-01-12 08:38:58,082 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:38:58,082 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 08:38:58,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:39:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:39:01,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:39:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 08:39:01,844 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:39:01,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:39:01,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:39:01,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 08:39:01,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 08:39:01,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 08:39:01,894 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2019-01-12 08:39:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:39:04,954 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2019-01-12 08:39:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:39:04,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 08:39:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:39:04,957 INFO L225 Difference]: With dead ends: 54 [2019-01-12 08:39:04,958 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 08:39:04,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:39:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 08:39:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2019-01-12 08:39:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 08:39:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-01-12 08:39:04,968 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 18 [2019-01-12 08:39:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:39:04,970 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-12 08:39:04,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 08:39:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-01-12 08:39:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 08:39:04,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:39:04,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:39:04,972 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:39:04,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:39:04,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1686853496, now seen corresponding path program 1 times [2019-01-12 08:39:04,973 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:39:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 08:39:04,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:39:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:39:08,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:39:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:39:08,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:39:39,181 WARN L181 SmtUtils]: Spent 4.43 s on a formula simplification that was a NOOP. DAG size: 6 [2019-01-12 08:39:41,832 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-01-12 08:39:44,469 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-01-12 08:39:46,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-01-12 08:39:49,462 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-01-12 08:39:51,966 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-01-12 08:39:54,473 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-01-12 08:39:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-01-12 08:39:54,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:39:54,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-12 08:39:54,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 08:39:54,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 08:39:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=46, Unknown=14, NotChecked=48, Total=132 [2019-01-12 08:39:54,544 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2019-01-12 08:39:58,177 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-01-12 08:40:00,701 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0))) is different from true [2019-01-12 08:40:03,377 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0) (= .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0))) is different from true [2019-01-12 08:41:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:41:12,713 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2019-01-12 08:41:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 08:41:13,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-01-12 08:41:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:41:13,088 INFO L225 Difference]: With dead ends: 97 [2019-01-12 08:41:13,088 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 08:41:13,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 56.5s TimeCoverageRelationStatistics Valid=36, Invalid=60, Unknown=18, NotChecked=126, Total=240 [2019-01-12 08:41:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 08:41:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 39. [2019-01-12 08:41:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 08:41:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-01-12 08:41:13,103 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 18 [2019-01-12 08:41:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:41:13,104 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-01-12 08:41:13,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 08:41:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-01-12 08:41:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 08:41:13,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:41:13,105 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:41:13,105 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:41:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:41:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1075575453, now seen corresponding path program 1 times [2019-01-12 08:41:13,108 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:41:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 08:41:13,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 08:41:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:41:19,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:41:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:41:19,115 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:41:19,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:41:19,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:41:19,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 08:41:19,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 08:41:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 08:41:19,188 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2019-01-12 08:41:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:41:26,753 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2019-01-12 08:41:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 08:41:27,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-12 08:41:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:41:27,128 INFO L225 Difference]: With dead ends: 66 [2019-01-12 08:41:27,129 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 08:41:27,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:41:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 08:41:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-12 08:41:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 08:41:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-01-12 08:41:27,142 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 22 [2019-01-12 08:41:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:41:27,142 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-12 08:41:27,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 08:41:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-01-12 08:41:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 08:41:27,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:41:27,145 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:41:27,145 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:41:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:41:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash 340173568, now seen corresponding path program 1 times [2019-01-12 08:41:27,147 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:41:27,147 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 08:41:27,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:41:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:41:33,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:41:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 08:41:33,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:41:33,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:41:33,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 08:41:33,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 08:41:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 08:41:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 08:41:33,360 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 7 states. [2019-01-12 08:41:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:41:41,842 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-01-12 08:41:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 08:41:41,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 08:41:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:41:41,844 INFO L225 Difference]: With dead ends: 73 [2019-01-12 08:41:41,844 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 08:41:41,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 08:41:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 08:41:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-12 08:41:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 08:41:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-01-12 08:41:41,857 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2019-01-12 08:41:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:41:41,857 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-01-12 08:41:41,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 08:41:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-01-12 08:41:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 08:41:41,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:41:41,859 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:41:41,859 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:41:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:41:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 13709678, now seen corresponding path program 1 times [2019-01-12 08:41:41,860 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:41:41,860 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-01-12 08:41:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:41:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:41:47,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:41:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 08:41:47,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:41:49,993 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-01-12 08:41:52,080 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-01-12 08:41:54,539 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-01-12 08:41:57,002 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-01-12 08:41:59,459 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-01-12 08:42:01,927 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-01-12 08:42:04,404 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2019-01-12 08:42:06,876 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2019-01-12 08:42:17,537 WARN L181 SmtUtils]: Spent 2.67 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 08:42:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2019-01-12 08:42:17,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:42:17,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-01-12 08:42:17,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 08:42:17,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 08:42:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=63, Unknown=8, NotChecked=76, Total=182 [2019-01-12 08:42:17,634 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 14 states. [2019-01-12 08:42:20,144 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse2 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-01-12 08:42:22,631 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-01-12 08:42:25,132 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse2 .cse2)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))))) is different from true [2019-01-12 08:42:27,230 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 c_ULTIMATE.start_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_main_~SqrtR__xn~0 (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) is different from true [2019-01-12 08:43:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:43:03,213 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2019-01-12 08:43:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 08:43:03,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-01-12 08:43:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:43:03,218 INFO L225 Difference]: With dead ends: 90 [2019-01-12 08:43:03,218 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 08:43:03,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=12, NotChecked=184, Total=306 [2019-01-12 08:43:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 08:43:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2019-01-12 08:43:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 08:43:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-01-12 08:43:03,238 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 29 [2019-01-12 08:43:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:43:03,238 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-01-12 08:43:03,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 08:43:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-01-12 08:43:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 08:43:03,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:43:03,241 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:43:03,242 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:43:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:43:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1340342541, now seen corresponding path program 1 times [2019-01-12 08:43:03,242 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:43:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-01-12 08:43:03,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:43:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:43:08,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:43:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 08:43:08,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:43:09,963 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 08:43:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 08:43:10,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:43:10,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-12 08:43:10,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 08:43:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 08:43:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 08:43:10,045 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 8 states. [2019-01-12 08:43:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:43:20,511 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2019-01-12 08:43:20,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 08:43:20,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 08:43:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:43:20,514 INFO L225 Difference]: With dead ends: 85 [2019-01-12 08:43:20,514 INFO L226 Difference]: Without dead ends: 60 [2019-01-12 08:43:20,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-12 08:43:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-12 08:43:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2019-01-12 08:43:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 08:43:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-12 08:43:20,531 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 29 [2019-01-12 08:43:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:43:20,531 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-12 08:43:20,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 08:43:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-12 08:43:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 08:43:20,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:43:20,534 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:43:20,535 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:43:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:43:20,535 INFO L82 PathProgramCache]: Analyzing trace with hash -426284202, now seen corresponding path program 1 times [2019-01-12 08:43:20,535 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:43:20,536 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-01-12 08:43:20,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:43:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:43:28,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:43:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 08:43:28,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:43:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:43:28,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 08:43:28,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 08:43:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 08:43:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 08:43:28,835 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2019-01-12 08:43:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:43:39,448 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2019-01-12 08:43:39,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 08:43:39,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-12 08:43:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:43:39,810 INFO L225 Difference]: With dead ends: 72 [2019-01-12 08:43:39,810 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 08:43:39,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:43:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 08:43:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-12 08:43:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 08:43:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-12 08:43:39,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 33 [2019-01-12 08:43:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:43:39,827 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-12 08:43:39,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 08:43:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-12 08:43:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 08:43:39,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:43:39,828 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:43:39,828 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:43:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:43:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 119314739, now seen corresponding path program 1 times [2019-01-12 08:43:39,829 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:43:39,829 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-01-12 08:43:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:43:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:43:48,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:43:56,101 WARN L181 SmtUtils]: Spent 5.47 s on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 08:43:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 08:43:56,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:43:58,583 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from false [2019-01-12 08:44:00,951 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from true [2019-01-12 08:44:03,688 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2019-01-12 08:44:06,426 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2019-01-12 08:44:09,161 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2019-01-12 08:44:11,891 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2019-01-12 08:44:14,634 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2019-01-12 08:44:17,408 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2019-01-12 08:44:19,044 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-12 08:44:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2019-01-12 08:44:19,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:44:19,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-01-12 08:44:19,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 08:44:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 08:44:19,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=62, Unknown=8, NotChecked=76, Total=182 [2019-01-12 08:44:19,144 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 14 states. [2019-01-12 08:44:21,954 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse3 c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-01-12 08:44:24,727 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) (= (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) c_ULTIMATE.start_main_~main__d~0))) is different from true [2019-01-12 08:44:27,494 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2019-01-12 08:44:29,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0)) (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))) is different from false [2019-01-12 08:44:32,176 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0)) (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse1 .cse1)))))) is different from true [2019-01-12 08:45:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:45:00,870 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2019-01-12 08:45:00,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 08:45:00,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-01-12 08:45:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:45:00,873 INFO L225 Difference]: With dead ends: 83 [2019-01-12 08:45:00,873 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 08:45:00,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=44, Invalid=65, Unknown=13, NotChecked=184, Total=306 [2019-01-12 08:45:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 08:45:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-01-12 08:45:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 08:45:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-01-12 08:45:00,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2019-01-12 08:45:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:45:00,892 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-01-12 08:45:00,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 08:45:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-01-12 08:45:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 08:45:00,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:45:00,894 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:45:00,896 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:45:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:45:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 346299736, now seen corresponding path program 2 times [2019-01-12 08:45:00,896 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:45:00,897 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-01-12 08:45:00,902 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 08:45:10,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 08:45:10,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:45:11,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:45:14,065 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__Input~0)) (= c_ULTIMATE.start_main_~SqrtR__Input~0 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2019-01-12 08:45:25,695 WARN L181 SmtUtils]: Spent 5.86 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 08:45:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2019-01-12 08:45:25,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:45:28,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~SqrtR__xnp1~0) .cse0)) is different from false [2019-01-12 08:45:32,339 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2019-01-12 08:45:35,041 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0) c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2019-01-12 08:45:38,111 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2019-01-12 08:45:41,146 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~SqrtR__xn~0) c_ULTIMATE.start_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2019-01-12 08:45:42,897 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-12 08:45:43,099 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-01-12 08:45:43,100 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2019-01-12 08:45:43,104 INFO L168 Benchmark]: Toolchain (without parser) took 457820.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -74.4 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2019-01-12 08:45:43,105 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:45:43,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:45:43,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.90 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:45:43,107 INFO L168 Benchmark]: Boogie Preprocessor took 108.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:45:43,108 INFO L168 Benchmark]: RCFGBuilder took 8907.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:45:43,109 INFO L168 Benchmark]: TraceAbstraction took 448419.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.6 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:45:43,114 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.90 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8907.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 448419.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.6 MB). Peak memory consumption was 92.4 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...